fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r329-tall-171662361800227
Last Updated
July 7, 2024

About the Execution of 2023-gold for RERS2020-PT-pb105

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16173.888 3600000.00 3982450.00 20851.80 T??TFTFFFFFT??TF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361800227.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RERS2020-PT-pb105, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361800227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 86M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716845809317

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb105
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 21:36:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 21:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:36:53] [INFO ] Load time of PNML (sax parser for PT used): 2257 ms
[2024-05-27 21:36:53] [INFO ] Transformed 1982 places.
[2024-05-27 21:36:53] [INFO ] Transformed 153412 transitions.
[2024-05-27 21:36:53] [INFO ] Found NUPN structural information;
[2024-05-27 21:36:53] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 2988 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
FORMULA RERS2020-PT-pb105-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Ensure Unique test removed 10 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1971 transition count 149639
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1969 transition count 149636
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1969 transition count 149636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 1969 transition count 149634
Applied a total of 17 rules in 1132 ms. Remains 1969 /1982 variables (removed 13) and now considering 149634/149639 (removed 5) transitions.
[2024-05-27 21:36:56] [INFO ] Flow matrix only has 105324 transitions (discarded 44310 similar events)
// Phase 1: matrix 105324 rows 1969 cols
[2024-05-27 21:36:56] [INFO ] Computed 10 invariants in 578 ms
[2024-05-27 21:37:06] [INFO ] Implicit Places using invariants in 10038 ms returned []
Implicit Place search using SMT only with invariants took 10072 ms to find 0 implicit places.
[2024-05-27 21:37:06] [INFO ] Flow matrix only has 105324 transitions (discarded 44310 similar events)
[2024-05-27 21:37:06] [INFO ] Invariant cache hit.
[2024-05-27 21:37:36] [INFO ] Performed 86910/149634 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:37:58] [INFO ] Dead Transitions using invariants and state equation in 52153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1969/1982 places, 149634/149639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63373 ms. Remains : 1969/1982 places, 149634/149639 transitions.
Support contains 38 out of 1969 places after structural reductions.
[2024-05-27 21:38:02] [INFO ] Flatten gal took : 3470 ms
[2024-05-27 21:38:06] [INFO ] Flatten gal took : 3679 ms
[2024-05-27 21:38:13] [INFO ] Input system was already deterministic with 149634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1109 ms. (steps per millisecond=9 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-27 21:38:17] [INFO ] Flow matrix only has 105324 transitions (discarded 44310 similar events)
[2024-05-27 21:38:17] [INFO ] Invariant cache hit.
[2024-05-27 21:38:17] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-27 21:38:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 21:38:42] [INFO ] After 24107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-27 21:38:44] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:38:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:38:44] [INFO ] After 26481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 29 out of 1969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1633 edges and 1969 vertex of which 112 / 1969 are part of one of the 42 SCC in 22 ms
Free SCC test removed 70 places
Drop transitions removed 3841 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4325 transitions.
Graph (complete) has 126323 edges and 1899 vertex of which 1898 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.114 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1898 transition count 145303
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1893 transition count 145303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1893 transition count 145300
Deduced a syphon composed of 3 places in 68 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1890 transition count 145300
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 27 place count 1882 transition count 145252
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 1882 transition count 145252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 43 place count 1882 transition count 145244
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 50 place count 1875 transition count 145230
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 1875 transition count 145230
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 64 place count 1875 transition count 145223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 1872 transition count 145217
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 1872 transition count 145217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 1872 transition count 145214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 64 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 123 place count 1847 transition count 145189
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 129 place count 1847 transition count 145183
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 27 places in 63 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 183 place count 1820 transition count 145279
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 206 place count 1820 transition count 145256
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 231 place count 1820 transition count 145225
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 843 place count 1795 transition count 144638
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 846 place count 1795 transition count 144635
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 902 place count 1792 transition count 144582
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 905 place count 1792 transition count 144579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 911 place count 1789 transition count 144576
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 912 place count 1789 transition count 144575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 913 place count 1788 transition count 144575
Free-agglomeration rule (complex) applied 111 times with reduction of 3374 identical transitions.
Iterating global reduction 11 with 111 rules applied. Total rules applied 1024 place count 1788 transition count 170346
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 132 transitions
Ensure Unique test removed 6403 transitions
Reduce isomorphic transitions removed 6535 transitions.
Iterating post reduction 11 with 6646 rules applied. Total rules applied 7670 place count 1677 transition count 163811
Applied a total of 7670 rules in 11646 ms. Remains 1677 /1969 variables (removed 292) and now considering 163811/149634 (removed -14177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11650 ms. Remains : 1677/1969 places, 163811/149634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1353 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 8406 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8406 steps, saw 6908 distinct states, run finished after 6009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-27 21:39:04] [INFO ] Flow matrix only has 120980 transitions (discarded 42831 similar events)
// Phase 1: matrix 120980 rows 1677 cols
[2024-05-27 21:39:05] [INFO ] Computed 10 invariants in 602 ms
[2024-05-27 21:39:05] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-27 21:39:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-27 21:39:30] [INFO ] After 24353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-27 21:39:32] [INFO ] State equation strengthened by 6002 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:39:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:39:32] [INFO ] After 27125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 1677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1677/1677 places, 163811/163811 transitions.
Free-agglomeration rule (complex) applied 2 times with reduction of 134 identical transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1677 transition count 164221
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 1675 transition count 164179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1674 transition count 164178
Applied a total of 47 rules in 2681 ms. Remains 1674 /1677 variables (removed 3) and now considering 164178/163811 (removed -367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2681 ms. Remains : 1674/1677 places, 164178/163811 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1268 ms. (steps per millisecond=7 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 8494 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8494 steps, saw 6984 distinct states, run finished after 6007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 10 properties.
[2024-05-27 21:39:44] [INFO ] Flow matrix only has 121319 transitions (discarded 42859 similar events)
// Phase 1: matrix 121319 rows 1674 cols
[2024-05-27 21:39:45] [INFO ] Computed 10 invariants in 637 ms
[2024-05-27 21:39:45] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-27 21:39:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 21:40:10] [INFO ] After 24370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-27 21:40:12] [INFO ] State equation strengthened by 6028 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:40:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:40:12] [INFO ] After 26822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 1674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1674/1674 places, 164178/164178 transitions.
Applied a total of 0 rules in 1109 ms. Remains 1674 /1674 variables (removed 0) and now considering 164178/164178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 1674/1674 places, 164178/164178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1674/1674 places, 164178/164178 transitions.
Applied a total of 0 rules in 813 ms. Remains 1674 /1674 variables (removed 0) and now considering 164178/164178 (removed 0) transitions.
[2024-05-27 21:40:14] [INFO ] Flow matrix only has 121319 transitions (discarded 42859 similar events)
[2024-05-27 21:40:14] [INFO ] Invariant cache hit.
[2024-05-27 21:40:23] [INFO ] Implicit Places using invariants in 9181 ms returned []
Implicit Place search using SMT only with invariants took 9182 ms to find 0 implicit places.
[2024-05-27 21:40:23] [INFO ] Flow matrix only has 121319 transitions (discarded 42859 similar events)
[2024-05-27 21:40:23] [INFO ] Invariant cache hit.
[2024-05-27 21:40:53] [INFO ] Performed 92460/164178 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:41:16] [INFO ] Dead Transitions using invariants and state equation in 52417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62426 ms. Remains : 1674/1674 places, 164178/164178 transitions.
Computed a total of 188 stabilizing places and 32938 stable transitions
Graph (complete) has 144577 edges and 1969 vertex of which 1968 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.479 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1674 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.121 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149041
Deduced a syphon composed of 3 places in 58 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149041
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1883 transition count 148981
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1883 transition count 148981
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 1883 transition count 148974
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 1876 transition count 148960
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 1876 transition count 148960
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 54 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 63 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 59 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 97 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 59 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 154 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 173 place count 1828 transition count 149003
Applied a total of 173 rules in 5195 ms. Remains 1828 /1969 variables (removed 141) and now considering 149003/149634 (removed 631) transitions.
[2024-05-27 21:41:22] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 21:41:22] [INFO ] Computed 10 invariants in 422 ms
[2024-05-27 21:41:30] [INFO ] Implicit Places using invariants in 8904 ms returned []
Implicit Place search using SMT only with invariants took 8905 ms to find 0 implicit places.
[2024-05-27 21:41:30] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:41:30] [INFO ] Invariant cache hit.
[2024-05-27 21:42:01] [INFO ] Performed 91497/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:42:20] [INFO ] Dead Transitions using invariants and state equation in 49879 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1969 places, 149003/149634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63983 ms. Remains : 1828/1969 places, 149003/149634 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s39 0) (EQ s1028 1)), p1:(OR (EQ s1641 0) (EQ s1215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 7354 ms.
Product exploration explored 100000 steps with 1 reset in 8550 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1070 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5333 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5333 steps, saw 3979 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:42:42] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:42:42] [INFO ] Invariant cache hit.
[2024-05-27 21:42:43] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:42:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-27 21:43:08] [INFO ] After 24750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:43:08] [INFO ] State equation strengthened by 5200 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:43:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:43:08] [INFO ] After 25804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 55 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 7376 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7381 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4817 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4817 steps, saw 4000 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:43:20] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2024-05-27 21:43:21] [INFO ] Computed 10 invariants in 639 ms
[2024-05-27 21:43:21] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:43:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 21:43:46] [INFO ] After 24782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:43:47] [INFO ] State equation strengthened by 6068 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:43:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:43:47] [INFO ] After 25977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 736 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 736 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 718 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2024-05-27 21:43:49] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 21:43:49] [INFO ] Invariant cache hit.
[2024-05-27 21:43:57] [INFO ] Implicit Places using invariants in 8884 ms returned []
Implicit Place search using SMT only with invariants took 8885 ms to find 0 implicit places.
[2024-05-27 21:43:57] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 21:43:57] [INFO ] Invariant cache hit.
[2024-05-27 21:44:28] [INFO ] Performed 88318/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:44:52] [INFO ] Dead Transitions using invariants and state equation in 54655 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64273 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 697 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2024-05-27 21:44:53] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 21:44:54] [INFO ] Computed 10 invariants in 495 ms
[2024-05-27 21:45:03] [INFO ] Implicit Places using invariants in 9483 ms returned []
Implicit Place search using SMT only with invariants took 9486 ms to find 0 implicit places.
[2024-05-27 21:45:03] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:45:03] [INFO ] Invariant cache hit.
[2024-05-27 21:45:33] [INFO ] Performed 87372/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:45:54] [INFO ] Dead Transitions using invariants and state equation in 51681 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61867 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4928 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4928 steps, saw 3667 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:46:00] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:46:00] [INFO ] Invariant cache hit.
[2024-05-27 21:46:00] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:46:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 21:46:25] [INFO ] After 24757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:46:26] [INFO ] State equation strengthened by 5200 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:46:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:46:26] [INFO ] After 25813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 60 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8213 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8217 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4835 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4835 steps, saw 4011 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:46:39] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2024-05-27 21:46:40] [INFO ] Computed 10 invariants in 617 ms
[2024-05-27 21:46:40] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 21:46:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 21:47:05] [INFO ] After 24768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 21:47:06] [INFO ] State equation strengthened by 6068 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 21:47:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 21:47:06] [INFO ] After 26694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 1056 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1056 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 817 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2024-05-27 21:47:08] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 21:47:08] [INFO ] Invariant cache hit.
[2024-05-27 21:47:18] [INFO ] Implicit Places using invariants in 9499 ms returned []
Implicit Place search using SMT only with invariants took 9500 ms to find 0 implicit places.
[2024-05-27 21:47:18] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 21:47:18] [INFO ] Invariant cache hit.
[2024-05-27 21:47:48] [INFO ] Performed 88362/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:48:12] [INFO ] Dead Transitions using invariants and state equation in 54237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64570 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 9250 ms.
Product exploration timeout after 86680 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin16930258721746086353
[2024-05-27 21:48:32] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2024-05-27 21:48:33] [INFO ] Built C files in 1055ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16930258721746086353
Running compilation step : cd /tmp/ltsmin16930258721746086353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16930258721746086353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16930258721746086353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 663 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2024-05-27 21:48:37] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 21:48:37] [INFO ] Computed 10 invariants in 427 ms
[2024-05-27 21:48:46] [INFO ] Implicit Places using invariants in 9213 ms returned []
Implicit Place search using SMT only with invariants took 9214 ms to find 0 implicit places.
[2024-05-27 21:48:46] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:48:46] [INFO ] Invariant cache hit.
[2024-05-27 21:49:16] [INFO ] Performed 88221/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:49:37] [INFO ] Dead Transitions using invariants and state equation in 51381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61262 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Built C files in :
/tmp/ltsmin1312991654128070854
[2024-05-27 21:49:37] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2024-05-27 21:49:38] [INFO ] Built C files in 893ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1312991654128070854
Running compilation step : cd /tmp/ltsmin1312991654128070854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1312991654128070854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1312991654128070854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 21:49:48] [INFO ] Flatten gal took : 4009 ms
[2024-05-27 21:49:52] [INFO ] Flatten gal took : 3482 ms
[2024-05-27 21:49:52] [INFO ] Time to serialize gal into /tmp/LTL7238955161175700302.gal : 487 ms
[2024-05-27 21:49:52] [INFO ] Time to serialize properties into /tmp/LTL17477719311551867617.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7238955161175700302.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16678580847395485659.hoa' '-atoms' '/tmp/LTL17477719311551867617.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-05-27 21:50:14] [INFO ] Flatten gal took : 3183 ms
[2024-05-27 21:50:17] [INFO ] Flatten gal took : 3137 ms
[2024-05-27 21:50:17] [INFO ] Time to serialize gal into /tmp/LTL8056911890477014525.gal : 484 ms
[2024-05-27 21:50:17] [INFO ] Time to serialize properties into /tmp/LTL11744085831955507781.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8056911890477014525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11744085831955507781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-27 21:50:36] [INFO ] Flatten gal took : 3412 ms
[2024-05-27 21:50:36] [INFO ] Applying decomposition
[2024-05-27 21:50:39] [INFO ] Flatten gal took : 3249 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1016764352354584486.txt' '-o' '/tmp/graph1016764352354584486.bin' '-w' '/tmp/graph1016764352354584486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1016764352354584486.bin' '-l' '-1' '-v' '-w' '/tmp/graph1016764352354584486.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:50:47] [INFO ] Decomposing Gal with order
[2024-05-27 21:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:50:59] [INFO ] Removed a total of 312267 redundant transitions.
[2024-05-27 21:51:01] [INFO ] Flatten gal took : 9035 ms
[2024-05-27 21:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 3878 labels/synchronizations in 9526 ms.
[2024-05-27 21:51:15] [INFO ] Time to serialize gal into /tmp/LTL2977899005531194638.gal : 246 ms
[2024-05-27 21:51:15] [INFO ] Time to serialize properties into /tmp/LTL9319386438134293862.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2977899005531194638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9319386438134293862.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3262506059504315785
[2024-05-27 21:51:31] [INFO ] Built C files in 986ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3262506059504315785
Running compilation step : cd /tmp/ltsmin3262506059504315785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3262506059504315785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3262506059504315785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLCardinality-01 finished in 617875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1672 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.86 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149041
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149041
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1883 transition count 148981
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1883 transition count 148981
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 1883 transition count 148974
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 1876 transition count 148960
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 1876 transition count 148960
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 54 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 63 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 97 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 58 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 154 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 173 place count 1828 transition count 149003
Applied a total of 173 rules in 5101 ms. Remains 1828 /1969 variables (removed 141) and now considering 149003/149634 (removed 631) transitions.
[2024-05-27 21:51:39] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:51:39] [INFO ] Invariant cache hit.
[2024-05-27 21:51:48] [INFO ] Implicit Places using invariants in 8420 ms returned []
Implicit Place search using SMT only with invariants took 8424 ms to find 0 implicit places.
[2024-05-27 21:51:48] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:51:48] [INFO ] Invariant cache hit.
[2024-05-27 21:52:18] [INFO ] Performed 89102/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:52:38] [INFO ] Dead Transitions using invariants and state equation in 49817 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1969 places, 149003/149634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63348 ms. Remains : 1828/1969 places, 149003/149634 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1175 0) (EQ s1507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1279 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3919 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3919 steps, saw 2980 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:52:43] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:52:43] [INFO ] Invariant cache hit.
[2024-05-27 21:52:44] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:52:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-27 21:53:09] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 66 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 115 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 115 rules applied. Total rules applied 4603 place count 1783 transition count 172780
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7624 transitions
Reduce isomorphic transitions removed 7762 transitions.
Iterating post reduction 7 with 7877 rules applied. Total rules applied 12480 place count 1668 transition count 165018
Applied a total of 12480 rules in 8490 ms. Remains 1668 /1828 variables (removed 160) and now considering 165018/149003 (removed -16015) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8495 ms. Remains : 1668/1828 places, 165018/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1317 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4400 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4400 steps, saw 3650 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:53:22] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
// Phase 1: matrix 122080 rows 1668 cols
[2024-05-27 21:53:22] [INFO ] Computed 10 invariants in 556 ms
[2024-05-27 21:53:23] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-27 21:53:48] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 165018/165018 transitions.
Applied a total of 0 rules in 713 ms. Remains 1668 /1668 variables (removed 0) and now considering 165018/165018 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 1668/1668 places, 165018/165018 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 165018/165018 transitions.
Applied a total of 0 rules in 711 ms. Remains 1668 /1668 variables (removed 0) and now considering 165018/165018 (removed 0) transitions.
[2024-05-27 21:53:49] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
[2024-05-27 21:53:49] [INFO ] Invariant cache hit.
[2024-05-27 21:53:58] [INFO ] Implicit Places using invariants in 8886 ms returned []
Implicit Place search using SMT only with invariants took 8887 ms to find 0 implicit places.
[2024-05-27 21:53:58] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
[2024-05-27 21:53:58] [INFO ] Invariant cache hit.
[2024-05-27 21:54:28] [INFO ] Performed 91288/165018 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:54:51] [INFO ] Dead Transitions using invariants and state equation in 53343 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62954 ms. Remains : 1668/1668 places, 165018/165018 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 649 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2024-05-27 21:54:52] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 21:54:53] [INFO ] Computed 10 invariants in 407 ms
[2024-05-27 21:55:01] [INFO ] Implicit Places using invariants in 9145 ms returned []
Implicit Place search using SMT only with invariants took 9146 ms to find 0 implicit places.
[2024-05-27 21:55:01] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:55:01] [INFO ] Invariant cache hit.
[2024-05-27 21:55:32] [INFO ] Performed 88422/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:55:52] [INFO ] Dead Transitions using invariants and state equation in 50282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60082 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 826 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6061 steps, run timeout after 3005 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6061 steps, saw 4460 distinct states, run finished after 3006 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:55:57] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:55:57] [INFO ] Invariant cache hit.
[2024-05-27 21:55:57] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:55:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-27 21:56:22] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 57 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 115 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 115 rules applied. Total rules applied 4603 place count 1783 transition count 172780
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7624 transitions
Reduce isomorphic transitions removed 7762 transitions.
Iterating post reduction 7 with 7877 rules applied. Total rules applied 12480 place count 1668 transition count 165018
Applied a total of 12480 rules in 7557 ms. Remains 1668 /1828 variables (removed 160) and now considering 165018/149003 (removed -16015) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7562 ms. Remains : 1668/1828 places, 165018/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4476 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4476 steps, saw 3712 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:56:34] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
// Phase 1: matrix 122080 rows 1668 cols
[2024-05-27 21:56:34] [INFO ] Computed 10 invariants in 512 ms
[2024-05-27 21:56:35] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:56:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-27 21:57:00] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 165018/165018 transitions.
Applied a total of 0 rules in 721 ms. Remains 1668 /1668 variables (removed 0) and now considering 165018/165018 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 1668/1668 places, 165018/165018 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 165018/165018 transitions.
Applied a total of 0 rules in 716 ms. Remains 1668 /1668 variables (removed 0) and now considering 165018/165018 (removed 0) transitions.
[2024-05-27 21:57:01] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
[2024-05-27 21:57:01] [INFO ] Invariant cache hit.
[2024-05-27 21:57:10] [INFO ] Implicit Places using invariants in 8710 ms returned []
Implicit Place search using SMT only with invariants took 8712 ms to find 0 implicit places.
[2024-05-27 21:57:10] [INFO ] Flow matrix only has 122080 transitions (discarded 42938 similar events)
[2024-05-27 21:57:10] [INFO ] Invariant cache hit.
[2024-05-27 21:57:40] [INFO ] Performed 90807/165018 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:58:03] [INFO ] Dead Transitions using invariants and state equation in 53252 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62697 ms. Remains : 1668/1668 places, 165018/165018 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 9763 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Built C files in :
/tmp/ltsmin12366605203581612374
[2024-05-27 21:58:13] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2024-05-27 21:58:14] [INFO ] Built C files in 892ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12366605203581612374
Running compilation step : cd /tmp/ltsmin12366605203581612374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12366605203581612374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12366605203581612374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 679 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2024-05-27 21:58:18] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 21:58:18] [INFO ] Computed 10 invariants in 447 ms
[2024-05-27 21:58:27] [INFO ] Implicit Places using invariants in 9103 ms returned []
Implicit Place search using SMT only with invariants took 9104 ms to find 0 implicit places.
[2024-05-27 21:58:27] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 21:58:27] [INFO ] Invariant cache hit.
[2024-05-27 21:58:57] [INFO ] Performed 86415/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 21:59:18] [INFO ] Dead Transitions using invariants and state equation in 50856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60643 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Built C files in :
/tmp/ltsmin12628296870428397970
[2024-05-27 21:59:18] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2024-05-27 21:59:19] [INFO ] Built C files in 831ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12628296870428397970
Running compilation step : cd /tmp/ltsmin12628296870428397970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12628296870428397970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12628296870428397970;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 21:59:27] [INFO ] Flatten gal took : 3372 ms
[2024-05-27 21:59:31] [INFO ] Flatten gal took : 3801 ms
[2024-05-27 21:59:32] [INFO ] Time to serialize gal into /tmp/LTL2889399853514902058.gal : 806 ms
[2024-05-27 21:59:32] [INFO ] Time to serialize properties into /tmp/LTL14893764518757440067.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2889399853514902058.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6921728243373622992.hoa' '-atoms' '/tmp/LTL14893764518757440067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2024-05-27 21:59:53] [INFO ] Flatten gal took : 3396 ms
[2024-05-27 21:59:57] [INFO ] Flatten gal took : 3515 ms
[2024-05-27 21:59:57] [INFO ] Time to serialize gal into /tmp/LTL10322446705929008626.gal : 526 ms
[2024-05-27 21:59:57] [INFO ] Time to serialize properties into /tmp/LTL1145714189553508224.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10322446705929008626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1145714189553508224.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-27 22:00:16] [INFO ] Flatten gal took : 3422 ms
[2024-05-27 22:00:16] [INFO ] Applying decomposition
[2024-05-27 22:00:20] [INFO ] Flatten gal took : 3752 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7310650269520425543.txt' '-o' '/tmp/graph7310650269520425543.bin' '-w' '/tmp/graph7310650269520425543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7310650269520425543.bin' '-l' '-1' '-v' '-w' '/tmp/graph7310650269520425543.weights' '-q' '0' '-e' '0.001'
[2024-05-27 22:00:27] [INFO ] Decomposing Gal with order
[2024-05-27 22:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 22:00:39] [INFO ] Removed a total of 312003 redundant transitions.
[2024-05-27 22:00:40] [INFO ] Flatten gal took : 9073 ms
[2024-05-27 22:00:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4982 labels/synchronizations in 9191 ms.
[2024-05-27 22:00:54] [INFO ] Time to serialize gal into /tmp/LTL14809439969860649441.gal : 171 ms
[2024-05-27 22:00:54] [INFO ] Time to serialize properties into /tmp/LTL1236308072239270518.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14809439969860649441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1236308072239270518.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13672163215079721166
[2024-05-27 22:01:10] [INFO ] Built C files in 879ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13672163215079721166
Running compilation step : cd /tmp/ltsmin13672163215079721166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13672163215079721166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13672163215079721166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLCardinality-02 finished in 578444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&F(p2)))))'
Support contains 3 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1968 transition count 149586
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1968 transition count 149586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1967 transition count 149583
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1967 transition count 149582
Applied a total of 6 rules in 947 ms. Remains 1967 /1969 variables (removed 2) and now considering 149582/149634 (removed 52) transitions.
[2024-05-27 22:01:14] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:01:14] [INFO ] Computed 10 invariants in 384 ms
[2024-05-27 22:01:23] [INFO ] Implicit Places using invariants in 9420 ms returned []
Implicit Place search using SMT only with invariants took 9423 ms to find 0 implicit places.
[2024-05-27 22:01:23] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:01:23] [INFO ] Invariant cache hit.
[2024-05-27 22:01:53] [INFO ] Performed 87741/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:02:15] [INFO ] Dead Transitions using invariants and state equation in 51912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1969 places, 149582/149634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62291 ms. Remains : 1967/1969 places, 149582/149634 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (EQ s1715 0) (EQ s1663 1)), p0:(EQ s1625 0), p1:(EQ s1625 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, null, null][false, false, false, false]]
Product exploration timeout after 48820 steps with 24410 reset in 10001 ms.
Product exploration timeout after 53160 steps with 26580 reset in 10001 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.310 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLCardinality-03 finished in 83292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1667 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.87 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149041
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149041
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1883 transition count 148981
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1883 transition count 148981
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 1883 transition count 148974
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 1876 transition count 148960
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 1876 transition count 148960
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 54 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 63 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 97 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 57 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 154 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 173 place count 1828 transition count 149003
Applied a total of 173 rules in 4875 ms. Remains 1828 /1969 variables (removed 141) and now considering 149003/149634 (removed 631) transitions.
[2024-05-27 22:02:41] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 22:02:41] [INFO ] Computed 10 invariants in 367 ms
[2024-05-27 22:02:50] [INFO ] Implicit Places using invariants in 9012 ms returned []
Implicit Place search using SMT only with invariants took 9013 ms to find 0 implicit places.
[2024-05-27 22:02:50] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 22:02:50] [INFO ] Invariant cache hit.
[2024-05-27 22:03:20] [INFO ] Performed 87301/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:03:42] [INFO ] Dead Transitions using invariants and state equation in 51797 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1969 places, 149003/149634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65689 ms. Remains : 1828/1969 places, 149003/149634 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (NEQ s810 0) (NEQ s155 1)) (AND (NEQ s37 0) (NEQ s911 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-04 finished in 65938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||G(p2)))))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1968 transition count 149586
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1968 transition count 149586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1967 transition count 149583
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1967 transition count 149582
Applied a total of 6 rules in 881 ms. Remains 1967 /1969 variables (removed 2) and now considering 149582/149634 (removed 52) transitions.
[2024-05-27 22:03:43] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:03:43] [INFO ] Computed 10 invariants in 412 ms
[2024-05-27 22:03:52] [INFO ] Implicit Places using invariants in 9155 ms returned []
Implicit Place search using SMT only with invariants took 9156 ms to find 0 implicit places.
[2024-05-27 22:03:52] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:03:52] [INFO ] Invariant cache hit.
[2024-05-27 22:04:22] [INFO ] Performed 83824/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:04:45] [INFO ] Dead Transitions using invariants and state equation in 53016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1969 places, 149582/149634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63057 ms. Remains : 1967/1969 places, 149582/149634 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p2:(AND (EQ s1684 0) (EQ s14 1)), p1:(OR (EQ s479 0) (EQ s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 54610 steps with 27305 reset in 10002 ms.
Product exploration timeout after 54690 steps with 27345 reset in 10002 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.292 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLCardinality-05 finished in 83984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1968 transition count 149586
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1968 transition count 149586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1967 transition count 149583
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1967 transition count 149582
Applied a total of 6 rules in 858 ms. Remains 1967 /1969 variables (removed 2) and now considering 149582/149634 (removed 52) transitions.
[2024-05-27 22:05:07] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:05:07] [INFO ] Invariant cache hit.
[2024-05-27 22:05:16] [INFO ] Implicit Places using invariants in 9424 ms returned []
Implicit Place search using SMT only with invariants took 9425 ms to find 0 implicit places.
[2024-05-27 22:05:16] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:05:16] [INFO ] Invariant cache hit.
[2024-05-27 22:05:46] [INFO ] Performed 79321/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:06:16] [INFO ] Dead Transitions using invariants and state equation in 60035 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1969 places, 149582/149634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70322 ms. Remains : 1967/1969 places, 149582/149634 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s189 0) (EQ s871 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][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 7972 ms.
Product exploration explored 100000 steps with 0 reset in 7199 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.283 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1727 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2688 steps, run timeout after 3001 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2688 steps, saw 2162 distinct states, run finished after 3001 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:06:38] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:06:38] [INFO ] Invariant cache hit.
[2024-05-27 22:06:38] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:06:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-27 22:07:03] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 9 ms
Free SCC test removed 72 places
Drop transitions removed 3835 transitions
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 4337 transitions.
Graph (complete) has 126251 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.60 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1894 transition count 145239
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1889 transition count 145239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1889 transition count 145236
Deduced a syphon composed of 3 places in 79 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1886 transition count 145236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1879 transition count 145229
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1879 transition count 145229
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1879 transition count 145222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1873 transition count 145210
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1873 transition count 145210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1873 transition count 145204
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1870 transition count 145198
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1870 transition count 145198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1870 transition count 145195
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 79 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 119 place count 1844 transition count 145169
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 126 place count 1844 transition count 145162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 79 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 182 place count 1816 transition count 145258
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 205 place count 1816 transition count 145235
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 230 place count 1816 transition count 145204
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 7 with 611 rules applied. Total rules applied 841 place count 1791 transition count 144618
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 844 place count 1791 transition count 144615
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 900 place count 1788 transition count 144562
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 903 place count 1788 transition count 144559
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 909 place count 1785 transition count 144556
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 910 place count 1785 transition count 144555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 911 place count 1784 transition count 144555
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 116 rules applied. Total rules applied 1027 place count 1784 transition count 172996
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 11 with 7890 rules applied. Total rules applied 8917 place count 1668 transition count 165222
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 8918 place count 1667 transition count 165221
Applied a total of 8918 rules in 11949 ms. Remains 1667 /1967 variables (removed 300) and now considering 165221/149582 (removed -15639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11953 ms. Remains : 1667/1967 places, 165221/149582 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1067 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4271 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4271 steps, saw 3543 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:07:19] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2024-05-27 22:07:20] [INFO ] Computed 10 invariants in 563 ms
[2024-05-27 22:07:20] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:07:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-27 22:07:45] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 745 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 745 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 760 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2024-05-27 22:07:47] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 22:07:47] [INFO ] Invariant cache hit.
[2024-05-27 22:07:56] [INFO ] Implicit Places using invariants in 9212 ms returned []
Implicit Place search using SMT only with invariants took 9213 ms to find 0 implicit places.
[2024-05-27 22:07:56] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2024-05-27 22:07:56] [INFO ] Invariant cache hit.
[2024-05-27 22:08:26] [INFO ] Performed 88296/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:08:51] [INFO ] Dead Transitions using invariants and state equation in 55066 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65059 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 7 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.98 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 59 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 60 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5333 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2024-05-27 22:08:57] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 22:08:57] [INFO ] Computed 10 invariants in 451 ms
[2024-05-27 22:09:06] [INFO ] Implicit Places using invariants in 9334 ms returned []
Implicit Place search using SMT only with invariants took 9335 ms to find 0 implicit places.
[2024-05-27 22:09:06] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 22:09:06] [INFO ] Invariant cache hit.
[2024-05-27 22:09:36] [INFO ] Performed 81192/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:10:00] [INFO ] Dead Transitions using invariants and state equation in 54617 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69294 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 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 106 ms :[true, (NOT p0)]
Finished random walk after 589 steps, including 2 resets, run visited all 1 properties in 59 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLCardinality-06 finished in 296138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(((!p1 U (p2||G(!p1)))&&p0)))&&F(p3)))'
Support contains 5 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1666 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.85 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149041
Deduced a syphon composed of 3 places in 58 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149041
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1883 transition count 148981
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1883 transition count 148981
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 1883 transition count 148974
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 1876 transition count 148960
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 1876 transition count 148960
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 54 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 63 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 97 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 58 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 154 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 173 place count 1828 transition count 149003
Applied a total of 173 rules in 4845 ms. Remains 1828 /1969 variables (removed 141) and now considering 149003/149634 (removed 631) transitions.
[2024-05-27 22:10:07] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2024-05-27 22:10:07] [INFO ] Computed 10 invariants in 463 ms
[2024-05-27 22:10:16] [INFO ] Implicit Places using invariants in 9188 ms returned []
Implicit Place search using SMT only with invariants took 9192 ms to find 0 implicit places.
[2024-05-27 22:10:16] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2024-05-27 22:10:16] [INFO ] Invariant cache hit.
[2024-05-27 22:10:46] [INFO ] Performed 85773/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:11:08] [INFO ] Dead Transitions using invariants and state equation in 51847 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1969 places, 149003/149634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65891 ms. Remains : 1828/1969 places, 149003/149634 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p3) (NOT p0) (AND p1 (NOT p2))), (NOT p3), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s1007 0), p0:(AND (EQ s1772 0) (EQ s587 1)), p2:(AND (NOT (OR (EQ s506 0) (EQ s1747 1))) (NOT (OR (EQ s587 0) (EQ s1772 1)))), p1:(OR (EQ s587 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 13 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-07 finished in 66395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1969 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1673 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.86 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149041
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149041
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1884 transition count 149029
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1884 transition count 149029
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1884 transition count 149023
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1878 transition count 149011
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1878 transition count 149011
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1878 transition count 149005
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1875 transition count 148999
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1875 transition count 148999
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1875 transition count 148996
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 58 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1858 transition count 148979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1858 transition count 148978
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 57 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1830 transition count 149074
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1830 transition count 149055
Applied a total of 167 rules in 4944 ms. Remains 1830 /1969 variables (removed 139) and now considering 149055/149634 (removed 579) transitions.
[2024-05-27 22:11:13] [INFO ] Flow matrix only has 104709 transitions (discarded 44346 similar events)
// Phase 1: matrix 104709 rows 1830 cols
[2024-05-27 22:11:14] [INFO ] Computed 10 invariants in 370 ms
[2024-05-27 22:11:22] [INFO ] Implicit Places using invariants in 8809 ms returned []
Implicit Place search using SMT only with invariants took 8814 ms to find 0 implicit places.
[2024-05-27 22:11:22] [INFO ] Flow matrix only has 104709 transitions (discarded 44346 similar events)
[2024-05-27 22:11:22] [INFO ] Invariant cache hit.
[2024-05-27 22:11:52] [INFO ] Performed 89007/149055 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:12:14] [INFO ] Dead Transitions using invariants and state equation in 51402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1830/1969 places, 149055/149634 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65164 ms. Remains : 1830/1969 places, 149055/149634 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-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:(AND (EQ s1656 0) (EQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 11 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-08 finished in 65468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1968 transition count 149586
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1968 transition count 149586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1967 transition count 149583
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1967 transition count 149582
Applied a total of 6 rules in 986 ms. Remains 1967 /1969 variables (removed 2) and now considering 149582/149634 (removed 52) transitions.
[2024-05-27 22:12:15] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:12:15] [INFO ] Computed 10 invariants in 414 ms
[2024-05-27 22:12:24] [INFO ] Implicit Places using invariants in 8951 ms returned []
Implicit Place search using SMT only with invariants took 8952 ms to find 0 implicit places.
[2024-05-27 22:12:24] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:12:24] [INFO ] Invariant cache hit.
[2024-05-27 22:12:54] [INFO ] Performed 89133/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:13:14] [INFO ] Dead Transitions using invariants and state equation in 50482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1969 places, 149582/149634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60425 ms. Remains : 1967/1969 places, 149582/149634 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-12 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1297 0) (EQ s1612 1) (EQ s129 0) (EQ s34 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3504 ms.
Product exploration explored 100000 steps with 3 reset in 6938 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.284 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5008 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5008 steps, saw 3845 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:13:30] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:13:30] [INFO ] Invariant cache hit.
[2024-05-27 22:13:30] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:13:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-27 22:13:55] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions removed 3835 transitions
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 4337 transitions.
Graph (complete) has 126251 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1894 transition count 145239
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1889 transition count 145239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1889 transition count 145236
Deduced a syphon composed of 3 places in 64 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1886 transition count 145236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1879 transition count 145229
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1879 transition count 145229
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1879 transition count 145222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1873 transition count 145210
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1873 transition count 145210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1873 transition count 145204
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1870 transition count 145198
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1870 transition count 145198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1870 transition count 145195
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 64 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 119 place count 1844 transition count 145169
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 126 place count 1844 transition count 145162
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 27 places in 64 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 180 place count 1817 transition count 145258
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 203 place count 1817 transition count 145235
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 228 place count 1817 transition count 145204
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 7 with 611 rules applied. Total rules applied 839 place count 1792 transition count 144618
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1792 transition count 144615
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1789 transition count 144562
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1789 transition count 144559
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1786 transition count 144556
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1786 transition count 144555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1785 transition count 144555
Free-agglomeration rule (complex) applied 115 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 115 rules applied. Total rules applied 1024 place count 1785 transition count 172452
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 134 transitions
Ensure Unique test removed 7464 transitions
Reduce isomorphic transitions removed 7598 transitions.
Iterating post reduction 11 with 7713 rules applied. Total rules applied 8737 place count 1670 transition count 164854
Applied a total of 8737 rules in 9906 ms. Remains 1670 /1967 variables (removed 297) and now considering 164854/149582 (removed -15272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9911 ms. Remains : 1670/1967 places, 164854/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4394 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4394 steps, saw 3644 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:14:10] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
// Phase 1: matrix 121935 rows 1670 cols
[2024-05-27 22:14:10] [INFO ] Computed 10 invariants in 560 ms
[2024-05-27 22:14:10] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:14:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-27 22:14:35] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1670/1670 places, 164854/164854 transitions.
Applied a total of 0 rules in 736 ms. Remains 1670 /1670 variables (removed 0) and now considering 164854/164854 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 736 ms. Remains : 1670/1670 places, 164854/164854 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1670/1670 places, 164854/164854 transitions.
Applied a total of 0 rules in 730 ms. Remains 1670 /1670 variables (removed 0) and now considering 164854/164854 (removed 0) transitions.
[2024-05-27 22:14:37] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
[2024-05-27 22:14:37] [INFO ] Invariant cache hit.
[2024-05-27 22:14:46] [INFO ] Implicit Places using invariants in 9205 ms returned []
Implicit Place search using SMT only with invariants took 9205 ms to find 0 implicit places.
[2024-05-27 22:14:46] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
[2024-05-27 22:14:46] [INFO ] Invariant cache hit.
[2024-05-27 22:15:16] [INFO ] Performed 90841/164854 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:15:40] [INFO ] Dead Transitions using invariants and state equation in 53940 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63889 ms. Remains : 1670/1670 places, 164854/164854 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 229 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2024-05-27 22:15:41] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:15:41] [INFO ] Computed 10 invariants in 426 ms
[2024-05-27 22:15:50] [INFO ] Implicit Places using invariants in 9074 ms returned []
Implicit Place search using SMT only with invariants took 9076 ms to find 0 implicit places.
[2024-05-27 22:15:50] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:15:50] [INFO ] Invariant cache hit.
[2024-05-27 22:16:20] [INFO ] Performed 88660/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:16:41] [INFO ] Dead Transitions using invariants and state equation in 50745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60055 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.268 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5388 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5388 steps, saw 4113 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:16:46] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:16:46] [INFO ] Invariant cache hit.
[2024-05-27 22:16:46] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:16:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-27 22:17: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 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 9 ms
Free SCC test removed 72 places
Drop transitions removed 3835 transitions
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 4337 transitions.
Graph (complete) has 126251 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.57 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1894 transition count 145239
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1889 transition count 145239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1889 transition count 145236
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1886 transition count 145236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1879 transition count 145229
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1879 transition count 145229
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1879 transition count 145222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1873 transition count 145210
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1873 transition count 145210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1873 transition count 145204
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1870 transition count 145198
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1870 transition count 145198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1870 transition count 145195
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 65 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 119 place count 1844 transition count 145169
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 126 place count 1844 transition count 145162
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 27 places in 65 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 180 place count 1817 transition count 145258
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 203 place count 1817 transition count 145235
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 228 place count 1817 transition count 145204
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 7 with 611 rules applied. Total rules applied 839 place count 1792 transition count 144618
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1792 transition count 144615
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1789 transition count 144562
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1789 transition count 144559
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1786 transition count 144556
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1786 transition count 144555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1785 transition count 144555
Free-agglomeration rule (complex) applied 115 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 115 rules applied. Total rules applied 1024 place count 1785 transition count 172452
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 134 transitions
Ensure Unique test removed 7464 transitions
Reduce isomorphic transitions removed 7598 transitions.
Iterating post reduction 11 with 7713 rules applied. Total rules applied 8737 place count 1670 transition count 164854
Applied a total of 8737 rules in 10744 ms. Remains 1670 /1967 variables (removed 297) and now considering 164854/149582 (removed -15272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10748 ms. Remains : 1670/1967 places, 164854/149582 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1246 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4777 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4777 steps, saw 3964 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:17:26] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
// Phase 1: matrix 121935 rows 1670 cols
[2024-05-27 22:17:27] [INFO ] Computed 10 invariants in 659 ms
[2024-05-27 22:17:27] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:17:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-27 22:17:52] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1670/1670 places, 164854/164854 transitions.
Applied a total of 0 rules in 821 ms. Remains 1670 /1670 variables (removed 0) and now considering 164854/164854 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 821 ms. Remains : 1670/1670 places, 164854/164854 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1670/1670 places, 164854/164854 transitions.
Applied a total of 0 rules in 946 ms. Remains 1670 /1670 variables (removed 0) and now considering 164854/164854 (removed 0) transitions.
[2024-05-27 22:17:54] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
[2024-05-27 22:17:54] [INFO ] Invariant cache hit.
[2024-05-27 22:18:03] [INFO ] Implicit Places using invariants in 9139 ms returned []
Implicit Place search using SMT only with invariants took 9140 ms to find 0 implicit places.
[2024-05-27 22:18:03] [INFO ] Flow matrix only has 121935 transitions (discarded 42919 similar events)
[2024-05-27 22:18:03] [INFO ] Invariant cache hit.
[2024-05-27 22:18:33] [INFO ] Performed 88901/164854 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 55132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65231 ms. Remains : 1670/1670 places, 164854/164854 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 7101 ms.
Product exploration explored 100000 steps with 0 reset in 7605 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.82 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1894 transition count 148995
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 1888 transition count 148983
Deduced a syphon composed of 2 places in 63 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 1888 transition count 148983
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 1888 transition count 148977
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 1882 transition count 148965
Deduced a syphon composed of 2 places in 64 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 1882 transition count 148965
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 1882 transition count 148959
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 1879 transition count 148953
Deduced a syphon composed of 2 places in 61 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 1879 transition count 148953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 1879 transition count 148950
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 22 places in 62 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 69 place count 1879 transition count 148959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 1879 transition count 148958
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -158
Deduced a syphon composed of 49 places in 63 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 97 place count 1879 transition count 149116
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 116 place count 1879 transition count 149097
Deduced a syphon composed of 49 places in 64 ms
Applied a total of 116 rules in 3960 ms. Remains 1879 /1967 variables (removed 88) and now considering 149097/149582 (removed 485) transitions.
[2024-05-27 22:19:18] [INFO ] Flow matrix only has 104798 transitions (discarded 44299 similar events)
// Phase 1: matrix 104798 rows 1879 cols
[2024-05-27 22:19:18] [INFO ] Computed 10 invariants in 382 ms
[2024-05-27 22:19:48] [INFO ] Performed 88756/149097 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:20:09] [INFO ] Dead Transitions using invariants and state equation in 51299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1879/1967 places, 149097/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55262 ms. Remains : 1879/1967 places, 149097/149582 transitions.
Built C files in :
/tmp/ltsmin12364885789368548457
[2024-05-27 22:20:10] [INFO ] Built C files in 820ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12364885789368548457
Running compilation step : cd /tmp/ltsmin12364885789368548457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12364885789368548457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12364885789368548457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 219 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2024-05-27 22:20:13] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:20:14] [INFO ] Computed 10 invariants in 393 ms
[2024-05-27 22:20:22] [INFO ] Implicit Places using invariants in 9134 ms returned []
Implicit Place search using SMT only with invariants took 9134 ms to find 0 implicit places.
[2024-05-27 22:20:23] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:20:23] [INFO ] Invariant cache hit.
[2024-05-27 22:20:53] [INFO ] Performed 89434/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:21:13] [INFO ] Dead Transitions using invariants and state equation in 50588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59949 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Built C files in :
/tmp/ltsmin5592001499362559187
[2024-05-27 22:21:14] [INFO ] Built C files in 793ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5592001499362559187
Running compilation step : cd /tmp/ltsmin5592001499362559187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5592001499362559187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5592001499362559187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 22:21:23] [INFO ] Flatten gal took : 3907 ms
[2024-05-27 22:21:26] [INFO ] Flatten gal took : 3345 ms
[2024-05-27 22:21:27] [INFO ] Time to serialize gal into /tmp/LTL18366577702259395165.gal : 479 ms
[2024-05-27 22:21:27] [INFO ] Time to serialize properties into /tmp/LTL8239713140902041264.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18366577702259395165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16250267930935226277.hoa' '-atoms' '/tmp/LTL8239713140902041264.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-05-27 22:21:49] [INFO ] Flatten gal took : 3419 ms
[2024-05-27 22:21:52] [INFO ] Flatten gal took : 3143 ms
[2024-05-27 22:21:52] [INFO ] Time to serialize gal into /tmp/LTL2947341968947368624.gal : 617 ms
[2024-05-27 22:21:52] [INFO ] Time to serialize properties into /tmp/LTL17809175554410365568.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2947341968947368624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17809175554410365568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-27 22:22:11] [INFO ] Flatten gal took : 3444 ms
[2024-05-27 22:22:11] [INFO ] Applying decomposition
[2024-05-27 22:22:15] [INFO ] Flatten gal took : 3195 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15369734976697257980.txt' '-o' '/tmp/graph15369734976697257980.bin' '-w' '/tmp/graph15369734976697257980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15369734976697257980.bin' '-l' '-1' '-v' '-w' '/tmp/graph15369734976697257980.weights' '-q' '0' '-e' '0.001'
[2024-05-27 22:22:22] [INFO ] Decomposing Gal with order
[2024-05-27 22:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 22:22:34] [INFO ] Removed a total of 327706 redundant transitions.
[2024-05-27 22:22:35] [INFO ] Flatten gal took : 8883 ms
[2024-05-27 22:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 5810 labels/synchronizations in 7228 ms.
[2024-05-27 22:22:48] [INFO ] Time to serialize gal into /tmp/LTL3026107914822904318.gal : 189 ms
[2024-05-27 22:22:48] [INFO ] Time to serialize properties into /tmp/LTL5856839270076283088.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3026107914822904318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5856839270076283088.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5870765748747752924
[2024-05-27 22:23:04] [INFO ] Built C files in 855ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5870765748747752924
Running compilation step : cd /tmp/ltsmin5870765748747752924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5870765748747752924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5870765748747752924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLCardinality-12 finished in 653015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1)&&X(G((X((p0 U p3))||p2)))))))'
Support contains 8 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1968 transition count 149586
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1968 transition count 149586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1967 transition count 149583
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 1967 transition count 149582
Applied a total of 6 rules in 855 ms. Remains 1967 /1969 variables (removed 2) and now considering 149582/149634 (removed 52) transitions.
[2024-05-27 22:23:08] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:23:08] [INFO ] Invariant cache hit.
[2024-05-27 22:23:16] [INFO ] Implicit Places using invariants in 8393 ms returned []
Implicit Place search using SMT only with invariants took 8395 ms to find 0 implicit places.
[2024-05-27 22:23:16] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:23:16] [INFO ] Invariant cache hit.
[2024-05-27 22:23:46] [INFO ] Performed 87461/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:24:07] [INFO ] Dead Transitions using invariants and state equation in 51273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1969 places, 149582/149634 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60527 ms. Remains : 1967/1969 places, 149582/149634 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=8 dest: 10}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 1} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=10 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1} source=11 dest: 10}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=11 dest: 11}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p1:(OR (EQ s1776 0) (EQ s797 1)), p0:(OR (EQ s1535 0) (EQ s1009 1)), p2:(OR (EQ s1731 0) (EQ s338 1) (EQ s457 0) (EQ s296 1)), p3:(AND (OR (EQ s1535 0) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7637 ms.
Product exploration explored 100000 steps with 0 reset in 8134 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.292 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 167 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1189 ms. (steps per millisecond=8 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 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 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 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 118 ms. (steps per millisecond=8 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-27 22:24:27] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:24:27] [INFO ] Invariant cache hit.
[2024-05-27 22:24:28] [INFO ] After 837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-27 22:24:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 22:24:53] [INFO ] After 23715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-27 22:24:54] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 22:24:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 22:24:54] [INFO ] After 25812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 7 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4316 transitions.
Graph (complete) has 126269 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.57 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145260
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145257
Deduced a syphon composed of 3 places in 63 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145248
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1881 transition count 145241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1875 transition count 145229
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1875 transition count 145229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1875 transition count 145223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1872 transition count 145217
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1872 transition count 145217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1872 transition count 145214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 62 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 117 place count 1847 transition count 145189
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 123 place count 1847 transition count 145183
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 63 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 179 place count 1819 transition count 145279
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 202 place count 1819 transition count 145256
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 227 place count 1819 transition count 145225
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 839 place count 1794 transition count 144638
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1794 transition count 144635
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1791 transition count 144582
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1791 transition count 144579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1788 transition count 144576
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1788 transition count 144575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1787 transition count 144575
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 117 rules applied. Total rules applied 1026 place count 1787 transition count 173023
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 11 with 7893 rules applied. Total rules applied 8919 place count 1670 transition count 165247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 8920 place count 1669 transition count 165246
Applied a total of 8920 rules in 10667 ms. Remains 1669 /1967 variables (removed 298) and now considering 165246/149582 (removed -15664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10671 ms. Remains : 1669/1967 places, 165246/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1613 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 8009 steps, run timeout after 6006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8009 steps, saw 6560 distinct states, run finished after 6006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-27 22:25:13] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2024-05-27 22:25:13] [INFO ] Computed 10 invariants in 571 ms
[2024-05-27 22:25:14] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-27 22:25:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-27 22:25:39] [INFO ] After 23797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-27 22:25:40] [INFO ] State equation strengthened by 6071 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 22:25:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 22:25:40] [INFO ] After 25986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 738 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 738 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 737 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2024-05-27 22:25:42] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2024-05-27 22:25:42] [INFO ] Invariant cache hit.
[2024-05-27 22:25:51] [INFO ] Implicit Places using invariants in 9419 ms returned []
Implicit Place search using SMT only with invariants took 9421 ms to find 0 implicit places.
[2024-05-27 22:25:51] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2024-05-27 22:25:51] [INFO ] Invariant cache hit.
[2024-05-27 22:26:21] [INFO ] Performed 89926/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:26:45] [INFO ] Dead Transitions using invariants and state equation in 53935 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64106 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 254 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 212 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2024-05-27 22:26:47] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:26:47] [INFO ] Computed 10 invariants in 381 ms
[2024-05-27 22:26:55] [INFO ] Implicit Places using invariants in 8841 ms returned []
Implicit Place search using SMT only with invariants took 8845 ms to find 0 implicit places.
[2024-05-27 22:26:55] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:26:55] [INFO ] Invariant cache hit.
[2024-05-27 22:27:26] [INFO ] Performed 86307/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:27:48] [INFO ] Dead Transitions using invariants and state equation in 52686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61746 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.286 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 144 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1316 ms. (steps per millisecond=7 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 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 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 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 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-27 22:27:51] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:27:51] [INFO ] Invariant cache hit.
[2024-05-27 22:27:52] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-27 22:27:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 22:28:17] [INFO ] After 23738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-27 22:28:18] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 22:28:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 22:28:18] [INFO ] After 25807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 6 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4316 transitions.
Graph (complete) has 126269 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145260
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145257
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145248
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1881 transition count 145241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1875 transition count 145229
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1875 transition count 145229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1875 transition count 145223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1872 transition count 145217
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1872 transition count 145217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1872 transition count 145214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 64 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 117 place count 1847 transition count 145189
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 123 place count 1847 transition count 145183
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 64 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 179 place count 1819 transition count 145279
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 202 place count 1819 transition count 145256
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 227 place count 1819 transition count 145225
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 839 place count 1794 transition count 144638
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1794 transition count 144635
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1791 transition count 144582
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1791 transition count 144579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1788 transition count 144576
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1788 transition count 144575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1787 transition count 144575
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 117 rules applied. Total rules applied 1026 place count 1787 transition count 173023
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 11 with 7893 rules applied. Total rules applied 8919 place count 1670 transition count 165247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 8920 place count 1669 transition count 165246
Applied a total of 8920 rules in 10903 ms. Remains 1669 /1967 variables (removed 298) and now considering 165246/149582 (removed -15664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10906 ms. Remains : 1669/1967 places, 165246/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1524 ms. (steps per millisecond=6 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 4754 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4754 steps, saw 3947 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-27 22:28:34] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2024-05-27 22:28:35] [INFO ] Computed 10 invariants in 596 ms
[2024-05-27 22:28:35] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-27 22:28:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-27 22:29:00] [INFO ] After 23846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 22:29:01] [INFO ] State equation strengthened by 6071 read => feed constraints.
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.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 22:29:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 22:29:01] [INFO ] After 25960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 622 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 860 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2024-05-27 22:29:03] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2024-05-27 22:29:03] [INFO ] Invariant cache hit.
[2024-05-27 22:29:12] [INFO ] Implicit Places using invariants in 9127 ms returned []
Implicit Place search using SMT only with invariants took 9128 ms to find 0 implicit places.
[2024-05-27 22:29:12] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2024-05-27 22:29:12] [INFO ] Invariant cache hit.
[2024-05-27 22:29:42] [INFO ] Performed 88587/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:30:06] [INFO ] Dead Transitions using invariants and state equation in 54152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64153 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 215 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 582 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 534 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 7623 ms.
Product exploration explored 100000 steps with 0 reset in 7015 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 4 ms
Free SCC test removed 70 places
Ensure Unique test removed 566 transitions
Reduce isomorphic transitions removed 566 transitions.
Graph (complete) has 143632 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.82 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1896 transition count 149015
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 1890 transition count 149001
Deduced a syphon composed of 2 places in 64 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 1890 transition count 149001
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 1890 transition count 148995
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 1884 transition count 148983
Deduced a syphon composed of 2 places in 64 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 1884 transition count 148983
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 1884 transition count 148977
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 1881 transition count 148971
Deduced a syphon composed of 2 places in 65 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 1881 transition count 148971
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 1881 transition count 148968
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 22 places in 68 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 69 place count 1881 transition count 148977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 1881 transition count 148976
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 50 places in 67 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 98 place count 1881 transition count 149136
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 117 place count 1881 transition count 149117
Deduced a syphon composed of 50 places in 66 ms
Applied a total of 117 rules in 3975 ms. Remains 1881 /1967 variables (removed 86) and now considering 149117/149582 (removed 465) transitions.
[2024-05-27 22:30:27] [INFO ] Flow matrix only has 104819 transitions (discarded 44298 similar events)
// Phase 1: matrix 104819 rows 1881 cols
[2024-05-27 22:30:28] [INFO ] Computed 10 invariants in 457 ms
[2024-05-27 22:30:58] [INFO ] Performed 89612/149117 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:31:18] [INFO ] Dead Transitions using invariants and state equation in 50494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1881/1967 places, 149117/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54474 ms. Remains : 1881/1967 places, 149117/149582 transitions.
Built C files in :
/tmp/ltsmin12769535161032789791
[2024-05-27 22:31:19] [INFO ] Built C files in 843ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12769535161032789791
Running compilation step : cd /tmp/ltsmin12769535161032789791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12769535161032789791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12769535161032789791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 218 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2024-05-27 22:31:22] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2024-05-27 22:31:23] [INFO ] Computed 10 invariants in 407 ms
[2024-05-27 22:31:31] [INFO ] Implicit Places using invariants in 9017 ms returned []
Implicit Place search using SMT only with invariants took 9018 ms to find 0 implicit places.
[2024-05-27 22:31:31] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2024-05-27 22:31:31] [INFO ] Invariant cache hit.
[2024-05-27 22:32:01] [INFO ] Performed 88695/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:32:22] [INFO ] Dead Transitions using invariants and state equation in 51056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60296 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Built C files in :
/tmp/ltsmin1608586083582028319
[2024-05-27 22:32:23] [INFO ] Built C files in 827ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1608586083582028319
Running compilation step : cd /tmp/ltsmin1608586083582028319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1608586083582028319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1608586083582028319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 22:32:32] [INFO ] Flatten gal took : 3442 ms
[2024-05-27 22:32:35] [INFO ] Flatten gal took : 3588 ms
[2024-05-27 22:32:36] [INFO ] Time to serialize gal into /tmp/LTL13803074479156710447.gal : 542 ms
[2024-05-27 22:32:36] [INFO ] Time to serialize properties into /tmp/LTL5467218768390112181.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13803074479156710447.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12429267456548540333.hoa' '-atoms' '/tmp/LTL5467218768390112181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2024-05-27 22:33:00] [INFO ] Flatten gal took : 3382 ms
[2024-05-27 22:33:04] [INFO ] Flatten gal took : 3531 ms
[2024-05-27 22:33:04] [INFO ] Time to serialize gal into /tmp/LTL7370413242291035320.gal : 540 ms
[2024-05-27 22:33:04] [INFO ] Time to serialize properties into /tmp/LTL7461368717946562520.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7370413242291035320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7461368717946562520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-05-27 22:33:32] [INFO ] Flatten gal took : 3494 ms
[2024-05-27 22:33:32] [INFO ] Applying decomposition
[2024-05-27 22:33:35] [INFO ] Flatten gal took : 3637 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18026763556760924678.txt' '-o' '/tmp/graph18026763556760924678.bin' '-w' '/tmp/graph18026763556760924678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18026763556760924678.bin' '-l' '-1' '-v' '-w' '/tmp/graph18026763556760924678.weights' '-q' '0' '-e' '0.001'
[2024-05-27 22:33:43] [INFO ] Decomposing Gal with order
[2024-05-27 22:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 22:33:56] [INFO ] Removed a total of 330042 redundant transitions.
[2024-05-27 22:33:57] [INFO ] Flatten gal took : 8949 ms
[2024-05-27 22:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 5659 labels/synchronizations in 7425 ms.
[2024-05-27 22:34:10] [INFO ] Time to serialize gal into /tmp/LTL10177911106356275126.gal : 187 ms
[2024-05-27 22:34:10] [INFO ] Time to serialize properties into /tmp/LTL830891875445366152.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10177911106356275126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL830891875445366152.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5171845001407904882
[2024-05-27 22:34:26] [INFO ] Built C files in 903ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5171845001407904882
Running compilation step : cd /tmp/ltsmin5171845001407904882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5171845001407904882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5171845001407904882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLCardinality-13 finished in 681823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : RERS2020-PT-pb105-LTLCardinality-12
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 1969 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1969/1969 places, 149634/149634 transitions.
Graph (trivial) has 1671 edges and 1969 vertex of which 115 / 1969 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143702 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.98 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1896 transition count 149045
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1894 transition count 149045
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1894 transition count 149042
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1891 transition count 149042
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1884 transition count 148982
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1884 transition count 148982
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 1884 transition count 148975
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 40 place count 1877 transition count 148961
Iterating global reduction 3 with 7 rules applied. Total rules applied 47 place count 1877 transition count 148961
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 54 place count 1877 transition count 148954
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 1874 transition count 148948
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1874 transition count 148948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 63 place count 1874 transition count 148945
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 68 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 97 place count 1857 transition count 148928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 1857 transition count 148927
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 27 places in 68 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 152 place count 1830 transition count 149023
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 171 place count 1830 transition count 149004
Applied a total of 171 rules in 5607 ms. Remains 1830 /1969 variables (removed 139) and now considering 149004/149634 (removed 630) transitions.
[2024-05-27 22:34:35] [INFO ] Flow matrix only has 104705 transitions (discarded 44299 similar events)
// Phase 1: matrix 104705 rows 1830 cols
[2024-05-27 22:34:35] [INFO ] Computed 10 invariants in 544 ms
[2024-05-27 22:34:44] [INFO ] Implicit Places using invariants in 9489 ms returned []
Implicit Place search using SMT only with invariants took 9491 ms to find 0 implicit places.
[2024-05-27 22:34:44] [INFO ] Flow matrix only has 104705 transitions (discarded 44299 similar events)
[2024-05-27 22:34:44] [INFO ] Invariant cache hit.
[2024-05-27 22:35:15] [INFO ] Performed 84470/149004 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 22:35:43] [INFO ] Dead Transitions using invariants and state equation in 58473 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1830/1969 places, 149004/149634 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 73579 ms. Remains : 1830/1969 places, 149004/149634 transitions.
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-12 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1202 0) (EQ s1494 1) (EQ s117 0) (EQ s30 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 74390 steps with 0 reset in 10001 ms.
Product exploration timeout after 99600 steps with 0 reset in 10001 ms.
Computed a total of 221 stabilizing places and 33712 stable transitions
Computed a total of 221 stabilizing places and 33712 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 962 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4174 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4174 steps, saw 3180 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 22:36:10] [INFO ] Flow matrix only has 104705 transitions (discarded 44299 similar events)
[2024-05-27 22:36:10] [INFO ] Invariant cache hit.
[2024-05-27 22:36:10] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 22:36:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-27 22:36:35] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1830/1830 places, 149004/149004 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1830 transition count 145250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1827 transition count 145250
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 79 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1817 transition count 145240
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1817 transition count 145235
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1817 transition count 145204
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1792 transition count 144618
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1792 transition count 144615
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1789 transition count 144562
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1789 transition count 144559
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1786 transition count 144556
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1786 transition count 144555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1785 transition count 144555
Free-agglomeration rule (complex) applied 115 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 115 rules applied. Total rules applied 4603 place count 1785 transition count 172452
Reduce places removed 115 places and 0 transitions.
Drop transitions removed 134 transitions
Ensure Unique test removed 7464 transitions
Reduce isomorphic transitions removed 7598 transitions.
Iterating post reduction 7 with 7713 rules applied. Total rules applied 12316 place count 1670 transition count 164854
Applied a total of 12316 rules in 9833 ms. Remains 1670 /1830 variables (removed 160) and now considering 164854/149004 (removed -15850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9843 ms. Remains : 1670/1830 places, 164854/149004 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1292 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12758092 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16186284 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb105"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is RERS2020-PT-pb105, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361800227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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