Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679085258734

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 20:34:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 20:34:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 20:34:22] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2023-03-17 20:34:22] [INFO ] Transformed 1992 places.
[2023-03-17 20:34:22] [INFO ] Transformed 3096 transitions.
[2023-03-17 20:34:22] [INFO ] Found NUPN structural information;
[2023-03-17 20:34:22] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-17 20:34:22] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1155 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 148 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:34:23] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:34:23] [INFO ] Computed 31 place invariants in 56 ms
[2023-03-17 20:34:24] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2023-03-17 20:34:24] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:34:24] [INFO ] Invariant cache hit.
[2023-03-17 20:34:25] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
[2023-03-17 20:34:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:34:25] [INFO ] Invariant cache hit.
[2023-03-17 20:34:28] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5458 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1155 out of 1992 places after structural reductions.
[2023-03-17 20:34:29] [INFO ] Flatten gal took : 290 ms
[2023-03-17 20:34:29] [INFO ] Flatten gal took : 199 ms
[2023-03-17 20:34:29] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=11 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 20:34:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:34:31] [INFO ] Invariant cache hit.
[2023-03-17 20:34:32] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2023-03-17 20:34:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:34:35] [INFO ] After 4352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-17 20:34:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2023-03-17 20:34:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:34:39] [INFO ] After 2755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-17 20:34:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:34:42] [INFO ] After 2045ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-17 20:34:44] [INFO ] Deduced a trap composed of 54 places in 2110 ms of which 9 ms to minimize.
[2023-03-17 20:34:46] [INFO ] Deduced a trap composed of 25 places in 1934 ms of which 4 ms to minimize.
[2023-03-17 20:34:48] [INFO ] Deduced a trap composed of 13 places in 2212 ms of which 4 ms to minimize.
[2023-03-17 20:34:51] [INFO ] Deduced a trap composed of 20 places in 1978 ms of which 3 ms to minimize.
[2023-03-17 20:34:53] [INFO ] Deduced a trap composed of 24 places in 2181 ms of which 4 ms to minimize.
[2023-03-17 20:34:55] [INFO ] Deduced a trap composed of 93 places in 2104 ms of which 2 ms to minimize.
[2023-03-17 20:34:57] [INFO ] Deduced a trap composed of 59 places in 1812 ms of which 2 ms to minimize.
[2023-03-17 20:34:59] [INFO ] Deduced a trap composed of 13 places in 2048 ms of which 2 ms to minimize.
[2023-03-17 20:35:01] [INFO ] Deduced a trap composed of 86 places in 1902 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:35:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:35:01] [INFO ] After 26212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 12 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 884 transitions
Trivial Post-agglo rules discarded 884 transitions
Performed 884 trivial Post agglomeration. Transition count delta: 884
Iterating post reduction 0 with 884 rules applied. Total rules applied 884 place count 1992 transition count 2212
Reduce places removed 884 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 888 rules applied. Total rules applied 1772 place count 1108 transition count 2208
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Performed 444 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 444 Pre rules applied. Total rules applied 1776 place count 1104 transition count 1764
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 3 with 888 rules applied. Total rules applied 2664 place count 660 transition count 1764
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 5 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 2772 place count 606 transition count 1710
Applied a total of 2772 rules in 581 ms. Remains 606 /1992 variables (removed 1386) and now considering 1710/3096 (removed 1386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 606/1992 places, 1710/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 20:35:03] [INFO ] Flow matrix only has 1374 transitions (discarded 336 similar events)
// Phase 1: matrix 1374 rows 606 cols
[2023-03-17 20:35:03] [INFO ] Computed 31 place invariants in 27 ms
[2023-03-17 20:35:03] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-17 20:35:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:35:04] [INFO ] After 834ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-17 20:35:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:35:04] [INFO ] After 575ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 20:35:04] [INFO ] After 1858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 20:35:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-17 20:35:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:35:06] [INFO ] After 1013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 20:35:06] [INFO ] After 573ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 20:35:07] [INFO ] Deduced a trap composed of 45 places in 675 ms of which 2 ms to minimize.
[2023-03-17 20:35:08] [INFO ] Deduced a trap composed of 34 places in 606 ms of which 2 ms to minimize.
[2023-03-17 20:35:09] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 1 ms to minimize.
[2023-03-17 20:35:09] [INFO ] Deduced a trap composed of 13 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:35:10] [INFO ] Deduced a trap composed of 13 places in 643 ms of which 1 ms to minimize.
[2023-03-17 20:35:11] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 1 ms to minimize.
[2023-03-17 20:35:11] [INFO ] Deduced a trap composed of 13 places in 563 ms of which 1 ms to minimize.
[2023-03-17 20:35:12] [INFO ] Deduced a trap composed of 13 places in 693 ms of which 2 ms to minimize.
[2023-03-17 20:35:13] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2023-03-17 20:35:13] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 0 ms to minimize.
[2023-03-17 20:35:14] [INFO ] Deduced a trap composed of 33 places in 574 ms of which 1 ms to minimize.
[2023-03-17 20:35:14] [INFO ] Deduced a trap composed of 41 places in 446 ms of which 1 ms to minimize.
[2023-03-17 20:35:15] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 2 ms to minimize.
[2023-03-17 20:35:16] [INFO ] Deduced a trap composed of 65 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:35:16] [INFO ] Deduced a trap composed of 56 places in 430 ms of which 1 ms to minimize.
[2023-03-17 20:35:17] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 1 ms to minimize.
[2023-03-17 20:35:17] [INFO ] Deduced a trap composed of 12 places in 529 ms of which 1 ms to minimize.
[2023-03-17 20:35:18] [INFO ] Deduced a trap composed of 33 places in 371 ms of which 1 ms to minimize.
[2023-03-17 20:35:18] [INFO ] Deduced a trap composed of 43 places in 394 ms of which 1 ms to minimize.
[2023-03-17 20:35:18] [INFO ] Deduced a trap composed of 16 places in 380 ms of which 0 ms to minimize.
[2023-03-17 20:35:19] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 1 ms to minimize.
[2023-03-17 20:35:19] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 1 ms to minimize.
[2023-03-17 20:35:20] [INFO ] Deduced a trap composed of 33 places in 434 ms of which 1 ms to minimize.
[2023-03-17 20:35:20] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 1 ms to minimize.
[2023-03-17 20:35:21] [INFO ] Deduced a trap composed of 33 places in 486 ms of which 2 ms to minimize.
[2023-03-17 20:35:22] [INFO ] Deduced a trap composed of 42 places in 534 ms of which 1 ms to minimize.
[2023-03-17 20:35:22] [INFO ] Deduced a trap composed of 53 places in 484 ms of which 2 ms to minimize.
[2023-03-17 20:35:23] [INFO ] Deduced a trap composed of 33 places in 470 ms of which 1 ms to minimize.
[2023-03-17 20:35:23] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 1 ms to minimize.
[2023-03-17 20:35:24] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 17355 ms
[2023-03-17 20:35:25] [INFO ] Deduced a trap composed of 20 places in 545 ms of which 1 ms to minimize.
[2023-03-17 20:35:25] [INFO ] Deduced a trap composed of 22 places in 537 ms of which 1 ms to minimize.
[2023-03-17 20:35:26] [INFO ] Deduced a trap composed of 45 places in 545 ms of which 1 ms to minimize.
[2023-03-17 20:35:26] [INFO ] Deduced a trap composed of 113 places in 559 ms of which 1 ms to minimize.
[2023-03-17 20:35:27] [INFO ] Deduced a trap composed of 75 places in 538 ms of which 1 ms to minimize.
[2023-03-17 20:35:27] [INFO ] Deduced a trap composed of 53 places in 395 ms of which 0 ms to minimize.
[2023-03-17 20:35:28] [INFO ] Deduced a trap composed of 58 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:35:29] [INFO ] Deduced a trap composed of 23 places in 517 ms of which 1 ms to minimize.
[2023-03-17 20:35:29] [INFO ] Deduced a trap composed of 40 places in 560 ms of which 1 ms to minimize.
[2023-03-17 20:35:30] [INFO ] Deduced a trap composed of 34 places in 601 ms of which 16 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:35:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:35:30] [INFO ] After 25509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 9 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1710/1710 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 2 place count 606 transition count 1708
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 604 transition count 1708
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 604 transition count 1705
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 601 transition count 1705
Applied a total of 10 rules in 84 ms. Remains 601 /606 variables (removed 5) and now considering 1705/1710 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 601/606 places, 1705/1710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 270144 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270144 steps, saw 48888 distinct states, run finished after 3003 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 20:35:34] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 601 cols
[2023-03-17 20:35:34] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-17 20:35:34] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-17 20:35:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:35:35] [INFO ] After 764ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-17 20:35:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:35:35] [INFO ] After 512ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 20:35:35] [INFO ] After 1589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 20:35:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:35:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:35:36] [INFO ] After 801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 20:35:37] [INFO ] After 460ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 20:35:38] [INFO ] Deduced a trap composed of 11 places in 578 ms of which 1 ms to minimize.
[2023-03-17 20:35:38] [INFO ] Deduced a trap composed of 11 places in 658 ms of which 1 ms to minimize.
[2023-03-17 20:35:39] [INFO ] Deduced a trap composed of 11 places in 643 ms of which 10 ms to minimize.
[2023-03-17 20:35:40] [INFO ] Deduced a trap composed of 11 places in 680 ms of which 1 ms to minimize.
[2023-03-17 20:35:40] [INFO ] Deduced a trap composed of 32 places in 631 ms of which 1 ms to minimize.
[2023-03-17 20:35:41] [INFO ] Deduced a trap composed of 21 places in 508 ms of which 1 ms to minimize.
[2023-03-17 20:35:42] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 0 ms to minimize.
[2023-03-17 20:35:42] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 2 ms to minimize.
[2023-03-17 20:35:43] [INFO ] Deduced a trap composed of 29 places in 625 ms of which 16 ms to minimize.
[2023-03-17 20:35:44] [INFO ] Deduced a trap composed of 32 places in 623 ms of which 1 ms to minimize.
[2023-03-17 20:35:44] [INFO ] Deduced a trap composed of 38 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:35:45] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 1 ms to minimize.
[2023-03-17 20:35:45] [INFO ] Deduced a trap composed of 44 places in 599 ms of which 1 ms to minimize.
[2023-03-17 20:35:46] [INFO ] Deduced a trap composed of 67 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:35:47] [INFO ] Deduced a trap composed of 13 places in 591 ms of which 1 ms to minimize.
[2023-03-17 20:35:47] [INFO ] Deduced a trap composed of 21 places in 557 ms of which 1 ms to minimize.
[2023-03-17 20:35:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10380 ms
[2023-03-17 20:35:48] [INFO ] Deduced a trap composed of 22 places in 576 ms of which 16 ms to minimize.
[2023-03-17 20:35:49] [INFO ] Deduced a trap composed of 25 places in 509 ms of which 1 ms to minimize.
[2023-03-17 20:35:49] [INFO ] Deduced a trap composed of 21 places in 598 ms of which 15 ms to minimize.
[2023-03-17 20:35:50] [INFO ] Deduced a trap composed of 45 places in 593 ms of which 1 ms to minimize.
[2023-03-17 20:35:50] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 2 ms to minimize.
[2023-03-17 20:35:51] [INFO ] Deduced a trap composed of 55 places in 449 ms of which 1 ms to minimize.
[2023-03-17 20:35:51] [INFO ] Deduced a trap composed of 64 places in 450 ms of which 0 ms to minimize.
[2023-03-17 20:35:52] [INFO ] Deduced a trap composed of 55 places in 450 ms of which 1 ms to minimize.
[2023-03-17 20:35:53] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 1 ms to minimize.
[2023-03-17 20:35:53] [INFO ] Deduced a trap composed of 41 places in 425 ms of which 1 ms to minimize.
[2023-03-17 20:35:54] [INFO ] Deduced a trap composed of 34 places in 424 ms of which 1 ms to minimize.
[2023-03-17 20:35:54] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 1 ms to minimize.
[2023-03-17 20:35:55] [INFO ] Deduced a trap composed of 42 places in 374 ms of which 0 ms to minimize.
[2023-03-17 20:35:55] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 1 ms to minimize.
[2023-03-17 20:35:56] [INFO ] Deduced a trap composed of 98 places in 404 ms of which 1 ms to minimize.
[2023-03-17 20:35:56] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 1 ms to minimize.
[2023-03-17 20:35:57] [INFO ] Deduced a trap composed of 42 places in 432 ms of which 1 ms to minimize.
[2023-03-17 20:35:58] [INFO ] Deduced a trap composed of 25 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:35:59] [INFO ] Deduced a trap composed of 59 places in 340 ms of which 1 ms to minimize.
[2023-03-17 20:35:59] [INFO ] Deduced a trap composed of 50 places in 457 ms of which 1 ms to minimize.
[2023-03-17 20:36:00] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 0 ms to minimize.
[2023-03-17 20:36:00] [INFO ] Deduced a trap composed of 68 places in 377 ms of which 1 ms to minimize.
[2023-03-17 20:36:00] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:36:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:36:00] [INFO ] After 25220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 64 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 601/601 places, 1705/1705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 62 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2023-03-17 20:36:01] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
[2023-03-17 20:36:01] [INFO ] Invariant cache hit.
[2023-03-17 20:36:01] [INFO ] Implicit Places using invariants in 871 ms returned [585, 586, 587, 588, 589, 598, 599]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 885 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 594/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 36 ms. Remains 594 /594 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 985 ms. Remains : 594/601 places, 1705/1705 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 334629 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334629 steps, saw 57005 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-17 20:36:05] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 594 cols
[2023-03-17 20:36:05] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-17 20:36:05] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-17 20:36:05] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 20:36:06] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 20:36:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:36:06] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:36:07] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-17 20:36:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:36:08] [INFO ] After 420ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-17 20:36:08] [INFO ] Deduced a trap composed of 54 places in 716 ms of which 1 ms to minimize.
[2023-03-17 20:36:09] [INFO ] Deduced a trap composed of 34 places in 711 ms of which 2 ms to minimize.
[2023-03-17 20:36:10] [INFO ] Deduced a trap composed of 112 places in 709 ms of which 1 ms to minimize.
[2023-03-17 20:36:11] [INFO ] Deduced a trap composed of 20 places in 642 ms of which 1 ms to minimize.
[2023-03-17 20:36:11] [INFO ] Deduced a trap composed of 33 places in 557 ms of which 1 ms to minimize.
[2023-03-17 20:36:12] [INFO ] Deduced a trap composed of 44 places in 583 ms of which 1 ms to minimize.
[2023-03-17 20:36:12] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 0 ms to minimize.
[2023-03-17 20:36:13] [INFO ] Deduced a trap composed of 32 places in 592 ms of which 1 ms to minimize.
[2023-03-17 20:36:14] [INFO ] Deduced a trap composed of 29 places in 480 ms of which 0 ms to minimize.
[2023-03-17 20:36:14] [INFO ] Deduced a trap composed of 31 places in 396 ms of which 1 ms to minimize.
[2023-03-17 20:36:15] [INFO ] Deduced a trap composed of 45 places in 623 ms of which 1 ms to minimize.
[2023-03-17 20:36:15] [INFO ] Deduced a trap composed of 11 places in 616 ms of which 2 ms to minimize.
[2023-03-17 20:36:16] [INFO ] Deduced a trap composed of 60 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:36:17] [INFO ] Deduced a trap composed of 13 places in 548 ms of which 1 ms to minimize.
[2023-03-17 20:36:17] [INFO ] Deduced a trap composed of 47 places in 550 ms of which 1 ms to minimize.
[2023-03-17 20:36:18] [INFO ] Deduced a trap composed of 13 places in 569 ms of which 2 ms to minimize.
[2023-03-17 20:36:19] [INFO ] Deduced a trap composed of 14 places in 533 ms of which 1 ms to minimize.
[2023-03-17 20:36:19] [INFO ] Deduced a trap composed of 45 places in 535 ms of which 1 ms to minimize.
[2023-03-17 20:36:20] [INFO ] Deduced a trap composed of 13 places in 529 ms of which 1 ms to minimize.
[2023-03-17 20:36:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 12193 ms
[2023-03-17 20:36:21] [INFO ] Deduced a trap composed of 58 places in 619 ms of which 1 ms to minimize.
[2023-03-17 20:36:21] [INFO ] Deduced a trap composed of 22 places in 596 ms of which 2 ms to minimize.
[2023-03-17 20:36:22] [INFO ] Deduced a trap composed of 23 places in 616 ms of which 1 ms to minimize.
[2023-03-17 20:36:23] [INFO ] Deduced a trap composed of 25 places in 544 ms of which 1 ms to minimize.
[2023-03-17 20:36:23] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 1 ms to minimize.
[2023-03-17 20:36:24] [INFO ] Deduced a trap composed of 59 places in 469 ms of which 1 ms to minimize.
[2023-03-17 20:36:24] [INFO ] Deduced a trap composed of 13 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:36:25] [INFO ] Deduced a trap composed of 49 places in 457 ms of which 1 ms to minimize.
[2023-03-17 20:36:25] [INFO ] Deduced a trap composed of 30 places in 505 ms of which 1 ms to minimize.
[2023-03-17 20:36:26] [INFO ] Deduced a trap composed of 25 places in 513 ms of which 1 ms to minimize.
[2023-03-17 20:36:26] [INFO ] Deduced a trap composed of 22 places in 544 ms of which 1 ms to minimize.
[2023-03-17 20:36:27] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 1 ms to minimize.
[2023-03-17 20:36:27] [INFO ] Deduced a trap composed of 58 places in 494 ms of which 1 ms to minimize.
[2023-03-17 20:36:28] [INFO ] Deduced a trap composed of 18 places in 454 ms of which 1 ms to minimize.
[2023-03-17 20:36:28] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 1 ms to minimize.
[2023-03-17 20:36:29] [INFO ] Deduced a trap composed of 45 places in 477 ms of which 1 ms to minimize.
[2023-03-17 20:36:29] [INFO ] Deduced a trap composed of 59 places in 472 ms of which 1 ms to minimize.
[2023-03-17 20:36:30] [INFO ] Deduced a trap composed of 12 places in 473 ms of which 2 ms to minimize.
[2023-03-17 20:36:30] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 1 ms to minimize.
[2023-03-17 20:36:31] [INFO ] Deduced a trap composed of 40 places in 447 ms of which 1 ms to minimize.
[2023-03-17 20:36:31] [INFO ] Deduced a trap composed of 41 places in 430 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:36:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:36:31] [INFO ] After 25222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 1705/1705 transitions.
Applied a total of 0 rules in 54 ms. Remains 594 /594 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 594/594 places, 1705/1705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 1705/1705 transitions.
Applied a total of 0 rules in 52 ms. Remains 594 /594 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2023-03-17 20:36:32] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
[2023-03-17 20:36:32] [INFO ] Invariant cache hit.
[2023-03-17 20:36:32] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-17 20:36:32] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
[2023-03-17 20:36:32] [INFO ] Invariant cache hit.
[2023-03-17 20:36:33] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:36:37] [INFO ] Implicit Places using invariants and state equation in 5181 ms returned []
Implicit Place search using SMT with State Equation took 5985 ms to find 0 implicit places.
[2023-03-17 20:36:38] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-17 20:36:38] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
[2023-03-17 20:36:38] [INFO ] Invariant cache hit.
[2023-03-17 20:36:39] [INFO ] Dead Transitions using invariants and state equation in 1616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7842 ms. Remains : 594/594 places, 1705/1705 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 48 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1992 transition count 2206
Reduce places removed 890 places and 0 transitions.
Iterating post reduction 1 with 890 rules applied. Total rules applied 1780 place count 1102 transition count 2206
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 406 Pre rules applied. Total rules applied 1780 place count 1102 transition count 1800
Deduced a syphon composed of 406 places in 2 ms
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 2 with 812 rules applied. Total rules applied 2592 place count 696 transition count 1800
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2608 place count 688 transition count 1792
Applied a total of 2608 rules in 299 ms. Remains 688 /1992 variables (removed 1304) and now considering 1792/3096 (removed 1304) transitions.
[2023-03-17 20:36:40] [INFO ] Flow matrix only has 1456 transitions (discarded 336 similar events)
// Phase 1: matrix 1456 rows 688 cols
[2023-03-17 20:36:40] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-17 20:36:41] [INFO ] Implicit Places using invariants in 839 ms returned [672, 673, 674, 675, 676, 685, 686, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 843 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 680/1992 places, 1792/3096 transitions.
Applied a total of 0 rules in 40 ms. Remains 680 /680 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1186 ms. Remains : 680/1992 places, 1792/3096 transitions.
Stuttering acceptance computed with spot in 192 ms :[false]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s394 1) (EQ s393 1) (EQ s392 1) (EQ s391 1) (EQ s390 1) (EQ s389 1) (EQ s388 1) (EQ s387 1) (EQ s402 1) (EQ s401 1) (EQ s400 1) (EQ s399 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 762 ms.
Stack based approach found an accepted trace after 1945 steps with 0 reset with depth 1946 and stack size 1671 in 18 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 2235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 16 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:36:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:36:42] [INFO ] Computed 31 place invariants in 23 ms
[2023-03-17 20:36:43] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2023-03-17 20:36:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:43] [INFO ] Invariant cache hit.
[2023-03-17 20:36:45] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 2519 ms to find 0 implicit places.
[2023-03-17 20:36:45] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:45] [INFO ] Invariant cache hit.
[2023-03-17 20:36:48] [INFO ] Dead Transitions using invariants and state equation in 3340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5950 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01 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:(AND (OR (NEQ s1016 1) (NEQ s1927 1)) (OR (NEQ s896 1) (NEQ s1921 1)) (OR (NEQ s895 1) (NEQ s1922 1)) (OR (NEQ s894 1) (NEQ s1923 1)) (OR (NEQ s893 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]]
Entered a terminal (fully accepting) state of product in 376 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 6077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 168 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 90 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:36:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:48] [INFO ] Invariant cache hit.
[2023-03-17 20:36:49] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2023-03-17 20:36:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:49] [INFO ] Invariant cache hit.
[2023-03-17 20:36:50] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-17 20:36:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:50] [INFO ] Invariant cache hit.
[2023-03-17 20:36:54] [INFO ] Dead Transitions using invariants and state equation in 3555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5687 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s1289 1) (EQ s1823 1)) (AND (EQ s1283 1) (EQ s1820 1)) (AND (EQ s1287 1) (EQ s1811 1)) (AND (EQ s1333 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 6037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((F(p1)&&p0))&&X(p2))))'
Support contains 904 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 26 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:36:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:54] [INFO ] Invariant cache hit.
[2023-03-17 20:36:55] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-17 20:36:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:55] [INFO ] Invariant cache hit.
[2023-03-17 20:36:57] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2023-03-17 20:36:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:36:57] [INFO ] Invariant cache hit.
[2023-03-17 20:37:00] [INFO ] Dead Transitions using invariants and state equation in 3858 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6336 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1626 0) (EQ s1431 0) (EQ s1886 0) (EQ s1691 0) (EQ s1756 0) (EQ s1610 0) (EQ s1675 0) (EQ s1870 0) (EQ s1480 0) (EQ s1463 0) (EQ s1723 0) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5775 ms.
Product exploration explored 100000 steps with 50000 reset in 5700 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 315 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 18427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 120 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 103 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:37:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:13] [INFO ] Invariant cache hit.
[2023-03-17 20:37:14] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2023-03-17 20:37:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:14] [INFO ] Invariant cache hit.
[2023-03-17 20:37:14] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2023-03-17 20:37:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:14] [INFO ] Invariant cache hit.
[2023-03-17 20:37:18] [INFO ] Dead Transitions using invariants and state equation in 3378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5147 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s487 1) (EQ s486 1) (EQ s485 1) (EQ s483 1) (EQ s482 1) (EQ s481 1) (EQ s492 1) (EQ s488 1)), p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 5272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(((p0 U p1)&&!p0) U G(p0))&&X(p1)))))'
Support contains 464 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 46 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:37:18] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:18] [INFO ] Invariant cache hit.
[2023-03-17 20:37:18] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-17 20:37:18] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:18] [INFO ] Invariant cache hit.
[2023-03-17 20:37:19] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2023-03-17 20:37:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:19] [INFO ] Invariant cache hit.
[2023-03-17 20:37:22] [INFO ] Dead Transitions using invariants and state equation in 3504 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4734 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s1020 1) (EQ s1979 1)) (AND (EQ s1006 1) (EQ s1989 1)) (AND (EQ s1013 1) (EQ s1980 1)) (AND (EQ s1007 1) (EQ s1990 1)) (AND (EQ s1008 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4466 reset in 754 ms.
Stack based approach found an accepted trace after 884 steps with 40 reset with depth 27 and stack size 27 in 7 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 5742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2686 place count 649 transition count 1753
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 169 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-17 20:37:24] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-17 20:37:24] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-17 20:37:25] [INFO ] Implicit Places using invariants in 1071 ms returned [579, 580, 581, 582, 583, 592, 593, 594]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1074 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 36 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1285 ms. Remains : 587/1992 places, 1699/3096 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s330 1) (EQ s353 1)), p0:(AND (EQ s516 1) (EQ s552 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 300 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 1770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2796 place count 594 transition count 1698
Applied a total of 2796 rules in 157 ms. Remains 594 /1992 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2023-03-17 20:37:25] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 594 cols
[2023-03-17 20:37:25] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-17 20:37:26] [INFO ] Implicit Places using invariants in 929 ms returned [578, 579, 580, 581, 582, 591, 592, 593]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 932 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/1992 places, 1698/3096 transitions.
Applied a total of 0 rules in 29 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1119 ms. Remains : 586/1992 places, 1698/3096 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s473 1) (EQ s561 1)) (AND (EQ s563 1) (EQ s574 1))), p1:(OR (EQ s458 0) (EQ s573 0))], nbAcceptance=2, 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 371 ms.
Stack based approach found an accepted trace after 1036 steps with 0 reset with depth 1037 and stack size 898 in 4 ms.
FORMULA Peterson-PT-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 1564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p1||(p2 U p3)))||p0)))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:37:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:37:27] [INFO ] Computed 31 place invariants in 26 ms
[2023-03-17 20:37:28] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2023-03-17 20:37:28] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:28] [INFO ] Invariant cache hit.
[2023-03-17 20:37:30] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2023-03-17 20:37:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:30] [INFO ] Invariant cache hit.
[2023-03-17 20:37:33] [INFO ] Dead Transitions using invariants and state equation in 3614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6384 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s894 0) (EQ s1923 0) (EQ s1749 0)), p1:(EQ s1749 0), p3:(AND (EQ s1822 1) (EQ s1961 1)), p2:(EQ s1749 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 347 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 20:37:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:37:35] [INFO ] Invariant cache hit.
[2023-03-17 20:37:36] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-17 20:37:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:37:36] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-17 20:37:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2023-03-17 20:37:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:37:39] [INFO ] After 1894ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-17 20:37:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:37:39] [INFO ] After 628ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-17 20:37:42] [INFO ] Deduced a trap composed of 64 places in 2131 ms of which 2 ms to minimize.
[2023-03-17 20:37:43] [INFO ] Deduced a trap composed of 22 places in 1329 ms of which 1 ms to minimize.
[2023-03-17 20:37:45] [INFO ] Deduced a trap composed of 20 places in 1928 ms of which 2 ms to minimize.
[2023-03-17 20:37:47] [INFO ] Deduced a trap composed of 54 places in 1781 ms of which 2 ms to minimize.
[2023-03-17 20:37:49] [INFO ] Deduced a trap composed of 116 places in 2230 ms of which 2 ms to minimize.
[2023-03-17 20:37:51] [INFO ] Deduced a trap composed of 56 places in 1753 ms of which 1 ms to minimize.
[2023-03-17 20:37:53] [INFO ] Deduced a trap composed of 123 places in 1927 ms of which 5 ms to minimize.
[2023-03-17 20:37:56] [INFO ] Deduced a trap composed of 21 places in 2047 ms of which 3 ms to minimize.
[2023-03-17 20:37:58] [INFO ] Deduced a trap composed of 183 places in 1769 ms of which 2 ms to minimize.
[2023-03-17 20:38:00] [INFO ] Deduced a trap composed of 58 places in 1846 ms of which 3 ms to minimize.
[2023-03-17 20:38:02] [INFO ] Deduced a trap composed of 92 places in 1625 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:38:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:38:02] [INFO ] After 26209ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 272 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 409266 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409266 steps, saw 63104 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:38:06] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-17 20:38:06] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-17 20:38:06] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-17 20:38:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:38:06] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:38:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:38:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:38:07] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:38:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:38:07] [INFO ] After 400ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:38:08] [INFO ] Deduced a trap composed of 40 places in 511 ms of which 1 ms to minimize.
[2023-03-17 20:38:08] [INFO ] Deduced a trap composed of 39 places in 496 ms of which 3 ms to minimize.
[2023-03-17 20:38:09] [INFO ] Deduced a trap composed of 13 places in 510 ms of which 1 ms to minimize.
[2023-03-17 20:38:09] [INFO ] Deduced a trap composed of 13 places in 396 ms of which 1 ms to minimize.
[2023-03-17 20:38:10] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2023-03-17 20:38:10] [INFO ] Deduced a trap composed of 22 places in 438 ms of which 1 ms to minimize.
[2023-03-17 20:38:11] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 1 ms to minimize.
[2023-03-17 20:38:11] [INFO ] Deduced a trap composed of 31 places in 579 ms of which 1 ms to minimize.
[2023-03-17 20:38:12] [INFO ] Deduced a trap composed of 21 places in 519 ms of which 1 ms to minimize.
[2023-03-17 20:38:13] [INFO ] Deduced a trap composed of 77 places in 524 ms of which 1 ms to minimize.
[2023-03-17 20:38:13] [INFO ] Deduced a trap composed of 66 places in 409 ms of which 1 ms to minimize.
[2023-03-17 20:38:14] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2023-03-17 20:38:14] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 1 ms to minimize.
[2023-03-17 20:38:15] [INFO ] Deduced a trap composed of 31 places in 517 ms of which 1 ms to minimize.
[2023-03-17 20:38:16] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 1 ms to minimize.
[2023-03-17 20:38:16] [INFO ] Deduced a trap composed of 41 places in 480 ms of which 1 ms to minimize.
[2023-03-17 20:38:17] [INFO ] Deduced a trap composed of 23 places in 581 ms of which 1 ms to minimize.
[2023-03-17 20:38:17] [INFO ] Deduced a trap composed of 32 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:38:18] [INFO ] Deduced a trap composed of 11 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:38:19] [INFO ] Deduced a trap composed of 40 places in 516 ms of which 1 ms to minimize.
[2023-03-17 20:38:19] [INFO ] Deduced a trap composed of 58 places in 537 ms of which 1 ms to minimize.
[2023-03-17 20:38:20] [INFO ] Deduced a trap composed of 57 places in 458 ms of which 1 ms to minimize.
[2023-03-17 20:38:20] [INFO ] Deduced a trap composed of 58 places in 447 ms of which 1 ms to minimize.
[2023-03-17 20:38:21] [INFO ] Deduced a trap composed of 55 places in 525 ms of which 1 ms to minimize.
[2023-03-17 20:38:22] [INFO ] Deduced a trap composed of 25 places in 420 ms of which 1 ms to minimize.
[2023-03-17 20:38:22] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 0 ms to minimize.
[2023-03-17 20:38:23] [INFO ] Deduced a trap composed of 20 places in 487 ms of which 1 ms to minimize.
[2023-03-17 20:38:23] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 1 ms to minimize.
[2023-03-17 20:38:24] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:38:24] [INFO ] Deduced a trap composed of 52 places in 435 ms of which 1 ms to minimize.
[2023-03-17 20:38:25] [INFO ] Deduced a trap composed of 52 places in 428 ms of which 1 ms to minimize.
[2023-03-17 20:38:25] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 0 ms to minimize.
[2023-03-17 20:38:26] [INFO ] Deduced a trap composed of 52 places in 511 ms of which 1 ms to minimize.
[2023-03-17 20:38:26] [INFO ] Deduced a trap composed of 52 places in 399 ms of which 1 ms to minimize.
[2023-03-17 20:38:27] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 1 ms to minimize.
[2023-03-17 20:38:27] [INFO ] Deduced a trap composed of 67 places in 466 ms of which 1 ms to minimize.
[2023-03-17 20:38:28] [INFO ] Deduced a trap composed of 67 places in 466 ms of which 1 ms to minimize.
[2023-03-17 20:38:28] [INFO ] Deduced a trap composed of 55 places in 368 ms of which 1 ms to minimize.
[2023-03-17 20:38:29] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 1 ms to minimize.
[2023-03-17 20:38:29] [INFO ] Deduced a trap composed of 49 places in 472 ms of which 1 ms to minimize.
[2023-03-17 20:38:30] [INFO ] Deduced a trap composed of 45 places in 397 ms of which 1 ms to minimize.
[2023-03-17 20:38:30] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 1 ms to minimize.
[2023-03-17 20:38:31] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 0 ms to minimize.
[2023-03-17 20:38:31] [INFO ] Deduced a trap composed of 37 places in 455 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:38:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:38:31] [INFO ] After 25441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 44 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 42 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:38:31] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:38:31] [INFO ] Invariant cache hit.
[2023-03-17 20:38:32] [INFO ] Implicit Places using invariants in 1003 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 41 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1092 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 399618 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399618 steps, saw 62180 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:38:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-17 20:38:36] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:38:36] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-17 20:38:36] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:38:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:38:37] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:38:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:38:37] [INFO ] After 284ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:38:38] [INFO ] Deduced a trap composed of 12 places in 520 ms of which 1 ms to minimize.
[2023-03-17 20:38:38] [INFO ] Deduced a trap composed of 22 places in 474 ms of which 1 ms to minimize.
[2023-03-17 20:38:39] [INFO ] Deduced a trap composed of 21 places in 629 ms of which 1 ms to minimize.
[2023-03-17 20:38:40] [INFO ] Deduced a trap composed of 13 places in 646 ms of which 1 ms to minimize.
[2023-03-17 20:38:40] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2023-03-17 20:38:41] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 1 ms to minimize.
[2023-03-17 20:38:41] [INFO ] Deduced a trap composed of 22 places in 510 ms of which 1 ms to minimize.
[2023-03-17 20:38:42] [INFO ] Deduced a trap composed of 12 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:38:42] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 1 ms to minimize.
[2023-03-17 20:38:43] [INFO ] Deduced a trap composed of 40 places in 516 ms of which 1 ms to minimize.
[2023-03-17 20:38:44] [INFO ] Deduced a trap composed of 21 places in 531 ms of which 1 ms to minimize.
[2023-03-17 20:38:44] [INFO ] Deduced a trap composed of 93 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:38:45] [INFO ] Deduced a trap composed of 12 places in 553 ms of which 1 ms to minimize.
[2023-03-17 20:38:45] [INFO ] Deduced a trap composed of 35 places in 486 ms of which 1 ms to minimize.
[2023-03-17 20:38:46] [INFO ] Deduced a trap composed of 31 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:38:47] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 1 ms to minimize.
[2023-03-17 20:38:47] [INFO ] Deduced a trap composed of 70 places in 534 ms of which 1 ms to minimize.
[2023-03-17 20:38:48] [INFO ] Deduced a trap composed of 57 places in 475 ms of which 1 ms to minimize.
[2023-03-17 20:38:48] [INFO ] Deduced a trap composed of 31 places in 474 ms of which 1 ms to minimize.
[2023-03-17 20:38:49] [INFO ] Deduced a trap composed of 40 places in 498 ms of which 1 ms to minimize.
[2023-03-17 20:38:49] [INFO ] Deduced a trap composed of 39 places in 521 ms of which 1 ms to minimize.
[2023-03-17 20:38:50] [INFO ] Deduced a trap composed of 22 places in 575 ms of which 1 ms to minimize.
[2023-03-17 20:38:51] [INFO ] Deduced a trap composed of 13 places in 612 ms of which 1 ms to minimize.
[2023-03-17 20:38:51] [INFO ] Deduced a trap composed of 31 places in 572 ms of which 1 ms to minimize.
[2023-03-17 20:38:52] [INFO ] Deduced a trap composed of 12 places in 606 ms of which 2 ms to minimize.
[2023-03-17 20:38:53] [INFO ] Deduced a trap composed of 14 places in 512 ms of which 1 ms to minimize.
[2023-03-17 20:38:53] [INFO ] Deduced a trap composed of 25 places in 636 ms of which 2 ms to minimize.
[2023-03-17 20:38:54] [INFO ] Deduced a trap composed of 39 places in 434 ms of which 1 ms to minimize.
[2023-03-17 20:38:54] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 1 ms to minimize.
[2023-03-17 20:38:55] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 0 ms to minimize.
[2023-03-17 20:38:56] [INFO ] Deduced a trap composed of 40 places in 539 ms of which 1 ms to minimize.
[2023-03-17 20:38:56] [INFO ] Deduced a trap composed of 55 places in 526 ms of which 1 ms to minimize.
[2023-03-17 20:38:57] [INFO ] Deduced a trap composed of 32 places in 425 ms of which 1 ms to minimize.
[2023-03-17 20:38:57] [INFO ] Deduced a trap composed of 48 places in 439 ms of which 1 ms to minimize.
[2023-03-17 20:38:58] [INFO ] Deduced a trap composed of 14 places in 638 ms of which 1 ms to minimize.
[2023-03-17 20:38:59] [INFO ] Deduced a trap composed of 23 places in 480 ms of which 1 ms to minimize.
[2023-03-17 20:38:59] [INFO ] Deduced a trap composed of 53 places in 447 ms of which 1 ms to minimize.
[2023-03-17 20:39:00] [INFO ] Deduced a trap composed of 31 places in 450 ms of which 0 ms to minimize.
[2023-03-17 20:39:00] [INFO ] Deduced a trap composed of 66 places in 503 ms of which 1 ms to minimize.
[2023-03-17 20:39:01] [INFO ] Deduced a trap composed of 41 places in 489 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:39:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:39:01] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 42 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:39:01] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:39:01] [INFO ] Invariant cache hit.
[2023-03-17 20:39:02] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-17 20:39:02] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:39:02] [INFO ] Invariant cache hit.
[2023-03-17 20:39:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:39:06] [INFO ] Implicit Places using invariants and state equation in 4425 ms returned []
Implicit Place search using SMT with State Equation took 5306 ms to find 0 implicit places.
[2023-03-17 20:39:06] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 20:39:06] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:39:06] [INFO ] Invariant cache hit.
[2023-03-17 20:39:08] [INFO ] Dead Transitions using invariants and state equation in 1785 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7201 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 5 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 48 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-17 20:39:08] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 20:39:08] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 20:39:08] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:39:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 20:39:08] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:39:08] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-17 20:39:09] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 553 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 172 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:39:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:39:10] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-17 20:39:11] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2023-03-17 20:39:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:39:11] [INFO ] Invariant cache hit.
[2023-03-17 20:39:13] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 2981 ms to find 0 implicit places.
[2023-03-17 20:39:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:39:13] [INFO ] Invariant cache hit.
[2023-03-17 20:39:16] [INFO ] Dead Transitions using invariants and state equation in 3002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6156 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 127332 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127332 steps, saw 81677 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 20:39:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:39:19] [INFO ] Invariant cache hit.
[2023-03-17 20:39:20] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-17 20:39:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:39:22] [INFO ] After 1907ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-17 20:39:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:39:23] [INFO ] After 402ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 20:39:23] [INFO ] After 3239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 20:39:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-17 20:39:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:39:25] [INFO ] After 1827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 20:39:27] [INFO ] After 1413ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 20:39:29] [INFO ] Deduced a trap composed of 116 places in 1618 ms of which 2 ms to minimize.
[2023-03-17 20:39:31] [INFO ] Deduced a trap composed of 119 places in 1657 ms of which 2 ms to minimize.
[2023-03-17 20:39:33] [INFO ] Deduced a trap composed of 16 places in 1894 ms of which 2 ms to minimize.
[2023-03-17 20:39:34] [INFO ] Deduced a trap composed of 24 places in 1592 ms of which 2 ms to minimize.
[2023-03-17 20:39:36] [INFO ] Deduced a trap composed of 85 places in 1814 ms of which 3 ms to minimize.
[2023-03-17 20:39:38] [INFO ] Deduced a trap composed of 92 places in 1677 ms of which 3 ms to minimize.
[2023-03-17 20:39:40] [INFO ] Deduced a trap composed of 24 places in 1717 ms of which 2 ms to minimize.
[2023-03-17 20:39:42] [INFO ] Deduced a trap composed of 21 places in 1516 ms of which 2 ms to minimize.
[2023-03-17 20:39:44] [INFO ] Deduced a trap composed of 21 places in 1911 ms of which 2 ms to minimize.
[2023-03-17 20:39:45] [INFO ] Deduced a trap composed of 21 places in 1547 ms of which 1 ms to minimize.
[2023-03-17 20:39:47] [INFO ] Deduced a trap composed of 88 places in 1179 ms of which 1 ms to minimize.
[2023-03-17 20:39:48] [INFO ] Deduced a trap composed of 122 places in 1346 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:39:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:39:48] [INFO ] After 25510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 155 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:39:48] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-17 20:39:48] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-17 20:39:49] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:39:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-17 20:39:49] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:39:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-17 20:39:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:39:50] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:39:50] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:39:50] [INFO ] After 327ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:39:50] [INFO ] Deduced a trap composed of 40 places in 424 ms of which 1 ms to minimize.
[2023-03-17 20:39:51] [INFO ] Deduced a trap composed of 39 places in 491 ms of which 1 ms to minimize.
[2023-03-17 20:39:52] [INFO ] Deduced a trap composed of 13 places in 565 ms of which 1 ms to minimize.
[2023-03-17 20:39:52] [INFO ] Deduced a trap composed of 13 places in 575 ms of which 0 ms to minimize.
[2023-03-17 20:39:53] [INFO ] Deduced a trap composed of 13 places in 380 ms of which 1 ms to minimize.
[2023-03-17 20:39:53] [INFO ] Deduced a trap composed of 22 places in 604 ms of which 1 ms to minimize.
[2023-03-17 20:39:54] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 1 ms to minimize.
[2023-03-17 20:39:54] [INFO ] Deduced a trap composed of 31 places in 564 ms of which 0 ms to minimize.
[2023-03-17 20:39:55] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 1 ms to minimize.
[2023-03-17 20:39:56] [INFO ] Deduced a trap composed of 77 places in 545 ms of which 2 ms to minimize.
[2023-03-17 20:39:56] [INFO ] Deduced a trap composed of 66 places in 544 ms of which 2 ms to minimize.
[2023-03-17 20:39:57] [INFO ] Deduced a trap composed of 25 places in 368 ms of which 1 ms to minimize.
[2023-03-17 20:39:57] [INFO ] Deduced a trap composed of 31 places in 443 ms of which 1 ms to minimize.
[2023-03-17 20:39:58] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 1 ms to minimize.
[2023-03-17 20:39:59] [INFO ] Deduced a trap composed of 14 places in 615 ms of which 2 ms to minimize.
[2023-03-17 20:39:59] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:40:00] [INFO ] Deduced a trap composed of 23 places in 558 ms of which 2 ms to minimize.
[2023-03-17 20:40:00] [INFO ] Deduced a trap composed of 32 places in 516 ms of which 5 ms to minimize.
[2023-03-17 20:40:01] [INFO ] Deduced a trap composed of 11 places in 556 ms of which 1 ms to minimize.
[2023-03-17 20:40:02] [INFO ] Deduced a trap composed of 40 places in 521 ms of which 1 ms to minimize.
[2023-03-17 20:40:02] [INFO ] Deduced a trap composed of 58 places in 510 ms of which 5 ms to minimize.
[2023-03-17 20:40:03] [INFO ] Deduced a trap composed of 57 places in 516 ms of which 1 ms to minimize.
[2023-03-17 20:40:03] [INFO ] Deduced a trap composed of 58 places in 507 ms of which 1 ms to minimize.
[2023-03-17 20:40:04] [INFO ] Deduced a trap composed of 55 places in 457 ms of which 1 ms to minimize.
[2023-03-17 20:40:05] [INFO ] Deduced a trap composed of 25 places in 515 ms of which 1 ms to minimize.
[2023-03-17 20:40:05] [INFO ] Deduced a trap composed of 31 places in 466 ms of which 1 ms to minimize.
[2023-03-17 20:40:06] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 1 ms to minimize.
[2023-03-17 20:40:06] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 1 ms to minimize.
[2023-03-17 20:40:07] [INFO ] Deduced a trap composed of 58 places in 421 ms of which 0 ms to minimize.
[2023-03-17 20:40:07] [INFO ] Deduced a trap composed of 52 places in 377 ms of which 1 ms to minimize.
[2023-03-17 20:40:08] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 0 ms to minimize.
[2023-03-17 20:40:08] [INFO ] Deduced a trap composed of 49 places in 382 ms of which 1 ms to minimize.
[2023-03-17 20:40:09] [INFO ] Deduced a trap composed of 52 places in 397 ms of which 1 ms to minimize.
[2023-03-17 20:40:09] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 1 ms to minimize.
[2023-03-17 20:40:10] [INFO ] Deduced a trap composed of 49 places in 435 ms of which 1 ms to minimize.
[2023-03-17 20:40:10] [INFO ] Deduced a trap composed of 67 places in 344 ms of which 1 ms to minimize.
[2023-03-17 20:40:11] [INFO ] Deduced a trap composed of 67 places in 345 ms of which 0 ms to minimize.
[2023-03-17 20:40:11] [INFO ] Deduced a trap composed of 55 places in 418 ms of which 0 ms to minimize.
[2023-03-17 20:40:12] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 1 ms to minimize.
[2023-03-17 20:40:12] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-17 20:40:13] [INFO ] Deduced a trap composed of 45 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:40:13] [INFO ] Deduced a trap composed of 30 places in 562 ms of which 1 ms to minimize.
[2023-03-17 20:40:14] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:40:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:40:14] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 46 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 596/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 351774 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351774 steps, saw 58207 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:40:17] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:40:17] [INFO ] Invariant cache hit.
[2023-03-17 20:40:17] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-17 20:40:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:40:17] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:40:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:40:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-17 20:40:18] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:40:18] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:40:18] [INFO ] After 263ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:40:19] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 1 ms to minimize.
[2023-03-17 20:40:19] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:40:20] [INFO ] Deduced a trap composed of 13 places in 536 ms of which 1 ms to minimize.
[2023-03-17 20:40:21] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 1 ms to minimize.
[2023-03-17 20:40:21] [INFO ] Deduced a trap composed of 13 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:40:22] [INFO ] Deduced a trap composed of 12 places in 553 ms of which 2 ms to minimize.
[2023-03-17 20:40:23] [INFO ] Deduced a trap composed of 14 places in 563 ms of which 1 ms to minimize.
[2023-03-17 20:40:23] [INFO ] Deduced a trap composed of 16 places in 583 ms of which 1 ms to minimize.
[2023-03-17 20:40:24] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 1 ms to minimize.
[2023-03-17 20:40:24] [INFO ] Deduced a trap composed of 27 places in 563 ms of which 1 ms to minimize.
[2023-03-17 20:40:25] [INFO ] Deduced a trap composed of 23 places in 554 ms of which 1 ms to minimize.
[2023-03-17 20:40:26] [INFO ] Deduced a trap composed of 40 places in 446 ms of which 1 ms to minimize.
[2023-03-17 20:40:26] [INFO ] Deduced a trap composed of 45 places in 465 ms of which 1 ms to minimize.
[2023-03-17 20:40:27] [INFO ] Deduced a trap composed of 66 places in 436 ms of which 1 ms to minimize.
[2023-03-17 20:40:27] [INFO ] Deduced a trap composed of 40 places in 459 ms of which 1 ms to minimize.
[2023-03-17 20:40:28] [INFO ] Deduced a trap composed of 30 places in 457 ms of which 1 ms to minimize.
[2023-03-17 20:40:28] [INFO ] Deduced a trap composed of 58 places in 356 ms of which 1 ms to minimize.
[2023-03-17 20:40:29] [INFO ] Deduced a trap composed of 58 places in 359 ms of which 1 ms to minimize.
[2023-03-17 20:40:29] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 1 ms to minimize.
[2023-03-17 20:40:30] [INFO ] Deduced a trap composed of 49 places in 446 ms of which 1 ms to minimize.
[2023-03-17 20:40:30] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-17 20:40:31] [INFO ] Deduced a trap composed of 40 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:40:31] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 1 ms to minimize.
[2023-03-17 20:40:32] [INFO ] Deduced a trap composed of 32 places in 513 ms of which 1 ms to minimize.
[2023-03-17 20:40:32] [INFO ] Deduced a trap composed of 40 places in 473 ms of which 1 ms to minimize.
[2023-03-17 20:40:33] [INFO ] Deduced a trap composed of 58 places in 428 ms of which 1 ms to minimize.
[2023-03-17 20:40:33] [INFO ] Deduced a trap composed of 49 places in 436 ms of which 15 ms to minimize.
[2023-03-17 20:40:34] [INFO ] Deduced a trap composed of 45 places in 611 ms of which 2 ms to minimize.
[2023-03-17 20:40:35] [INFO ] Deduced a trap composed of 49 places in 562 ms of which 1 ms to minimize.
[2023-03-17 20:40:35] [INFO ] Deduced a trap composed of 65 places in 550 ms of which 1 ms to minimize.
[2023-03-17 20:40:36] [INFO ] Deduced a trap composed of 58 places in 544 ms of which 2 ms to minimize.
[2023-03-17 20:40:37] [INFO ] Deduced a trap composed of 20 places in 514 ms of which 1 ms to minimize.
[2023-03-17 20:40:37] [INFO ] Deduced a trap composed of 24 places in 491 ms of which 1 ms to minimize.
[2023-03-17 20:40:38] [INFO ] Deduced a trap composed of 62 places in 509 ms of which 1 ms to minimize.
[2023-03-17 20:40:38] [INFO ] Deduced a trap composed of 68 places in 498 ms of which 1 ms to minimize.
[2023-03-17 20:40:39] [INFO ] Deduced a trap composed of 62 places in 519 ms of which 1 ms to minimize.
[2023-03-17 20:40:39] [INFO ] Deduced a trap composed of 22 places in 522 ms of which 0 ms to minimize.
[2023-03-17 20:40:40] [INFO ] Deduced a trap composed of 81 places in 504 ms of which 1 ms to minimize.
[2023-03-17 20:40:41] [INFO ] Deduced a trap composed of 25 places in 532 ms of which 1 ms to minimize.
[2023-03-17 20:40:41] [INFO ] Deduced a trap composed of 31 places in 528 ms of which 1 ms to minimize.
[2023-03-17 20:40:42] [INFO ] Deduced a trap composed of 67 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:40:42] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 1 ms to minimize.
[2023-03-17 20:40:42] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 24004 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:40:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:40:42] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 47 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 43 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:40:43] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:40:43] [INFO ] Invariant cache hit.
[2023-03-17 20:40:44] [INFO ] Implicit Places using invariants in 1304 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1306 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1378 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 378666 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378666 steps, saw 60248 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:40:47] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-17 20:40:47] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 20:40:47] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-17 20:40:47] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:40:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-17 20:40:48] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:40:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:40:49] [INFO ] After 252ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:40:49] [INFO ] Deduced a trap composed of 12 places in 571 ms of which 1 ms to minimize.
[2023-03-17 20:40:50] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 0 ms to minimize.
[2023-03-17 20:40:50] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 1 ms to minimize.
[2023-03-17 20:40:51] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 1 ms to minimize.
[2023-03-17 20:40:51] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 2 ms to minimize.
[2023-03-17 20:40:52] [INFO ] Deduced a trap composed of 14 places in 622 ms of which 1 ms to minimize.
[2023-03-17 20:40:53] [INFO ] Deduced a trap composed of 22 places in 462 ms of which 0 ms to minimize.
[2023-03-17 20:40:53] [INFO ] Deduced a trap composed of 12 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:40:54] [INFO ] Deduced a trap composed of 97 places in 470 ms of which 1 ms to minimize.
[2023-03-17 20:40:55] [INFO ] Deduced a trap composed of 40 places in 595 ms of which 1 ms to minimize.
[2023-03-17 20:40:55] [INFO ] Deduced a trap composed of 21 places in 581 ms of which 1 ms to minimize.
[2023-03-17 20:40:56] [INFO ] Deduced a trap composed of 93 places in 604 ms of which 1 ms to minimize.
[2023-03-17 20:40:57] [INFO ] Deduced a trap composed of 12 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:40:57] [INFO ] Deduced a trap composed of 35 places in 570 ms of which 1 ms to minimize.
[2023-03-17 20:40:58] [INFO ] Deduced a trap composed of 31 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:40:58] [INFO ] Deduced a trap composed of 31 places in 524 ms of which 1 ms to minimize.
[2023-03-17 20:40:59] [INFO ] Deduced a trap composed of 70 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:41:00] [INFO ] Deduced a trap composed of 57 places in 542 ms of which 1 ms to minimize.
[2023-03-17 20:41:00] [INFO ] Deduced a trap composed of 31 places in 532 ms of which 1 ms to minimize.
[2023-03-17 20:41:01] [INFO ] Deduced a trap composed of 40 places in 561 ms of which 1 ms to minimize.
[2023-03-17 20:41:01] [INFO ] Deduced a trap composed of 39 places in 577 ms of which 1 ms to minimize.
[2023-03-17 20:41:02] [INFO ] Deduced a trap composed of 22 places in 566 ms of which 1 ms to minimize.
[2023-03-17 20:41:03] [INFO ] Deduced a trap composed of 13 places in 584 ms of which 1 ms to minimize.
[2023-03-17 20:41:03] [INFO ] Deduced a trap composed of 31 places in 537 ms of which 1 ms to minimize.
[2023-03-17 20:41:04] [INFO ] Deduced a trap composed of 12 places in 596 ms of which 1 ms to minimize.
[2023-03-17 20:41:05] [INFO ] Deduced a trap composed of 14 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:41:05] [INFO ] Deduced a trap composed of 25 places in 618 ms of which 2 ms to minimize.
[2023-03-17 20:41:06] [INFO ] Deduced a trap composed of 39 places in 500 ms of which 1 ms to minimize.
[2023-03-17 20:41:07] [INFO ] Deduced a trap composed of 41 places in 495 ms of which 1 ms to minimize.
[2023-03-17 20:41:07] [INFO ] Deduced a trap composed of 57 places in 514 ms of which 1 ms to minimize.
[2023-03-17 20:41:08] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 1 ms to minimize.
[2023-03-17 20:41:08] [INFO ] Deduced a trap composed of 55 places in 441 ms of which 2 ms to minimize.
[2023-03-17 20:41:09] [INFO ] Deduced a trap composed of 32 places in 427 ms of which 0 ms to minimize.
[2023-03-17 20:41:10] [INFO ] Deduced a trap composed of 48 places in 611 ms of which 1 ms to minimize.
[2023-03-17 20:41:10] [INFO ] Deduced a trap composed of 14 places in 539 ms of which 1 ms to minimize.
[2023-03-17 20:41:11] [INFO ] Deduced a trap composed of 23 places in 526 ms of which 1 ms to minimize.
[2023-03-17 20:41:11] [INFO ] Deduced a trap composed of 53 places in 472 ms of which 2 ms to minimize.
[2023-03-17 20:41:12] [INFO ] Deduced a trap composed of 31 places in 504 ms of which 1 ms to minimize.
[2023-03-17 20:41:12] [INFO ] Deduced a trap composed of 66 places in 371 ms of which 1 ms to minimize.
[2023-03-17 20:41:13] [INFO ] Deduced a trap composed of 2 places in 687 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:41:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:41:13] [INFO ] After 25703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:41:13] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:41:13] [INFO ] Invariant cache hit.
[2023-03-17 20:41:14] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-17 20:41:14] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:41:14] [INFO ] Invariant cache hit.
[2023-03-17 20:41:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:41:19] [INFO ] Implicit Places using invariants and state equation in 4906 ms returned []
Implicit Place search using SMT with State Equation took 5723 ms to find 0 implicit places.
[2023-03-17 20:41:19] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-17 20:41:19] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:41:19] [INFO ] Invariant cache hit.
[2023-03-17 20:41:20] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7265 ms. Remains : 588/588 places, 1700/1700 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 435 ms.
Product exploration explored 100000 steps with 0 reset in 541 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 503 place count 1992 transition count 3389
Deduced a syphon composed of 902 places in 4 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 902 place count 1992 transition count 3389
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1105 place count 1789 transition count 3186
Deduced a syphon composed of 699 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1308 place count 1789 transition count 3186
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1193 places in 1 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1802 place count 1789 transition count 3186
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2247 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2692 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2692 rules in 895 ms. Remains 1344 /1992 variables (removed 648) and now considering 2741/3096 (removed 355) transitions.
[2023-03-17 20:41:24] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-17 20:41:24] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1344 cols
[2023-03-17 20:41:24] [INFO ] Computed 31 place invariants in 32 ms
[2023-03-17 20:41:26] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1344/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3158 ms. Remains : 1344/1992 places, 2741/3096 transitions.
Built C files in :
/tmp/ltsmin17825170643892142746
[2023-03-17 20:41:26] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17825170643892142746
Running compilation step : cd /tmp/ltsmin17825170643892142746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17825170643892142746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17825170643892142746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 123 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:41:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:41:29] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-17 20:41:30] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2023-03-17 20:41:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:41:30] [INFO ] Invariant cache hit.
[2023-03-17 20:41:32] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
[2023-03-17 20:41:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:41:32] [INFO ] Invariant cache hit.
[2023-03-17 20:41:36] [INFO ] Dead Transitions using invariants and state equation in 4251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7319 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin15040014795891264823
[2023-03-17 20:41:36] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15040014795891264823
Running compilation step : cd /tmp/ltsmin15040014795891264823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15040014795891264823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15040014795891264823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-17 20:41:40] [INFO ] Flatten gal took : 149 ms
[2023-03-17 20:41:40] [INFO ] Flatten gal took : 156 ms
[2023-03-17 20:41:40] [INFO ] Time to serialize gal into /tmp/LTL14048340952285416125.gal : 53 ms
[2023-03-17 20:41:40] [INFO ] Time to serialize properties into /tmp/LTL15375867568147193413.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14048340952285416125.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1052450774126407421.hoa' '-atoms' '/tmp/LTL15375867568147193413.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15375867568147193413.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1052450774126407421.hoa
Detected timeout of ITS tools.
[2023-03-17 20:41:55] [INFO ] Flatten gal took : 94 ms
[2023-03-17 20:41:55] [INFO ] Flatten gal took : 99 ms
[2023-03-17 20:41:55] [INFO ] Time to serialize gal into /tmp/LTL13407452509350521398.gal : 17 ms
[2023-03-17 20:41:55] [INFO ] Time to serialize properties into /tmp/LTL10880517045639673460.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13407452509350521398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10880517045639673460.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((WantSection_2_T==0)||(CS_2==0))")||(("(TestIdentity_3_3_5==0)")||(X(("(TestIdentity_3_3_5==0)")||(("(TestIdentity_3_3_5==1)")...206
Formula 0 simplified : F(!"((WantSection_2_T==0)||(CS_2==0))" & !"(TestIdentity_3_3_5==0)" & X(!"(TestIdentity_3_3_5==0)" & (!"(TestIdentity_3_3_5==1)" R !...199
Detected timeout of ITS tools.
[2023-03-17 20:42:10] [INFO ] Flatten gal took : 80 ms
[2023-03-17 20:42:10] [INFO ] Applying decomposition
[2023-03-17 20:42:11] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15498655733171386870.txt' '-o' '/tmp/graph15498655733171386870.bin' '-w' '/tmp/graph15498655733171386870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15498655733171386870.bin' '-l' '-1' '-v' '-w' '/tmp/graph15498655733171386870.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:42:11] [INFO ] Decomposing Gal with order
[2023-03-17 20:42:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:42:12] [INFO ] Removed a total of 2833 redundant transitions.
[2023-03-17 20:42:12] [INFO ] Flatten gal took : 301 ms
[2023-03-17 20:42:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2023-03-17 20:42:12] [INFO ] Time to serialize gal into /tmp/LTL4801009756116097802.gal : 41 ms
[2023-03-17 20:42:12] [INFO ] Time to serialize properties into /tmp/LTL13634857200871898058.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4801009756116097802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13634857200871898058.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i29.i2.i1.u591.WantSection_2_T==0)||(i18.i0.i1.u78.CS_2==0))")||(("(i9.u196.TestIdentity_3_3_5==0)")||(X(("(i9.u196.TestIdent...289
Formula 0 simplified : F(!"((i29.i2.i1.u591.WantSection_2_T==0)||(i18.i0.i1.u78.CS_2==0))" & !"(i9.u196.TestIdentity_3_3_5==0)" & X(!"(i9.u196.TestIdentity...282
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11879894737320473939
[2023-03-17 20:42:27] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11879894737320473939
Running compilation step : cd /tmp/ltsmin11879894737320473939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11879894737320473939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11879894737320473939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 Peterson-PT-7-LTLFireability-11 finished in 303536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 114 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:42:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:31] [INFO ] Invariant cache hit.
[2023-03-17 20:42:32] [INFO ] Implicit Places using invariants in 1459 ms returned []
[2023-03-17 20:42:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:32] [INFO ] Invariant cache hit.
[2023-03-17 20:42:33] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2023-03-17 20:42:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:33] [INFO ] Invariant cache hit.
[2023-03-17 20:42:37] [INFO ] Dead Transitions using invariants and state equation in 3172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6246 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1318 1) (EQ s1817 1)), p1:(OR (EQ s1453 1) (EQ s1614 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 explored 100000 steps with 0 reset in 449 ms.
Stack based approach found an accepted trace after 1190 steps with 0 reset with depth 1191 and stack size 1191 in 5 ms.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-12 finished in 6947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1))||(X(p3)&&p2))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 116 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:42:37] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:37] [INFO ] Invariant cache hit.
[2023-03-17 20:42:39] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-17 20:42:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:39] [INFO ] Invariant cache hit.
[2023-03-17 20:42:39] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2023-03-17 20:42:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:39] [INFO ] Invariant cache hit.
[2023-03-17 20:42:40] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2570 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1579 1) (EQ s1008 1) (EQ s1991 1)), p2:(AND (EQ s1006 1) (EQ s1989 1)), p3:(EQ s39 1), p1:(AND (EQ s1006 1) (EQ s1989 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 2805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1))||G(p2))))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 159 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:42:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:40] [INFO ] Invariant cache hit.
[2023-03-17 20:42:42] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2023-03-17 20:42:42] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:42] [INFO ] Invariant cache hit.
[2023-03-17 20:42:43] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
[2023-03-17 20:42:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:43] [INFO ] Invariant cache hit.
[2023-03-17 20:42:47] [INFO ] Dead Transitions using invariants and state equation in 3137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6471 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1020 1) (EQ s1979 1)), p2:(EQ s314 0), p1:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 418 reset in 428 ms.
Product exploration explored 100000 steps with 402 reset in 500 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:42:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:42:48] [INFO ] Invariant cache hit.
[2023-03-17 20:42:49] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:42:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-17 20:42:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-17 20:42:51] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:42:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:42:51] [INFO ] After 238ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:42:54] [INFO ] Deduced a trap composed of 20 places in 2352 ms of which 2 ms to minimize.
[2023-03-17 20:42:56] [INFO ] Deduced a trap composed of 66 places in 1959 ms of which 2 ms to minimize.
[2023-03-17 20:42:58] [INFO ] Deduced a trap composed of 66 places in 2280 ms of which 3 ms to minimize.
[2023-03-17 20:43:00] [INFO ] Deduced a trap composed of 55 places in 2220 ms of which 2 ms to minimize.
[2023-03-17 20:43:03] [INFO ] Deduced a trap composed of 13 places in 2273 ms of which 2 ms to minimize.
[2023-03-17 20:43:06] [INFO ] Deduced a trap composed of 21 places in 2538 ms of which 2 ms to minimize.
[2023-03-17 20:43:08] [INFO ] Deduced a trap composed of 140 places in 1668 ms of which 2 ms to minimize.
[2023-03-17 20:43:11] [INFO ] Deduced a trap composed of 168 places in 2474 ms of which 3 ms to minimize.
[2023-03-17 20:43:13] [INFO ] Deduced a trap composed of 100 places in 2487 ms of which 3 ms to minimize.
[2023-03-17 20:43:16] [INFO ] Deduced a trap composed of 88 places in 2063 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:43:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:43:16] [INFO ] After 26936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 2 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 281 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 465426 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465426 steps, saw 63963 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:43:19] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-17 20:43:19] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-17 20:43:19] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:43:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-17 20:43:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:43:20] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:43:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:43:20] [INFO ] After 224ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:43:21] [INFO ] Deduced a trap composed of 24 places in 684 ms of which 3 ms to minimize.
[2023-03-17 20:43:22] [INFO ] Deduced a trap composed of 15 places in 556 ms of which 0 ms to minimize.
[2023-03-17 20:43:22] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2023-03-17 20:43:23] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 1 ms to minimize.
[2023-03-17 20:43:23] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
[2023-03-17 20:43:24] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 1 ms to minimize.
[2023-03-17 20:43:24] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 2 ms to minimize.
[2023-03-17 20:43:25] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 0 ms to minimize.
[2023-03-17 20:43:25] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 1 ms to minimize.
[2023-03-17 20:43:26] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 1 ms to minimize.
[2023-03-17 20:43:26] [INFO ] Deduced a trap composed of 22 places in 562 ms of which 1 ms to minimize.
[2023-03-17 20:43:27] [INFO ] Deduced a trap composed of 25 places in 700 ms of which 2 ms to minimize.
[2023-03-17 20:43:28] [INFO ] Deduced a trap composed of 24 places in 687 ms of which 1 ms to minimize.
[2023-03-17 20:43:29] [INFO ] Deduced a trap composed of 21 places in 705 ms of which 1 ms to minimize.
[2023-03-17 20:43:29] [INFO ] Deduced a trap composed of 34 places in 621 ms of which 1 ms to minimize.
[2023-03-17 20:43:30] [INFO ] Deduced a trap composed of 22 places in 699 ms of which 1 ms to minimize.
[2023-03-17 20:43:31] [INFO ] Deduced a trap composed of 11 places in 672 ms of which 1 ms to minimize.
[2023-03-17 20:43:32] [INFO ] Deduced a trap composed of 52 places in 593 ms of which 2 ms to minimize.
[2023-03-17 20:43:32] [INFO ] Deduced a trap composed of 61 places in 518 ms of which 1 ms to minimize.
[2023-03-17 20:43:33] [INFO ] Deduced a trap composed of 83 places in 576 ms of which 1 ms to minimize.
[2023-03-17 20:43:34] [INFO ] Deduced a trap composed of 31 places in 546 ms of which 1 ms to minimize.
[2023-03-17 20:43:34] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 1 ms to minimize.
[2023-03-17 20:43:35] [INFO ] Deduced a trap composed of 42 places in 481 ms of which 0 ms to minimize.
[2023-03-17 20:43:35] [INFO ] Deduced a trap composed of 51 places in 499 ms of which 1 ms to minimize.
[2023-03-17 20:43:36] [INFO ] Deduced a trap composed of 42 places in 458 ms of which 1 ms to minimize.
[2023-03-17 20:43:37] [INFO ] Deduced a trap composed of 13 places in 664 ms of which 1 ms to minimize.
[2023-03-17 20:43:37] [INFO ] Deduced a trap composed of 51 places in 646 ms of which 1 ms to minimize.
[2023-03-17 20:43:38] [INFO ] Deduced a trap composed of 12 places in 579 ms of which 1 ms to minimize.
[2023-03-17 20:43:39] [INFO ] Deduced a trap composed of 63 places in 577 ms of which 1 ms to minimize.
[2023-03-17 20:43:39] [INFO ] Deduced a trap composed of 52 places in 561 ms of which 1 ms to minimize.
[2023-03-17 20:43:40] [INFO ] Deduced a trap composed of 51 places in 559 ms of which 0 ms to minimize.
[2023-03-17 20:43:41] [INFO ] Deduced a trap composed of 20 places in 543 ms of which 14 ms to minimize.
[2023-03-17 20:43:41] [INFO ] Deduced a trap composed of 11 places in 619 ms of which 1 ms to minimize.
[2023-03-17 20:43:42] [INFO ] Deduced a trap composed of 24 places in 527 ms of which 2 ms to minimize.
[2023-03-17 20:43:43] [INFO ] Deduced a trap composed of 38 places in 478 ms of which 1 ms to minimize.
[2023-03-17 20:43:43] [INFO ] Deduced a trap composed of 42 places in 578 ms of which 1 ms to minimize.
[2023-03-17 20:43:44] [INFO ] Deduced a trap composed of 51 places in 461 ms of which 1 ms to minimize.
[2023-03-17 20:43:44] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:43:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:43:44] [INFO ] After 25265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 50 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 57 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:43:44] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:43:44] [INFO ] Invariant cache hit.
[2023-03-17 20:43:46] [INFO ] Implicit Places using invariants in 1275 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1278 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1374 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425151 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425151 steps, saw 63558 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:43:49] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-17 20:43:49] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-17 20:43:49] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:43:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:43:49] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:43:50] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:43:50] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:43:50] [INFO ] After 222ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:43:51] [INFO ] Deduced a trap composed of 13 places in 616 ms of which 1 ms to minimize.
[2023-03-17 20:43:52] [INFO ] Deduced a trap composed of 12 places in 624 ms of which 1 ms to minimize.
[2023-03-17 20:43:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1486 ms
[2023-03-17 20:43:52] [INFO ] After 1785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-17 20:43:52] [INFO ] After 2852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 51 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 47 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:43:52] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:43:52] [INFO ] Invariant cache hit.
[2023-03-17 20:43:53] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-17 20:43:53] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:43:53] [INFO ] Invariant cache hit.
[2023-03-17 20:43:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:43:59] [INFO ] Implicit Places using invariants and state equation in 5841 ms returned []
Implicit Place search using SMT with State Equation took 6941 ms to find 0 implicit places.
[2023-03-17 20:43:59] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 20:43:59] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:43:59] [INFO ] Invariant cache hit.
[2023-03-17 20:44:01] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8572 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 34 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-17 20:44:01] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 20:44:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:44:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 20:44:01] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:44:01] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:44:01] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 20:44:01] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 265 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 123 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:44:01] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:44:02] [INFO ] Computed 31 place invariants in 25 ms
[2023-03-17 20:44:03] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-17 20:44:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:44:03] [INFO ] Invariant cache hit.
[2023-03-17 20:44:04] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2023-03-17 20:44:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:44:04] [INFO ] Invariant cache hit.
[2023-03-17 20:44:08] [INFO ] Dead Transitions using invariants and state equation in 4057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6859 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:44:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:44:09] [INFO ] Invariant cache hit.
[2023-03-17 20:44:09] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:44:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-17 20:44:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 20:44:12] [INFO ] After 1881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:44:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:44:12] [INFO ] After 380ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:44:15] [INFO ] Deduced a trap composed of 20 places in 1982 ms of which 2 ms to minimize.
[2023-03-17 20:44:17] [INFO ] Deduced a trap composed of 66 places in 2201 ms of which 2 ms to minimize.
[2023-03-17 20:44:20] [INFO ] Deduced a trap composed of 66 places in 2516 ms of which 3 ms to minimize.
[2023-03-17 20:44:23] [INFO ] Deduced a trap composed of 55 places in 2798 ms of which 3 ms to minimize.
[2023-03-17 20:44:26] [INFO ] Deduced a trap composed of 13 places in 2729 ms of which 3 ms to minimize.
[2023-03-17 20:44:29] [INFO ] Deduced a trap composed of 21 places in 2605 ms of which 8 ms to minimize.
[2023-03-17 20:44:31] [INFO ] Deduced a trap composed of 140 places in 2344 ms of which 3 ms to minimize.
[2023-03-17 20:44:34] [INFO ] Deduced a trap composed of 168 places in 1803 ms of which 3 ms to minimize.
[2023-03-17 20:44:36] [INFO ] Deduced a trap composed of 100 places in 2011 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:44:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:44:36] [INFO ] After 26306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 146 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 490932 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 490932 steps, saw 70159 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:44:39] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-17 20:44:39] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-17 20:44:39] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:44:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-17 20:44:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-17 20:44:40] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:44:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:44:40] [INFO ] After 194ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:44:41] [INFO ] Deduced a trap composed of 24 places in 678 ms of which 1 ms to minimize.
[2023-03-17 20:44:42] [INFO ] Deduced a trap composed of 15 places in 733 ms of which 2 ms to minimize.
[2023-03-17 20:44:43] [INFO ] Deduced a trap composed of 12 places in 727 ms of which 2 ms to minimize.
[2023-03-17 20:44:43] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 1 ms to minimize.
[2023-03-17 20:44:44] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 2 ms to minimize.
[2023-03-17 20:44:45] [INFO ] Deduced a trap composed of 33 places in 517 ms of which 1 ms to minimize.
[2023-03-17 20:44:45] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 0 ms to minimize.
[2023-03-17 20:44:46] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2023-03-17 20:44:46] [INFO ] Deduced a trap composed of 20 places in 640 ms of which 1 ms to minimize.
[2023-03-17 20:44:47] [INFO ] Deduced a trap composed of 20 places in 591 ms of which 2 ms to minimize.
[2023-03-17 20:44:48] [INFO ] Deduced a trap composed of 22 places in 611 ms of which 1 ms to minimize.
[2023-03-17 20:44:48] [INFO ] Deduced a trap composed of 25 places in 682 ms of which 1 ms to minimize.
[2023-03-17 20:44:49] [INFO ] Deduced a trap composed of 24 places in 674 ms of which 1 ms to minimize.
[2023-03-17 20:44:50] [INFO ] Deduced a trap composed of 21 places in 565 ms of which 1 ms to minimize.
[2023-03-17 20:44:51] [INFO ] Deduced a trap composed of 34 places in 482 ms of which 2 ms to minimize.
[2023-03-17 20:44:51] [INFO ] Deduced a trap composed of 22 places in 570 ms of which 1 ms to minimize.
[2023-03-17 20:44:52] [INFO ] Deduced a trap composed of 11 places in 610 ms of which 1 ms to minimize.
[2023-03-17 20:44:53] [INFO ] Deduced a trap composed of 52 places in 597 ms of which 1 ms to minimize.
[2023-03-17 20:44:53] [INFO ] Deduced a trap composed of 61 places in 598 ms of which 1 ms to minimize.
[2023-03-17 20:44:54] [INFO ] Deduced a trap composed of 83 places in 538 ms of which 1 ms to minimize.
[2023-03-17 20:44:55] [INFO ] Deduced a trap composed of 31 places in 560 ms of which 1 ms to minimize.
[2023-03-17 20:44:55] [INFO ] Deduced a trap composed of 43 places in 583 ms of which 1 ms to minimize.
[2023-03-17 20:44:56] [INFO ] Deduced a trap composed of 42 places in 589 ms of which 1 ms to minimize.
[2023-03-17 20:44:57] [INFO ] Deduced a trap composed of 51 places in 604 ms of which 1 ms to minimize.
[2023-03-17 20:44:57] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:44:58] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 0 ms to minimize.
[2023-03-17 20:44:59] [INFO ] Deduced a trap composed of 51 places in 373 ms of which 1 ms to minimize.
[2023-03-17 20:44:59] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 1 ms to minimize.
[2023-03-17 20:45:00] [INFO ] Deduced a trap composed of 63 places in 530 ms of which 1 ms to minimize.
[2023-03-17 20:45:00] [INFO ] Deduced a trap composed of 52 places in 587 ms of which 1 ms to minimize.
[2023-03-17 20:45:01] [INFO ] Deduced a trap composed of 51 places in 584 ms of which 2 ms to minimize.
[2023-03-17 20:45:02] [INFO ] Deduced a trap composed of 20 places in 499 ms of which 1 ms to minimize.
[2023-03-17 20:45:02] [INFO ] Deduced a trap composed of 11 places in 654 ms of which 1 ms to minimize.
[2023-03-17 20:45:03] [INFO ] Deduced a trap composed of 24 places in 553 ms of which 1 ms to minimize.
[2023-03-17 20:45:04] [INFO ] Deduced a trap composed of 38 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:45:04] [INFO ] Deduced a trap composed of 42 places in 537 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:45:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:45:04] [INFO ] After 25268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 47 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:45:05] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:45:05] [INFO ] Invariant cache hit.
[2023-03-17 20:45:05] [INFO ] Implicit Places using invariants in 869 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 871 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 32 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 948 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 549441 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549441 steps, saw 79463 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:45:09] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-17 20:45:09] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-17 20:45:09] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:45:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-17 20:45:09] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:45:10] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:45:10] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:45:10] [INFO ] After 171ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:45:10] [INFO ] Deduced a trap composed of 13 places in 496 ms of which 1 ms to minimize.
[2023-03-17 20:45:11] [INFO ] Deduced a trap composed of 12 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:45:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1139 ms
[2023-03-17 20:45:11] [INFO ] After 1357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-17 20:45:11] [INFO ] After 2258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:45:11] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:45:11] [INFO ] Invariant cache hit.
[2023-03-17 20:45:12] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-17 20:45:12] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:45:12] [INFO ] Invariant cache hit.
[2023-03-17 20:45:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:45:17] [INFO ] Implicit Places using invariants and state equation in 4926 ms returned []
Implicit Place search using SMT with State Equation took 5604 ms to find 0 implicit places.
[2023-03-17 20:45:17] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-17 20:45:17] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:45:17] [INFO ] Invariant cache hit.
[2023-03-17 20:45:18] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7037 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 21 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-17 20:45:18] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-17 20:45:18] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:45:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 20:45:18] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:45:18] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:45:18] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 20:45:18] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 266 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 378 reset in 507 ms.
Product exploration explored 100000 steps with 399 reset in 369 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 504 place count 1992 transition count 3390
Deduced a syphon composed of 903 places in 3 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 903 place count 1992 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1106 place count 1789 transition count 3187
Deduced a syphon composed of 700 places in 3 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1309 place count 1789 transition count 3187
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1194 places in 3 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1803 place count 1789 transition count 3187
Discarding 446 places :
Symmetric choice reduction at 1 with 446 rule applications. Total rules 2249 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Iterating global reduction 1 with 446 rules applied. Total rules applied 2695 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2695 rules in 691 ms. Remains 1343 /1992 variables (removed 649) and now considering 2741/3096 (removed 355) transitions.
[2023-03-17 20:45:21] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-17 20:45:21] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1343 cols
[2023-03-17 20:45:21] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-17 20:45:24] [INFO ] Dead Transitions using invariants and state equation in 3196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4011 ms. Remains : 1343/1992 places, 2741/3096 transitions.
Built C files in :
/tmp/ltsmin2736558984948520124
[2023-03-17 20:45:24] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2736558984948520124
Running compilation step : cd /tmp/ltsmin2736558984948520124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2736558984948520124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2736558984948520124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 137 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-17 20:45:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-17 20:45:28] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-17 20:45:29] [INFO ] Implicit Places using invariants in 1553 ms returned []
[2023-03-17 20:45:29] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:45:29] [INFO ] Invariant cache hit.
[2023-03-17 20:45:31] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
[2023-03-17 20:45:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-17 20:45:31] [INFO ] Invariant cache hit.
[2023-03-17 20:45:31] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3826 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Built C files in :
/tmp/ltsmin990408068583682164
[2023-03-17 20:45:31] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin990408068583682164
Running compilation step : cd /tmp/ltsmin990408068583682164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin990408068583682164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin990408068583682164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-17 20:45:34] [INFO ] Flatten gal took : 94 ms
[2023-03-17 20:45:35] [INFO ] Flatten gal took : 90 ms
[2023-03-17 20:45:35] [INFO ] Time to serialize gal into /tmp/LTL4666277018906535261.gal : 22 ms
[2023-03-17 20:45:35] [INFO ] Time to serialize properties into /tmp/LTL6790926009694978376.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4666277018906535261.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13989029730700305132.hoa' '-atoms' '/tmp/LTL6790926009694978376.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6790926009694978376.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13989029730700305132.hoa
Detected timeout of ITS tools.
[2023-03-17 20:45:50] [INFO ] Flatten gal took : 124 ms
[2023-03-17 20:45:50] [INFO ] Flatten gal took : 129 ms
[2023-03-17 20:45:50] [INFO ] Time to serialize gal into /tmp/LTL6329531309624181879.gal : 47 ms
[2023-03-17 20:45:50] [INFO ] Time to serialize properties into /tmp/LTL17923521015313521218.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6329531309624181879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17923521015313521218.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G(F("(EndTurn_5_6==1)")))||(G("(IsEndLoop_2_2_5==0)")))||("((WantSection_1_F==1)&&(Idle_1==1))"))))))
Formula 0 simplified : XXG(!"((WantSection_1_F==1)&&(Idle_1==1))" & FG!"(EndTurn_5_6==1)" & F!"(IsEndLoop_2_2_5==0)")
Detected timeout of ITS tools.
[2023-03-17 20:46:05] [INFO ] Flatten gal took : 115 ms
[2023-03-17 20:46:05] [INFO ] Applying decomposition
[2023-03-17 20:46:05] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1443807390063617082.txt' '-o' '/tmp/graph1443807390063617082.bin' '-w' '/tmp/graph1443807390063617082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1443807390063617082.bin' '-l' '-1' '-v' '-w' '/tmp/graph1443807390063617082.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:46:06] [INFO ] Decomposing Gal with order
[2023-03-17 20:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:46:06] [INFO ] Removed a total of 2834 redundant transitions.
[2023-03-17 20:46:06] [INFO ] Flatten gal took : 166 ms
[2023-03-17 20:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2023-03-17 20:46:06] [INFO ] Time to serialize gal into /tmp/LTL11449448190882936639.gal : 33 ms
[2023-03-17 20:46:06] [INFO ] Time to serialize properties into /tmp/LTL13266947188776105435.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11449448190882936639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13266947188776105435.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G(F("(i13.u580.EndTurn_5_6==1)")))||(G("(i14.u119.IsEndLoop_2_2_5==0)")))||("((i22.i0.i0.i2.u211.WantSection_1_F==1)&&(i13....178
Formula 0 simplified : XXG(!"((i22.i0.i0.i2.u211.WantSection_1_F==1)&&(i13.u760.Idle_1==1))" & FG!"(i13.u580.EndTurn_5_6==1)" & F!"(i14.u119.IsEndLoop_2_2_...162
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10264913020492362690
[2023-03-17 20:46:21] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10264913020492362690
Running compilation step : cd /tmp/ltsmin10264913020492362690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10264913020492362690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10264913020492362690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 Peterson-PT-7-LTLFireability-14 finished in 224380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 149 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2023-03-17 20:46:25] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2023-03-17 20:46:25] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-17 20:46:26] [INFO ] Implicit Places using invariants in 1096 ms returned [576, 577, 578, 579, 580, 590, 591]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 44 ms. Remains 585 /585 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1292 ms. Remains : 585/1992 places, 1696/3096 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s453 1) (EQ s584 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 436 ms.
Stack based approach found an accepted trace after 821 steps with 0 reset with depth 822 and stack size 701 in 4 ms.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 1818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p1||(p2 U p3)))||p0)))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLFireability-11
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 214 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2023-03-17 20:46:27] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-17 20:46:27] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-17 20:46:28] [INFO ] Implicit Places using invariants in 915 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 916 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1700/3096 transitions.
Applied a total of 0 rules in 31 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1161 ms. Remains : 588/1992 places, 1700/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s449 0) (EQ s575 0) (EQ s521 0)), p1:(EQ s521 0), p3:(AND (EQ s555 1) (EQ s576 1)), p2:(EQ s521 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 20:46:29] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-17 20:46:29] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 20:46:30] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-17 20:46:30] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-17 20:46:30] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-17 20:46:31] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-17 20:46:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:46:31] [INFO ] After 418ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-17 20:46:32] [INFO ] Deduced a trap composed of 48 places in 573 ms of which 2 ms to minimize.
[2023-03-17 20:46:32] [INFO ] Deduced a trap composed of 23 places in 546 ms of which 1 ms to minimize.
[2023-03-17 20:46:33] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 1 ms to minimize.
[2023-03-17 20:46:34] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 1 ms to minimize.
[2023-03-17 20:46:34] [INFO ] Deduced a trap composed of 31 places in 620 ms of which 1 ms to minimize.
[2023-03-17 20:46:35] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 1 ms to minimize.
[2023-03-17 20:46:36] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 1 ms to minimize.
[2023-03-17 20:46:36] [INFO ] Deduced a trap composed of 57 places in 611 ms of which 1 ms to minimize.
[2023-03-17 20:46:37] [INFO ] Deduced a trap composed of 45 places in 657 ms of which 1 ms to minimize.
[2023-03-17 20:46:38] [INFO ] Deduced a trap composed of 56 places in 626 ms of which 1 ms to minimize.
[2023-03-17 20:46:38] [INFO ] Deduced a trap composed of 39 places in 639 ms of which 1 ms to minimize.
[2023-03-17 20:46:39] [INFO ] Deduced a trap composed of 14 places in 533 ms of which 1 ms to minimize.
[2023-03-17 20:46:40] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 0 ms to minimize.
[2023-03-17 20:46:40] [INFO ] Deduced a trap composed of 14 places in 529 ms of which 1 ms to minimize.
[2023-03-17 20:46:41] [INFO ] Deduced a trap composed of 14 places in 450 ms of which 0 ms to minimize.
[2023-03-17 20:46:41] [INFO ] Deduced a trap composed of 13 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:46:42] [INFO ] Deduced a trap composed of 22 places in 612 ms of which 1 ms to minimize.
[2023-03-17 20:46:43] [INFO ] Deduced a trap composed of 41 places in 537 ms of which 0 ms to minimize.
[2023-03-17 20:46:43] [INFO ] Deduced a trap composed of 31 places in 619 ms of which 1 ms to minimize.
[2023-03-17 20:46:44] [INFO ] Deduced a trap composed of 80 places in 583 ms of which 1 ms to minimize.
[2023-03-17 20:46:45] [INFO ] Deduced a trap composed of 40 places in 564 ms of which 1 ms to minimize.
[2023-03-17 20:46:45] [INFO ] Deduced a trap composed of 24 places in 606 ms of which 1 ms to minimize.
[2023-03-17 20:46:46] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2023-03-17 20:46:46] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 2 ms to minimize.
[2023-03-17 20:46:47] [INFO ] Deduced a trap composed of 41 places in 579 ms of which 1 ms to minimize.
[2023-03-17 20:46:48] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 1 ms to minimize.
[2023-03-17 20:46:48] [INFO ] Deduced a trap composed of 25 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:46:49] [INFO ] Deduced a trap composed of 12 places in 725 ms of which 1 ms to minimize.
[2023-03-17 20:46:50] [INFO ] Deduced a trap composed of 22 places in 620 ms of which 1 ms to minimize.
[2023-03-17 20:46:51] [INFO ] Deduced a trap composed of 55 places in 512 ms of which 1 ms to minimize.
[2023-03-17 20:46:51] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 1 ms to minimize.
[2023-03-17 20:46:52] [INFO ] Deduced a trap composed of 39 places in 535 ms of which 2 ms to minimize.
[2023-03-17 20:46:53] [INFO ] Deduced a trap composed of 64 places in 469 ms of which 1 ms to minimize.
[2023-03-17 20:46:53] [INFO ] Deduced a trap composed of 65 places in 433 ms of which 1 ms to minimize.
[2023-03-17 20:46:54] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 1 ms to minimize.
[2023-03-17 20:46:54] [INFO ] Deduced a trap composed of 66 places in 483 ms of which 1 ms to minimize.
[2023-03-17 20:46:55] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 2 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-17 20:46:56] [INFO ] Deduced a trap composed of 2 places in 853 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:46:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:46:56] [INFO ] After 25872ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 46 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 337320 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337320 steps, saw 57377 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:46:59] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:46:59] [INFO ] Invariant cache hit.
[2023-03-17 20:46:59] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-17 20:47:00] [INFO ] After 628ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-17 20:47:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:47:00] [INFO ] After 132ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:47:00] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:47:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-17 20:47:01] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:47:01] [INFO ] After 251ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:47:02] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 1 ms to minimize.
[2023-03-17 20:47:03] [INFO ] Deduced a trap composed of 30 places in 687 ms of which 2 ms to minimize.
[2023-03-17 20:47:04] [INFO ] Deduced a trap composed of 13 places in 655 ms of which 1 ms to minimize.
[2023-03-17 20:47:04] [INFO ] Deduced a trap composed of 14 places in 639 ms of which 1 ms to minimize.
[2023-03-17 20:47:05] [INFO ] Deduced a trap composed of 40 places in 618 ms of which 1 ms to minimize.
[2023-03-17 20:47:06] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 1 ms to minimize.
[2023-03-17 20:47:07] [INFO ] Deduced a trap composed of 20 places in 656 ms of which 5 ms to minimize.
[2023-03-17 20:47:07] [INFO ] Deduced a trap composed of 14 places in 648 ms of which 1 ms to minimize.
[2023-03-17 20:47:08] [INFO ] Deduced a trap composed of 44 places in 597 ms of which 1 ms to minimize.
[2023-03-17 20:47:08] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 1 ms to minimize.
[2023-03-17 20:47:09] [INFO ] Deduced a trap composed of 25 places in 640 ms of which 1 ms to minimize.
[2023-03-17 20:47:10] [INFO ] Deduced a trap composed of 13 places in 589 ms of which 1 ms to minimize.
[2023-03-17 20:47:10] [INFO ] Deduced a trap composed of 22 places in 364 ms of which 0 ms to minimize.
[2023-03-17 20:47:11] [INFO ] Deduced a trap composed of 24 places in 516 ms of which 1 ms to minimize.
[2023-03-17 20:47:12] [INFO ] Deduced a trap composed of 15 places in 555 ms of which 1 ms to minimize.
[2023-03-17 20:47:12] [INFO ] Deduced a trap composed of 22 places in 496 ms of which 1 ms to minimize.
[2023-03-17 20:47:13] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 1 ms to minimize.
[2023-03-17 20:47:13] [INFO ] Deduced a trap composed of 32 places in 462 ms of which 1 ms to minimize.
[2023-03-17 20:47:14] [INFO ] Deduced a trap composed of 41 places in 483 ms of which 1 ms to minimize.
[2023-03-17 20:47:15] [INFO ] Deduced a trap composed of 11 places in 621 ms of which 1 ms to minimize.
[2023-03-17 20:47:16] [INFO ] Deduced a trap composed of 12 places in 616 ms of which 1 ms to minimize.
[2023-03-17 20:47:16] [INFO ] Deduced a trap composed of 40 places in 696 ms of which 1 ms to minimize.
[2023-03-17 20:47:17] [INFO ] Deduced a trap composed of 25 places in 664 ms of which 1 ms to minimize.
[2023-03-17 20:47:18] [INFO ] Deduced a trap composed of 35 places in 519 ms of which 1 ms to minimize.
[2023-03-17 20:47:18] [INFO ] Deduced a trap composed of 23 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:47:19] [INFO ] Deduced a trap composed of 40 places in 574 ms of which 1 ms to minimize.
[2023-03-17 20:47:20] [INFO ] Deduced a trap composed of 55 places in 364 ms of which 0 ms to minimize.
[2023-03-17 20:47:20] [INFO ] Deduced a trap composed of 19 places in 586 ms of which 1 ms to minimize.
[2023-03-17 20:47:21] [INFO ] Deduced a trap composed of 65 places in 412 ms of which 1 ms to minimize.
[2023-03-17 20:47:21] [INFO ] Deduced a trap composed of 48 places in 500 ms of which 1 ms to minimize.
[2023-03-17 20:47:22] [INFO ] Deduced a trap composed of 58 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:47:22] [INFO ] Deduced a trap composed of 77 places in 466 ms of which 1 ms to minimize.
[2023-03-17 20:47:23] [INFO ] Deduced a trap composed of 67 places in 440 ms of which 1 ms to minimize.
[2023-03-17 20:47:23] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:47:24] [INFO ] Deduced a trap composed of 64 places in 487 ms of which 1 ms to minimize.
[2023-03-17 20:47:25] [INFO ] Deduced a trap composed of 12 places in 546 ms of which 1 ms to minimize.
[2023-03-17 20:47:25] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:47:25] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 23813 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:47:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:47:25] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 35 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 37 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:47:25] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:25] [INFO ] Invariant cache hit.
[2023-03-17 20:47:26] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2023-03-17 20:47:26] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:26] [INFO ] Invariant cache hit.
[2023-03-17 20:47:27] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:47:31] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 5823 ms to find 0 implicit places.
[2023-03-17 20:47:31] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-17 20:47:31] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:31] [INFO ] Invariant cache hit.
[2023-03-17 20:47:33] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7818 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 22 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-17 20:47:33] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-17 20:47:33] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-17 20:47:33] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:47:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-17 20:47:33] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:47:33] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-17 20:47:33] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 521 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:47:34] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-17 20:47:34] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 20:47:35] [INFO ] Implicit Places using invariants in 945 ms returned []
[2023-03-17 20:47:35] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:35] [INFO ] Invariant cache hit.
[2023-03-17 20:47:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:47:40] [INFO ] Implicit Places using invariants and state equation in 5058 ms returned []
Implicit Place search using SMT with State Equation took 6015 ms to find 0 implicit places.
[2023-03-17 20:47:40] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:40] [INFO ] Invariant cache hit.
[2023-03-17 20:47:42] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7784 ms. Remains : 588/588 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:47:43] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:47:43] [INFO ] Invariant cache hit.
[2023-03-17 20:47:43] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2023-03-17 20:47:44] [INFO ] After 612ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-17 20:47:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:47:44] [INFO ] After 103ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:47:44] [INFO ] After 977ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:47:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-17 20:47:45] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:47:45] [INFO ] After 223ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:47:45] [INFO ] Deduced a trap composed of 31 places in 511 ms of which 1 ms to minimize.
[2023-03-17 20:47:46] [INFO ] Deduced a trap composed of 30 places in 428 ms of which 1 ms to minimize.
[2023-03-17 20:47:46] [INFO ] Deduced a trap composed of 13 places in 561 ms of which 1 ms to minimize.
[2023-03-17 20:47:47] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 1 ms to minimize.
[2023-03-17 20:47:48] [INFO ] Deduced a trap composed of 40 places in 541 ms of which 1 ms to minimize.
[2023-03-17 20:47:48] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2023-03-17 20:47:49] [INFO ] Deduced a trap composed of 20 places in 546 ms of which 1 ms to minimize.
[2023-03-17 20:47:49] [INFO ] Deduced a trap composed of 14 places in 370 ms of which 1 ms to minimize.
[2023-03-17 20:47:50] [INFO ] Deduced a trap composed of 44 places in 525 ms of which 1 ms to minimize.
[2023-03-17 20:47:50] [INFO ] Deduced a trap composed of 22 places in 400 ms of which 1 ms to minimize.
[2023-03-17 20:47:51] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 1 ms to minimize.
[2023-03-17 20:47:51] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 1 ms to minimize.
[2023-03-17 20:47:52] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 1 ms to minimize.
[2023-03-17 20:47:52] [INFO ] Deduced a trap composed of 24 places in 512 ms of which 1 ms to minimize.
[2023-03-17 20:47:53] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 0 ms to minimize.
[2023-03-17 20:47:53] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 1 ms to minimize.
[2023-03-17 20:47:54] [INFO ] Deduced a trap composed of 13 places in 525 ms of which 1 ms to minimize.
[2023-03-17 20:47:54] [INFO ] Deduced a trap composed of 32 places in 495 ms of which 1 ms to minimize.
[2023-03-17 20:47:55] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 0 ms to minimize.
[2023-03-17 20:47:55] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 1 ms to minimize.
[2023-03-17 20:47:56] [INFO ] Deduced a trap composed of 12 places in 668 ms of which 1 ms to minimize.
[2023-03-17 20:47:57] [INFO ] Deduced a trap composed of 40 places in 530 ms of which 1 ms to minimize.
[2023-03-17 20:47:57] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2023-03-17 20:47:58] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 1 ms to minimize.
[2023-03-17 20:47:58] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 0 ms to minimize.
[2023-03-17 20:47:59] [INFO ] Deduced a trap composed of 40 places in 461 ms of which 1 ms to minimize.
[2023-03-17 20:47:59] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 1 ms to minimize.
[2023-03-17 20:47:59] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 1 ms to minimize.
[2023-03-17 20:48:00] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 1 ms to minimize.
[2023-03-17 20:48:00] [INFO ] Deduced a trap composed of 48 places in 331 ms of which 1 ms to minimize.
[2023-03-17 20:48:01] [INFO ] Deduced a trap composed of 58 places in 336 ms of which 1 ms to minimize.
[2023-03-17 20:48:01] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 1 ms to minimize.
[2023-03-17 20:48:02] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 1 ms to minimize.
[2023-03-17 20:48:02] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2023-03-17 20:48:03] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 1 ms to minimize.
[2023-03-17 20:48:03] [INFO ] Deduced a trap composed of 12 places in 433 ms of which 1 ms to minimize.
[2023-03-17 20:48:03] [INFO ] Deduced a trap composed of 58 places in 332 ms of which 1 ms to minimize.
[2023-03-17 20:48:04] [INFO ] Deduced a trap composed of 57 places in 499 ms of which 1 ms to minimize.
[2023-03-17 20:48:05] [INFO ] Deduced a trap composed of 40 places in 415 ms of which 1 ms to minimize.
[2023-03-17 20:48:05] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 0 ms to minimize.
[2023-03-17 20:48:06] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2023-03-17 20:48:06] [INFO ] Deduced a trap composed of 24 places in 478 ms of which 1 ms to minimize.
[2023-03-17 20:48:07] [INFO ] Deduced a trap composed of 30 places in 559 ms of which 1 ms to minimize.
[2023-03-17 20:48:08] [INFO ] Deduced a trap composed of 48 places in 437 ms of which 1 ms to minimize.
[2023-03-17 20:48:08] [INFO ] Deduced a trap composed of 55 places in 365 ms of which 1 ms to minimize.
[2023-03-17 20:48:09] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 0 ms to minimize.
[2023-03-17 20:48:09] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 24004 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:48:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:48:09] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 47 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 407493 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407493 steps, saw 62909 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-17 20:48:12] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:12] [INFO ] Invariant cache hit.
[2023-03-17 20:48:12] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-17 20:48:13] [INFO ] After 429ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-17 20:48:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:48:13] [INFO ] After 103ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:48:13] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:48:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-17 20:48:14] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:48:14] [INFO ] After 208ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 20:48:14] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 0 ms to minimize.
[2023-03-17 20:48:15] [INFO ] Deduced a trap composed of 30 places in 374 ms of which 1 ms to minimize.
[2023-03-17 20:48:15] [INFO ] Deduced a trap composed of 13 places in 609 ms of which 1 ms to minimize.
[2023-03-17 20:48:16] [INFO ] Deduced a trap composed of 14 places in 694 ms of which 2 ms to minimize.
[2023-03-17 20:48:17] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 1 ms to minimize.
[2023-03-17 20:48:17] [INFO ] Deduced a trap composed of 31 places in 363 ms of which 1 ms to minimize.
[2023-03-17 20:48:18] [INFO ] Deduced a trap composed of 20 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:48:18] [INFO ] Deduced a trap composed of 14 places in 513 ms of which 1 ms to minimize.
[2023-03-17 20:48:19] [INFO ] Deduced a trap composed of 44 places in 605 ms of which 1 ms to minimize.
[2023-03-17 20:48:19] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:48:20] [INFO ] Deduced a trap composed of 25 places in 650 ms of which 1 ms to minimize.
[2023-03-17 20:48:21] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 1 ms to minimize.
[2023-03-17 20:48:21] [INFO ] Deduced a trap composed of 22 places in 523 ms of which 1 ms to minimize.
[2023-03-17 20:48:22] [INFO ] Deduced a trap composed of 24 places in 655 ms of which 1 ms to minimize.
[2023-03-17 20:48:23] [INFO ] Deduced a trap composed of 15 places in 688 ms of which 1 ms to minimize.
[2023-03-17 20:48:23] [INFO ] Deduced a trap composed of 22 places in 638 ms of which 1 ms to minimize.
[2023-03-17 20:48:24] [INFO ] Deduced a trap composed of 13 places in 642 ms of which 1 ms to minimize.
[2023-03-17 20:48:25] [INFO ] Deduced a trap composed of 32 places in 591 ms of which 2 ms to minimize.
[2023-03-17 20:48:25] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 1 ms to minimize.
[2023-03-17 20:48:26] [INFO ] Deduced a trap composed of 11 places in 647 ms of which 1 ms to minimize.
[2023-03-17 20:48:27] [INFO ] Deduced a trap composed of 12 places in 687 ms of which 1 ms to minimize.
[2023-03-17 20:48:28] [INFO ] Deduced a trap composed of 40 places in 636 ms of which 2 ms to minimize.
[2023-03-17 20:48:28] [INFO ] Deduced a trap composed of 25 places in 485 ms of which 1 ms to minimize.
[2023-03-17 20:48:29] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:48:29] [INFO ] Deduced a trap composed of 23 places in 490 ms of which 1 ms to minimize.
[2023-03-17 20:48:30] [INFO ] Deduced a trap composed of 40 places in 549 ms of which 1 ms to minimize.
[2023-03-17 20:48:31] [INFO ] Deduced a trap composed of 55 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:48:31] [INFO ] Deduced a trap composed of 19 places in 598 ms of which 2 ms to minimize.
[2023-03-17 20:48:32] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 1 ms to minimize.
[2023-03-17 20:48:32] [INFO ] Deduced a trap composed of 48 places in 475 ms of which 2 ms to minimize.
[2023-03-17 20:48:33] [INFO ] Deduced a trap composed of 58 places in 439 ms of which 1 ms to minimize.
[2023-03-17 20:48:33] [INFO ] Deduced a trap composed of 77 places in 492 ms of which 1 ms to minimize.
[2023-03-17 20:48:34] [INFO ] Deduced a trap composed of 67 places in 485 ms of which 1 ms to minimize.
[2023-03-17 20:48:34] [INFO ] Deduced a trap composed of 58 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:48:35] [INFO ] Deduced a trap composed of 64 places in 491 ms of which 1 ms to minimize.
[2023-03-17 20:48:36] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 1 ms to minimize.
[2023-03-17 20:48:36] [INFO ] Deduced a trap composed of 58 places in 397 ms of which 1 ms to minimize.
[2023-03-17 20:48:37] [INFO ] Deduced a trap composed of 57 places in 472 ms of which 1 ms to minimize.
[2023-03-17 20:48:37] [INFO ] Deduced a trap composed of 40 places in 497 ms of which 1 ms to minimize.
[2023-03-17 20:48:38] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 1 ms to minimize.
[2023-03-17 20:48:38] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:48:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:48:38] [INFO ] After 25250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 29 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:48:38] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:38] [INFO ] Invariant cache hit.
[2023-03-17 20:48:39] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2023-03-17 20:48:39] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:39] [INFO ] Invariant cache hit.
[2023-03-17 20:48:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:48:44] [INFO ] Implicit Places using invariants and state equation in 4528 ms returned []
Implicit Place search using SMT with State Equation took 5578 ms to find 0 implicit places.
[2023-03-17 20:48:44] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-17 20:48:44] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:44] [INFO ] Invariant cache hit.
[2023-03-17 20:48:46] [INFO ] Dead Transitions using invariants and state equation in 1667 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7316 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 27 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-17 20:48:46] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-17 20:48:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 20:48:46] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 20:48:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 20:48:46] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 20:48:46] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-17 20:48:46] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 289 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 28 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:48:48] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-17 20:48:48] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-17 20:48:48] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 20:48:50] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2019 ms. Remains : 588/588 places, 1700/1700 transitions.
Built C files in :
/tmp/ltsmin11669281643714382888
[2023-03-17 20:48:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11669281643714382888
Running compilation step : cd /tmp/ltsmin11669281643714382888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11669281643714382888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11669281643714382888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-17 20:48:53] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:53] [INFO ] Invariant cache hit.
[2023-03-17 20:48:54] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-17 20:48:54] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:54] [INFO ] Invariant cache hit.
[2023-03-17 20:48:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:48:58] [INFO ] Implicit Places using invariants and state equation in 4505 ms returned []
Implicit Place search using SMT with State Equation took 5504 ms to find 0 implicit places.
[2023-03-17 20:48:58] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-17 20:48:58] [INFO ] Invariant cache hit.
[2023-03-17 20:49:00] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7107 ms. Remains : 588/588 places, 1700/1700 transitions.
Built C files in :
/tmp/ltsmin14565160468256319338
[2023-03-17 20:49:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14565160468256319338
Running compilation step : cd /tmp/ltsmin14565160468256319338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14565160468256319338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14565160468256319338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-17 20:49:03] [INFO ] Flatten gal took : 43 ms
[2023-03-17 20:49:03] [INFO ] Flatten gal took : 44 ms
[2023-03-17 20:49:03] [INFO ] Time to serialize gal into /tmp/LTL11193134305908772980.gal : 8 ms
[2023-03-17 20:49:03] [INFO ] Time to serialize properties into /tmp/LTL15419798693889628065.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11193134305908772980.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7924807078020221240.hoa' '-atoms' '/tmp/LTL15419798693889628065.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15419798693889628065.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7924807078020221240.hoa
Detected timeout of ITS tools.
[2023-03-17 20:49:18] [INFO ] Flatten gal took : 40 ms
[2023-03-17 20:49:18] [INFO ] Flatten gal took : 44 ms
[2023-03-17 20:49:18] [INFO ] Time to serialize gal into /tmp/LTL6100390692266726133.gal : 10 ms
[2023-03-17 20:49:18] [INFO ] Time to serialize properties into /tmp/LTL17177538250380552919.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6100390692266726133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17177538250380552919.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((WantSection_2_T==0)||(CS_2==0))")||(("(TestIdentity_3_3_5==0)")||(X(("(TestIdentity_3_3_5==0)")||(("(TestIdentity_3_3_5==1)")...206
Formula 0 simplified : F(!"((WantSection_2_T==0)||(CS_2==0))" & !"(TestIdentity_3_3_5==0)" & X(!"(TestIdentity_3_3_5==0)" & (!"(TestIdentity_3_3_5==1)" R !...199
Detected timeout of ITS tools.
[2023-03-17 20:49:33] [INFO ] Flatten gal took : 44 ms
[2023-03-17 20:49:33] [INFO ] Applying decomposition
[2023-03-17 20:49:33] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14949076016220885179.txt' '-o' '/tmp/graph14949076016220885179.bin' '-w' '/tmp/graph14949076016220885179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14949076016220885179.bin' '-l' '-1' '-v' '-w' '/tmp/graph14949076016220885179.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:49:33] [INFO ] Decomposing Gal with order
[2023-03-17 20:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:49:33] [INFO ] Removed a total of 2490 redundant transitions.
[2023-03-17 20:49:34] [INFO ] Flatten gal took : 108 ms
[2023-03-17 20:49:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 758 labels/synchronizations in 97 ms.
[2023-03-17 20:49:34] [INFO ] Time to serialize gal into /tmp/LTL1997672781622662293.gal : 16 ms
[2023-03-17 20:49:34] [INFO ] Time to serialize properties into /tmp/LTL1897629493410328848.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1997672781622662293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1897629493410328848.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i15.u28.WantSection_2_T==0)||(i7.u18.CS_2==0))")||(("(i12.i0.u64.TestIdentity_3_3_5==0)")||(X(("(i12.i0.u64.TestIdentity_3_3_...268
Formula 0 simplified : F(!"((i15.u28.WantSection_2_T==0)||(i7.u18.CS_2==0))" & !"(i12.i0.u64.TestIdentity_3_3_5==0)" & X(!"(i12.i0.u64.TestIdentity_3_3_5==...261
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15698456412910643046
[2023-03-17 20:49:49] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15698456412910643046
Running compilation step : cd /tmp/ltsmin15698456412910643046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15698456412910643046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15698456412910643046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 Peterson-PT-7-LTLFireability-11 finished in 205446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1))||G(p2))))))'
Found a Shortening insensitive property : Peterson-PT-7-LTLFireability-14
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 170 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-17 20:49:52] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-17 20:49:52] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-17 20:49:53] [INFO ] Implicit Places using invariants in 823 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 826 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 24 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1020 ms. Remains : 588/1992 places, 1699/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s464 1) (EQ s579 1)), p2:(EQ s275 0), p1:(EQ s370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 752 reset in 436 ms.
Product exploration explored 100000 steps with 651 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:49:54] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-17 20:49:54] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-17 20:49:55] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:49:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-17 20:49:55] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:49:56] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:49:56] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:49:56] [INFO ] After 216ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:49:56] [INFO ] Deduced a trap composed of 13 places in 540 ms of which 2 ms to minimize.
[2023-03-17 20:49:57] [INFO ] Deduced a trap composed of 12 places in 534 ms of which 3 ms to minimize.
[2023-03-17 20:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1322 ms
[2023-03-17 20:49:57] [INFO ] After 1613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-17 20:49:57] [INFO ] After 2640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 434088 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434088 steps, saw 63942 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:50:00] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:00] [INFO ] Invariant cache hit.
[2023-03-17 20:50:01] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:50:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-17 20:50:01] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:50:01] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:50:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:50:01] [INFO ] After 152ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:50:02] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2023-03-17 20:50:02] [INFO ] Deduced a trap composed of 12 places in 649 ms of which 2 ms to minimize.
[2023-03-17 20:50:03] [INFO ] Deduced a trap composed of 33 places in 670 ms of which 2 ms to minimize.
[2023-03-17 20:50:04] [INFO ] Deduced a trap composed of 30 places in 592 ms of which 1 ms to minimize.
[2023-03-17 20:50:05] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 1 ms to minimize.
[2023-03-17 20:50:05] [INFO ] Deduced a trap composed of 34 places in 609 ms of which 1 ms to minimize.
[2023-03-17 20:50:06] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 1 ms to minimize.
[2023-03-17 20:50:06] [INFO ] Deduced a trap composed of 22 places in 562 ms of which 1 ms to minimize.
[2023-03-17 20:50:07] [INFO ] Deduced a trap composed of 22 places in 584 ms of which 1 ms to minimize.
[2023-03-17 20:50:08] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 4 ms to minimize.
[2023-03-17 20:50:08] [INFO ] Deduced a trap composed of 12 places in 496 ms of which 14 ms to minimize.
[2023-03-17 20:50:09] [INFO ] Deduced a trap composed of 12 places in 571 ms of which 1 ms to minimize.
[2023-03-17 20:50:09] [INFO ] Deduced a trap composed of 12 places in 539 ms of which 1 ms to minimize.
[2023-03-17 20:50:10] [INFO ] Deduced a trap composed of 79 places in 459 ms of which 0 ms to minimize.
[2023-03-17 20:50:11] [INFO ] Deduced a trap composed of 60 places in 558 ms of which 1 ms to minimize.
[2023-03-17 20:50:11] [INFO ] Deduced a trap composed of 51 places in 569 ms of which 1 ms to minimize.
[2023-03-17 20:50:12] [INFO ] Deduced a trap composed of 26 places in 553 ms of which 1 ms to minimize.
[2023-03-17 20:50:13] [INFO ] Deduced a trap composed of 30 places in 535 ms of which 1 ms to minimize.
[2023-03-17 20:50:13] [INFO ] Deduced a trap composed of 24 places in 541 ms of which 1 ms to minimize.
[2023-03-17 20:50:14] [INFO ] Deduced a trap composed of 16 places in 565 ms of which 1 ms to minimize.
[2023-03-17 20:50:15] [INFO ] Deduced a trap composed of 64 places in 523 ms of which 1 ms to minimize.
[2023-03-17 20:50:15] [INFO ] Deduced a trap composed of 15 places in 532 ms of which 1 ms to minimize.
[2023-03-17 20:50:16] [INFO ] Deduced a trap composed of 75 places in 582 ms of which 31 ms to minimize.
[2023-03-17 20:50:17] [INFO ] Deduced a trap composed of 15 places in 591 ms of which 1 ms to minimize.
[2023-03-17 20:50:17] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 1 ms to minimize.
[2023-03-17 20:50:18] [INFO ] Deduced a trap composed of 31 places in 531 ms of which 1 ms to minimize.
[2023-03-17 20:50:18] [INFO ] Deduced a trap composed of 60 places in 503 ms of which 1 ms to minimize.
[2023-03-17 20:50:19] [INFO ] Deduced a trap composed of 63 places in 547 ms of which 1 ms to minimize.
[2023-03-17 20:50:20] [INFO ] Deduced a trap composed of 51 places in 555 ms of which 1 ms to minimize.
[2023-03-17 20:50:20] [INFO ] Deduced a trap composed of 43 places in 542 ms of which 1 ms to minimize.
[2023-03-17 20:50:21] [INFO ] Deduced a trap composed of 42 places in 506 ms of which 1 ms to minimize.
[2023-03-17 20:50:21] [INFO ] Deduced a trap composed of 42 places in 436 ms of which 1 ms to minimize.
[2023-03-17 20:50:22] [INFO ] Deduced a trap composed of 52 places in 545 ms of which 1 ms to minimize.
[2023-03-17 20:50:23] [INFO ] Deduced a trap composed of 50 places in 500 ms of which 1 ms to minimize.
[2023-03-17 20:50:23] [INFO ] Deduced a trap composed of 63 places in 445 ms of which 1 ms to minimize.
[2023-03-17 20:50:24] [INFO ] Deduced a trap composed of 65 places in 444 ms of which 1 ms to minimize.
[2023-03-17 20:50:24] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 1 ms to minimize.
[2023-03-17 20:50:25] [INFO ] Deduced a trap composed of 41 places in 555 ms of which 1 ms to minimize.
[2023-03-17 20:50:26] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 0 ms to minimize.
[2023-03-17 20:50:26] [INFO ] Deduced a trap composed of 2 places in 593 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:50:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:50:26] [INFO ] After 25603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 29 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 33 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:50:26] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:26] [INFO ] Invariant cache hit.
[2023-03-17 20:50:27] [INFO ] Implicit Places using invariants in 791 ms returned []
[2023-03-17 20:50:27] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:27] [INFO ] Invariant cache hit.
[2023-03-17 20:50:28] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:50:33] [INFO ] Implicit Places using invariants and state equation in 6271 ms returned []
Implicit Place search using SMT with State Equation took 7065 ms to find 0 implicit places.
[2023-03-17 20:50:33] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-17 20:50:33] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:33] [INFO ] Invariant cache hit.
[2023-03-17 20:50:35] [INFO ] Dead Transitions using invariants and state equation in 1266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8432 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 19 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-17 20:50:35] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 20:50:35] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:50:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-17 20:50:35] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:50:35] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:50:35] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 20:50:35] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 21 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:50:35] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-17 20:50:35] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-17 20:50:36] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-17 20:50:36] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:36] [INFO ] Invariant cache hit.
[2023-03-17 20:50:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:50:41] [INFO ] Implicit Places using invariants and state equation in 4299 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
[2023-03-17 20:50:41] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:41] [INFO ] Invariant cache hit.
[2023-03-17 20:50:42] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6217 ms. Remains : 588/588 places, 1699/1699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:50:42] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:50:42] [INFO ] Invariant cache hit.
[2023-03-17 20:50:42] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:50:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-17 20:50:42] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:50:43] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:50:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:50:43] [INFO ] After 152ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:50:44] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 1 ms to minimize.
[2023-03-17 20:50:44] [INFO ] Deduced a trap composed of 12 places in 480 ms of which 1 ms to minimize.
[2023-03-17 20:50:45] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 1 ms to minimize.
[2023-03-17 20:50:46] [INFO ] Deduced a trap composed of 30 places in 607 ms of which 1 ms to minimize.
[2023-03-17 20:50:46] [INFO ] Deduced a trap composed of 31 places in 549 ms of which 1 ms to minimize.
[2023-03-17 20:50:47] [INFO ] Deduced a trap composed of 34 places in 522 ms of which 1 ms to minimize.
[2023-03-17 20:50:47] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 0 ms to minimize.
[2023-03-17 20:50:48] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 1 ms to minimize.
[2023-03-17 20:50:49] [INFO ] Deduced a trap composed of 22 places in 587 ms of which 1 ms to minimize.
[2023-03-17 20:50:49] [INFO ] Deduced a trap composed of 21 places in 573 ms of which 1 ms to minimize.
[2023-03-17 20:50:50] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 1 ms to minimize.
[2023-03-17 20:50:51] [INFO ] Deduced a trap composed of 12 places in 589 ms of which 1 ms to minimize.
[2023-03-17 20:50:51] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 1 ms to minimize.
[2023-03-17 20:50:52] [INFO ] Deduced a trap composed of 79 places in 614 ms of which 2 ms to minimize.
[2023-03-17 20:50:53] [INFO ] Deduced a trap composed of 60 places in 570 ms of which 1 ms to minimize.
[2023-03-17 20:50:53] [INFO ] Deduced a trap composed of 51 places in 551 ms of which 1 ms to minimize.
[2023-03-17 20:50:54] [INFO ] Deduced a trap composed of 26 places in 539 ms of which 1 ms to minimize.
[2023-03-17 20:50:55] [INFO ] Deduced a trap composed of 30 places in 530 ms of which 1 ms to minimize.
[2023-03-17 20:50:55] [INFO ] Deduced a trap composed of 24 places in 580 ms of which 1 ms to minimize.
[2023-03-17 20:50:56] [INFO ] Deduced a trap composed of 16 places in 560 ms of which 1 ms to minimize.
[2023-03-17 20:50:57] [INFO ] Deduced a trap composed of 64 places in 534 ms of which 1 ms to minimize.
[2023-03-17 20:50:57] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 0 ms to minimize.
[2023-03-17 20:50:58] [INFO ] Deduced a trap composed of 75 places in 614 ms of which 1 ms to minimize.
[2023-03-17 20:50:58] [INFO ] Deduced a trap composed of 15 places in 453 ms of which 1 ms to minimize.
[2023-03-17 20:50:59] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 1 ms to minimize.
[2023-03-17 20:50:59] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 1 ms to minimize.
[2023-03-17 20:51:00] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 1 ms to minimize.
[2023-03-17 20:51:00] [INFO ] Deduced a trap composed of 63 places in 462 ms of which 1 ms to minimize.
[2023-03-17 20:51:01] [INFO ] Deduced a trap composed of 51 places in 508 ms of which 1 ms to minimize.
[2023-03-17 20:51:02] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 1 ms to minimize.
[2023-03-17 20:51:02] [INFO ] Deduced a trap composed of 42 places in 433 ms of which 0 ms to minimize.
[2023-03-17 20:51:03] [INFO ] Deduced a trap composed of 42 places in 479 ms of which 1 ms to minimize.
[2023-03-17 20:51:03] [INFO ] Deduced a trap composed of 52 places in 499 ms of which 1 ms to minimize.
[2023-03-17 20:51:04] [INFO ] Deduced a trap composed of 50 places in 494 ms of which 1 ms to minimize.
[2023-03-17 20:51:04] [INFO ] Deduced a trap composed of 63 places in 439 ms of which 1 ms to minimize.
[2023-03-17 20:51:05] [INFO ] Deduced a trap composed of 65 places in 471 ms of which 1 ms to minimize.
[2023-03-17 20:51:05] [INFO ] Deduced a trap composed of 62 places in 401 ms of which 1 ms to minimize.
[2023-03-17 20:51:06] [INFO ] Deduced a trap composed of 41 places in 564 ms of which 1 ms to minimize.
[2023-03-17 20:51:07] [INFO ] Deduced a trap composed of 17 places in 542 ms of which 1 ms to minimize.
[2023-03-17 20:51:08] [INFO ] Deduced a trap composed of 31 places in 560 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:51:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:51:08] [INFO ] After 25573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 29 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 562014 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 562014 steps, saw 80871 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 20:51:11] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:11] [INFO ] Invariant cache hit.
[2023-03-17 20:51:11] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:51:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-17 20:51:11] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 20:51:12] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:51:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:51:12] [INFO ] After 221ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 20:51:13] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2023-03-17 20:51:13] [INFO ] Deduced a trap composed of 12 places in 471 ms of which 1 ms to minimize.
[2023-03-17 20:51:14] [INFO ] Deduced a trap composed of 33 places in 504 ms of which 1 ms to minimize.
[2023-03-17 20:51:14] [INFO ] Deduced a trap composed of 30 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:51:15] [INFO ] Deduced a trap composed of 31 places in 681 ms of which 1 ms to minimize.
[2023-03-17 20:51:16] [INFO ] Deduced a trap composed of 34 places in 708 ms of which 1 ms to minimize.
[2023-03-17 20:51:17] [INFO ] Deduced a trap composed of 24 places in 644 ms of which 1 ms to minimize.
[2023-03-17 20:51:17] [INFO ] Deduced a trap composed of 22 places in 659 ms of which 1 ms to minimize.
[2023-03-17 20:51:18] [INFO ] Deduced a trap composed of 22 places in 532 ms of which 1 ms to minimize.
[2023-03-17 20:51:19] [INFO ] Deduced a trap composed of 21 places in 521 ms of which 1 ms to minimize.
[2023-03-17 20:51:19] [INFO ] Deduced a trap composed of 12 places in 494 ms of which 0 ms to minimize.
[2023-03-17 20:51:20] [INFO ] Deduced a trap composed of 12 places in 515 ms of which 1 ms to minimize.
[2023-03-17 20:51:20] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 1 ms to minimize.
[2023-03-17 20:51:21] [INFO ] Deduced a trap composed of 79 places in 627 ms of which 1 ms to minimize.
[2023-03-17 20:51:22] [INFO ] Deduced a trap composed of 60 places in 648 ms of which 1 ms to minimize.
[2023-03-17 20:51:22] [INFO ] Deduced a trap composed of 51 places in 613 ms of which 1 ms to minimize.
[2023-03-17 20:51:23] [INFO ] Deduced a trap composed of 26 places in 507 ms of which 1 ms to minimize.
[2023-03-17 20:51:24] [INFO ] Deduced a trap composed of 30 places in 520 ms of which 1 ms to minimize.
[2023-03-17 20:51:24] [INFO ] Deduced a trap composed of 24 places in 555 ms of which 1 ms to minimize.
[2023-03-17 20:51:25] [INFO ] Deduced a trap composed of 16 places in 521 ms of which 1 ms to minimize.
[2023-03-17 20:51:25] [INFO ] Deduced a trap composed of 64 places in 479 ms of which 1 ms to minimize.
[2023-03-17 20:51:26] [INFO ] Deduced a trap composed of 15 places in 615 ms of which 1 ms to minimize.
[2023-03-17 20:51:27] [INFO ] Deduced a trap composed of 75 places in 626 ms of which 1 ms to minimize.
[2023-03-17 20:51:27] [INFO ] Deduced a trap composed of 15 places in 600 ms of which 1 ms to minimize.
[2023-03-17 20:51:28] [INFO ] Deduced a trap composed of 42 places in 441 ms of which 1 ms to minimize.
[2023-03-17 20:51:29] [INFO ] Deduced a trap composed of 31 places in 549 ms of which 1 ms to minimize.
[2023-03-17 20:51:29] [INFO ] Deduced a trap composed of 60 places in 498 ms of which 1 ms to minimize.
[2023-03-17 20:51:30] [INFO ] Deduced a trap composed of 63 places in 514 ms of which 1 ms to minimize.
[2023-03-17 20:51:30] [INFO ] Deduced a trap composed of 51 places in 557 ms of which 1 ms to minimize.
[2023-03-17 20:51:31] [INFO ] Deduced a trap composed of 43 places in 513 ms of which 1 ms to minimize.
[2023-03-17 20:51:32] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 1 ms to minimize.
[2023-03-17 20:51:32] [INFO ] Deduced a trap composed of 42 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:51:33] [INFO ] Deduced a trap composed of 52 places in 435 ms of which 1 ms to minimize.
[2023-03-17 20:51:33] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 1 ms to minimize.
[2023-03-17 20:51:34] [INFO ] Deduced a trap composed of 63 places in 324 ms of which 1 ms to minimize.
[2023-03-17 20:51:34] [INFO ] Deduced a trap composed of 65 places in 501 ms of which 1 ms to minimize.
[2023-03-17 20:51:35] [INFO ] Deduced a trap composed of 62 places in 448 ms of which 1 ms to minimize.
[2023-03-17 20:51:36] [INFO ] Deduced a trap composed of 41 places in 527 ms of which 1 ms to minimize.
[2023-03-17 20:51:36] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 20:51:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 20:51:36] [INFO ] After 25206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 36 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:51:36] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:36] [INFO ] Invariant cache hit.
[2023-03-17 20:51:37] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-17 20:51:37] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:37] [INFO ] Invariant cache hit.
[2023-03-17 20:51:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:51:42] [INFO ] Implicit Places using invariants and state equation in 5178 ms returned []
Implicit Place search using SMT with State Equation took 6169 ms to find 0 implicit places.
[2023-03-17 20:51:43] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-17 20:51:43] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:43] [INFO ] Invariant cache hit.
[2023-03-17 20:51:44] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7838 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 18 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-17 20:51:44] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-17 20:51:44] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 20:51:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 20:51:44] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 20:51:44] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 20:51:44] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 20:51:44] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 601 reset in 473 ms.
Product exploration explored 100000 steps with 698 reset in 499 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 28 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:51:46] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-17 20:51:46] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-17 20:51:46] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-17 20:51:48] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1803 ms. Remains : 588/588 places, 1699/1699 transitions.
Built C files in :
/tmp/ltsmin14928202522366070012
[2023-03-17 20:51:48] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14928202522366070012
Running compilation step : cd /tmp/ltsmin14928202522366070012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14928202522366070012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14928202522366070012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-17 20:51:51] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:51] [INFO ] Invariant cache hit.
[2023-03-17 20:51:52] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-17 20:51:52] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:52] [INFO ] Invariant cache hit.
[2023-03-17 20:51:53] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-17 20:51:57] [INFO ] Implicit Places using invariants and state equation in 5178 ms returned []
Implicit Place search using SMT with State Equation took 6205 ms to find 0 implicit places.
[2023-03-17 20:51:57] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-17 20:51:57] [INFO ] Invariant cache hit.
[2023-03-17 20:51:59] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7802 ms. Remains : 588/588 places, 1699/1699 transitions.
Built C files in :
/tmp/ltsmin12141261751359552719
[2023-03-17 20:51:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12141261751359552719
Running compilation step : cd /tmp/ltsmin12141261751359552719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12141261751359552719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12141261751359552719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-17 20:52:02] [INFO ] Flatten gal took : 68 ms
[2023-03-17 20:52:02] [INFO ] Flatten gal took : 68 ms
[2023-03-17 20:52:02] [INFO ] Time to serialize gal into /tmp/LTL3951943283223498000.gal : 12 ms
[2023-03-17 20:52:02] [INFO ] Time to serialize properties into /tmp/LTL16612998239446481064.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3951943283223498000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9991720739686103222.hoa' '-atoms' '/tmp/LTL16612998239446481064.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16612998239446481064.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9991720739686103222.hoa
Detected timeout of ITS tools.
[2023-03-17 20:52:17] [INFO ] Flatten gal took : 38 ms
[2023-03-17 20:52:17] [INFO ] Flatten gal took : 40 ms
[2023-03-17 20:52:17] [INFO ] Time to serialize gal into /tmp/LTL4558869908716965294.gal : 13 ms
[2023-03-17 20:52:17] [INFO ] Time to serialize properties into /tmp/LTL2607147806095027000.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4558869908716965294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2607147806095027000.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G(F("(EndTurn_5_6==1)")))||(G("(IsEndLoop_2_2_5==0)")))||("((WantSection_1_F==1)&&(Idle_1==1))"))))))
Formula 0 simplified : XXG(!"((WantSection_1_F==1)&&(Idle_1==1))" & FG!"(EndTurn_5_6==1)" & F!"(IsEndLoop_2_2_5==0)")
Detected timeout of ITS tools.
[2023-03-17 20:52:33] [INFO ] Flatten gal took : 40 ms
[2023-03-17 20:52:33] [INFO ] Applying decomposition
[2023-03-17 20:52:33] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2603150554885762346.txt' '-o' '/tmp/graph2603150554885762346.bin' '-w' '/tmp/graph2603150554885762346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2603150554885762346.bin' '-l' '-1' '-v' '-w' '/tmp/graph2603150554885762346.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:52:33] [INFO ] Decomposing Gal with order
[2023-03-17 20:52:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:52:33] [INFO ] Removed a total of 2498 redundant transitions.
[2023-03-17 20:52:33] [INFO ] Flatten gal took : 153 ms
[2023-03-17 20:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 944 labels/synchronizations in 154 ms.
[2023-03-17 20:52:33] [INFO ] Time to serialize gal into /tmp/LTL2839784340420525623.gal : 19 ms
[2023-03-17 20:52:33] [INFO ] Time to serialize properties into /tmp/LTL11569244329772623316.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2839784340420525623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11569244329772623316.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G(F("(i6.u17.EndTurn_5_6==1)")))||(G("(i3.u58.IsEndLoop_2_2_5==0)")))||("((i0.i1.u29.WantSection_1_F==1)&&(i0.i1.u29.Idle_1...167
Formula 0 simplified : XXG(!"((i0.i1.u29.WantSection_1_F==1)&&(i0.i1.u29.Idle_1==1))" & FG!"(i6.u17.EndTurn_5_6==1)" & F!"(i3.u58.IsEndLoop_2_2_5==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2507043063734058780
[2023-03-17 20:52:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2507043063734058780
Running compilation step : cd /tmp/ltsmin2507043063734058780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2507043063734058780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin2507043063734058780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 Peterson-PT-7-LTLFireability-14 finished in 179497 ms.
[2023-03-17 20:52:51] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15168446933487972666
[2023-03-17 20:52:51] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2023-03-17 20:52:51] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15168446933487972666
Running compilation step : cd /tmp/ltsmin15168446933487972666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 20:52:51] [INFO ] Applying decomposition
[2023-03-17 20:52:52] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9052982852389667833.txt' '-o' '/tmp/graph9052982852389667833.bin' '-w' '/tmp/graph9052982852389667833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9052982852389667833.bin' '-l' '-1' '-v' '-w' '/tmp/graph9052982852389667833.weights' '-q' '0' '-e' '0.001'
[2023-03-17 20:52:52] [INFO ] Decomposing Gal with order
[2023-03-17 20:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 20:52:52] [INFO ] Removed a total of 2835 redundant transitions.
[2023-03-17 20:52:52] [INFO ] Flatten gal took : 188 ms
[2023-03-17 20:52:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2023-03-17 20:52:53] [INFO ] Time to serialize gal into /tmp/LTLFireability7385445998252376868.gal : 45 ms
[2023-03-17 20:52:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3082427671093238468.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7385445998252376868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3082427671093238468.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(("((i43.i1.i1.u689.WantSection_2_T==0)||(i12.i2.i0.u155.CS_2==0))")||(("(i36.i0.i0.u415.TestIdentity_3_3_5==0)")||(X(("(i36.i0.i0...311
Formula 0 simplified : F(!"((i43.i1.i1.u689.WantSection_2_T==0)||(i12.i2.i0.u155.CS_2==0))" & !"(i36.i0.i0.u415.TestIdentity_3_3_5==0)" & X(!"(i36.i0.i0.u4...304
Compilation finished in 13361 ms.
Running link step : cd /tmp/ltsmin15168446933487972666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin15168446933487972666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-17 21:19:06] [INFO ] Applying decomposition
[2023-03-17 21:19:07] [INFO ] Flatten gal took : 945 ms
[2023-03-17 21:19:09] [INFO ] Decomposing Gal with order
[2023-03-17 21:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 21:19:14] [INFO ] Removed a total of 2137 redundant transitions.
[2023-03-17 21:19:14] [INFO ] Flatten gal took : 4449 ms
[2023-03-17 21:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 977 labels/synchronizations in 212 ms.
[2023-03-17 21:19:15] [INFO ] Time to serialize gal into /tmp/LTLFireability2635644430917337406.gal : 187 ms
[2023-03-17 21:19:15] [INFO ] Time to serialize properties into /tmp/LTLFireability17103281854570898753.ltl : 22 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2635644430917337406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17103281854570898753.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(("((u20.WantSection_2_T==0)||(missing.CS_2==0))")||(("(u1.TestIdentity_3_3_5==0)")||(X(("(u1.TestIdentity_3_3_5==0)")||(("(u1.Tes...234
Formula 0 simplified : F(!"((u20.WantSection_2_T==0)||(missing.CS_2==0))" & !"(u1.TestIdentity_3_3_5==0)" & X(!"(u1.TestIdentity_3_3_5==0)" & (!"(u1.TestId...227
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15168446933487972666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15168446933487972666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp4==true)||[](<>((LTLAPp5==true)))||[]((LTLAPp6==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7788388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15759224 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Peterson-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536600644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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