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.r005-oct2-167813593200523.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-96b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 9.0K Feb 25 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:22 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 AutoFlight-PT-96b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-96b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678518958581

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 07:16:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:16:01] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-03-11 07:16:01] [INFO ] Transformed 7894 places.
[2023-03-11 07:16:01] [INFO ] Transformed 7868 transitions.
[2023-03-11 07:16:01] [INFO ] Found NUPN structural information;
[2023-03-11 07:16:01] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 700 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-96b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-96b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 7894 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Discarding 1010 places :
Symmetric choice reduction at 0 with 1010 rule applications. Total rules 1010 place count 6884 transition count 6858
Iterating global reduction 0 with 1010 rules applied. Total rules applied 2020 place count 6884 transition count 6858
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 2163 place count 6884 transition count 6715
Discarding 475 places :
Symmetric choice reduction at 1 with 475 rule applications. Total rules 2638 place count 6409 transition count 6240
Iterating global reduction 1 with 475 rules applied. Total rules applied 3113 place count 6409 transition count 6240
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 3185 place count 6337 transition count 6168
Iterating global reduction 1 with 72 rules applied. Total rules applied 3257 place count 6337 transition count 6168
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 3328 place count 6266 transition count 6097
Iterating global reduction 1 with 71 rules applied. Total rules applied 3399 place count 6266 transition count 6097
Applied a total of 3399 rules in 6634 ms. Remains 6266 /7894 variables (removed 1628) and now considering 6097/7868 (removed 1771) transitions.
// Phase 1: matrix 6097 rows 6266 cols
[2023-03-11 07:16:08] [INFO ] Computed 514 place invariants in 121 ms
[2023-03-11 07:16:11] [INFO ] Implicit Places using invariants in 2887 ms returned []
[2023-03-11 07:16:11] [INFO ] Invariant cache hit.
[2023-03-11 07:16:14] [INFO ] Implicit Places using invariants and state equation in 2524 ms returned []
Implicit Place search using SMT with State Equation took 5463 ms to find 0 implicit places.
[2023-03-11 07:16:14] [INFO ] Invariant cache hit.
[2023-03-11 07:16:20] [INFO ] Dead Transitions using invariants and state equation in 6419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6266/7894 places, 6097/7868 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18527 ms. Remains : 6266/7894 places, 6097/7868 transitions.
Support contains 31 out of 6266 places after structural reductions.
[2023-03-11 07:16:21] [INFO ] Flatten gal took : 350 ms
[2023-03-11 07:16:21] [INFO ] Flatten gal took : 192 ms
[2023-03-11 07:16:22] [INFO ] Input system was already deterministic with 6097 transitions.
Support contains 29 out of 6266 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 07:16:22] [INFO ] Invariant cache hit.
[2023-03-11 07:16:24] [INFO ] After 1617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 07:16:27] [INFO ] [Nat]Absence check using 513 positive place invariants in 819 ms returned sat
[2023-03-11 07:16:27] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 62 ms returned sat
[2023-03-11 07:16:35] [INFO ] After 7361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 07:16:39] [INFO ] Deduced a trap composed of 210 places in 4042 ms of which 21 ms to minimize.
[2023-03-11 07:16:44] [INFO ] Deduced a trap composed of 292 places in 4024 ms of which 5 ms to minimize.
[2023-03-11 07:16:48] [INFO ] Deduced a trap composed of 208 places in 4172 ms of which 9 ms to minimize.
[2023-03-11 07:16:52] [INFO ] Deduced a trap composed of 292 places in 3969 ms of which 10 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-11 07:16:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:16:52] [INFO ] After 28231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 1306 ms.
Support contains 11 out of 6266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Drop transitions removed 2531 transitions
Trivial Post-agglo rules discarded 2531 transitions
Performed 2531 trivial Post agglomeration. Transition count delta: 2531
Iterating post reduction 0 with 2531 rules applied. Total rules applied 2531 place count 6266 transition count 3566
Reduce places removed 2531 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2817 rules applied. Total rules applied 5348 place count 3735 transition count 3280
Reduce places removed 190 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 193 rules applied. Total rules applied 5541 place count 3545 transition count 3277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 5544 place count 3542 transition count 3277
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5544 place count 3542 transition count 2575
Deduced a syphon composed of 702 places in 31 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6948 place count 2840 transition count 2575
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 6950 place count 2838 transition count 2573
Iterating global reduction 4 with 2 rules applied. Total rules applied 6952 place count 2838 transition count 2573
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 6952 place count 2838 transition count 2571
Deduced a syphon composed of 2 places in 33 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 6956 place count 2836 transition count 2571
Performed 1143 Post agglomeration using F-continuation condition with reduction of 143 identical transitions.
Deduced a syphon composed of 1143 places in 2 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9242 place count 1693 transition count 1285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9243 place count 1693 transition count 1284
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 9244 place count 1693 transition count 1283
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 9531 place count 1693 transition count 996
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 9818 place count 1406 transition count 996
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9819 place count 1405 transition count 995
Reduce places removed 401 places and 0 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 6 with 1028 rules applied. Total rules applied 10847 place count 1004 transition count 368
Reduce places removed 627 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 630 rules applied. Total rules applied 11477 place count 377 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 11480 place count 374 transition count 365
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 119 Pre rules applied. Total rules applied 11480 place count 374 transition count 246
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 9 with 238 rules applied. Total rules applied 11718 place count 255 transition count 246
Applied a total of 11718 rules in 1480 ms. Remains 255 /6266 variables (removed 6011) and now considering 246/6097 (removed 5851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1481 ms. Remains : 255/6266 places, 246/6097 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 246 rows 255 cols
[2023-03-11 07:16:55] [INFO ] Computed 113 place invariants in 4 ms
[2023-03-11 07:16:56] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:16:56] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-11 07:16:56] [INFO ] [Nat]Absence check using 111 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-11 07:16:56] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:16:56] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:16:56] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 07:16:56] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 1 ms.
Computed a total of 1583 stabilizing places and 1583 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)))'
Support contains 2 out of 6266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2540 transitions
Trivial Post-agglo rules discarded 2540 transitions
Performed 2540 trivial Post agglomeration. Transition count delta: 2540
Iterating post reduction 0 with 2540 rules applied. Total rules applied 2540 place count 6265 transition count 3556
Reduce places removed 2540 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2829 rules applied. Total rules applied 5369 place count 3725 transition count 3267
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5562 place count 3533 transition count 3266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5563 place count 3532 transition count 3266
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5563 place count 3532 transition count 2563
Deduced a syphon composed of 703 places in 29 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6969 place count 2829 transition count 2563
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6973 place count 2825 transition count 2559
Iterating global reduction 4 with 4 rules applied. Total rules applied 6977 place count 2825 transition count 2559
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6977 place count 2825 transition count 2556
Deduced a syphon composed of 3 places in 28 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6983 place count 2822 transition count 2556
Performed 1142 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1142 places in 1 ms
Reduce places removed 1142 places and 0 transitions.
Iterating global reduction 4 with 2284 rules applied. Total rules applied 9267 place count 1680 transition count 1270
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9268 place count 1679 transition count 1269
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9554 place count 1488 transition count 1174
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9649 place count 1393 transition count 1174
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9649 place count 1393 transition count 1078
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9841 place count 1297 transition count 1078
Applied a total of 9841 rules in 1078 ms. Remains 1297 /6266 variables (removed 4969) and now considering 1078/6097 (removed 5019) transitions.
// Phase 1: matrix 1078 rows 1297 cols
[2023-03-11 07:16:58] [INFO ] Computed 323 place invariants in 18 ms
[2023-03-11 07:16:59] [INFO ] Implicit Places using invariants in 905 ms returned [508, 582, 656, 734, 808, 882, 920, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1291, 1296]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 909 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1193/6266 places, 1078/6097 transitions.
Graph (trivial) has 494 edges and 1193 vertex of which 24 / 1193 are part of one of the 1 SCC in 5 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1091 transition count 954
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1091 transition count 954
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1088 transition count 951
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1088 transition count 951
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1085 transition count 948
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1085 transition count 948
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1082 transition count 945
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1082 transition count 945
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1079 transition count 942
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1079 transition count 942
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1076 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1076 transition count 939
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1073 transition count 936
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1073 transition count 936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1070 transition count 933
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1070 transition count 933
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1067 transition count 930
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1067 transition count 930
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1064 transition count 927
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1064 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1061 transition count 924
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1061 transition count 924
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1058 transition count 921
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1058 transition count 921
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1055 transition count 918
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1055 transition count 918
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 233 place count 1053 transition count 916
Iterating global reduction 0 with 2 rules applied. Total rules applied 235 place count 1053 transition count 916
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 237 place count 1051 transition count 914
Iterating global reduction 0 with 2 rules applied. Total rules applied 239 place count 1051 transition count 914
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 241 place count 1049 transition count 912
Iterating global reduction 0 with 2 rules applied. Total rules applied 243 place count 1049 transition count 912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 245 place count 1047 transition count 910
Iterating global reduction 0 with 2 rules applied. Total rules applied 247 place count 1047 transition count 910
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 249 place count 1045 transition count 908
Iterating global reduction 0 with 2 rules applied. Total rules applied 251 place count 1045 transition count 908
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 253 place count 1043 transition count 906
Iterating global reduction 0 with 2 rules applied. Total rules applied 255 place count 1043 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1041 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1041 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1039 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1039 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1037 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1037 transition count 900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1035 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1035 transition count 898
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1033 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1033 transition count 896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1031 transition count 894
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1031 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 283 place count 1029 transition count 892
Applied a total of 283 rules in 1060 ms. Remains 1029 /1193 variables (removed 164) and now considering 892/1078 (removed 186) transitions.
// Phase 1: matrix 892 rows 1029 cols
[2023-03-11 07:17:00] [INFO ] Computed 219 place invariants in 7 ms
[2023-03-11 07:17:00] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-11 07:17:00] [INFO ] Invariant cache hit.
[2023-03-11 07:17:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 07:17:02] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1029/6266 places, 892/6097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5092 ms. Remains : 1029/6266 places, 892/6097 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s304 0) (EQ s726 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5354 steps with 23 reset in 199 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-01 finished in 5585 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(G(p0)) U G(p1))))'
Support contains 3 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6258 transition count 6089
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6258 transition count 6089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 6258 transition count 6088
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 6255 transition count 6085
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 6254 transition count 6084
Applied a total of 25 rules in 5151 ms. Remains 6254 /6266 variables (removed 12) and now considering 6084/6097 (removed 13) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2023-03-11 07:17:07] [INFO ] Computed 514 place invariants in 45 ms
[2023-03-11 07:17:10] [INFO ] Implicit Places using invariants in 2331 ms returned []
[2023-03-11 07:17:10] [INFO ] Invariant cache hit.
[2023-03-11 07:17:12] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 4663 ms to find 0 implicit places.
[2023-03-11 07:17:12] [INFO ] Invariant cache hit.
[2023-03-11 07:17:18] [INFO ] Dead Transitions using invariants and state equation in 5993 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6266 places, 6084/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15812 ms. Remains : 6254/6266 places, 6084/6097 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s3473 0) (EQ s3561 1)), p0:(NEQ s2187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 976 ms.
Product exploration explored 100000 steps with 26 reset in 1158 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-11 07:17:22] [INFO ] Invariant cache hit.
[2023-03-11 07:17:23] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:17:24] [INFO ] [Nat]Absence check using 513 positive place invariants in 737 ms returned sat
[2023-03-11 07:17:24] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 28 ms returned sat
[2023-03-11 07:17:29] [INFO ] After 4880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:17:33] [INFO ] Deduced a trap composed of 206 places in 3892 ms of which 5 ms to minimize.
[2023-03-11 07:17:37] [INFO ] Deduced a trap composed of 294 places in 3624 ms of which 9 ms to minimize.
[2023-03-11 07:17:41] [INFO ] Deduced a trap composed of 294 places in 3763 ms of which 4 ms to minimize.
[2023-03-11 07:17:45] [INFO ] Deduced a trap composed of 51 places in 3643 ms of which 4 ms to minimize.
[2023-03-11 07:17:51] [INFO ] Deduced a trap composed of 1046 places in 5374 ms of which 4 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-11 07:17:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:17:51] [INFO ] After 28121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6254 transition count 3548
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5554 place count 3526 transition count 3258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5556 place count 3524 transition count 3258
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5556 place count 3524 transition count 2556
Deduced a syphon composed of 702 places in 32 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6960 place count 2822 transition count 2556
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9246 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 9534 place count 1679 transition count 981
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 9822 place count 1391 transition count 981
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1390 transition count 980
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 5 with 1071 rules applied. Total rules applied 10894 place count 982 transition count 317
Reduce places removed 663 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 664 rules applied. Total rules applied 11558 place count 319 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11559 place count 318 transition count 316
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 104 Pre rules applied. Total rules applied 11559 place count 318 transition count 212
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 8 with 208 rules applied. Total rules applied 11767 place count 214 transition count 212
Applied a total of 11767 rules in 922 ms. Remains 214 /6254 variables (removed 6040) and now considering 212/6084 (removed 5872) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 214/6254 places, 212/6084 transitions.
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 6254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Applied a total of 0 rules in 1310 ms. Remains 6254 /6254 variables (removed 0) and now considering 6084/6084 (removed 0) transitions.
[2023-03-11 07:17:54] [INFO ] Invariant cache hit.
[2023-03-11 07:17:56] [INFO ] Implicit Places using invariants in 2067 ms returned []
[2023-03-11 07:17:56] [INFO ] Invariant cache hit.
[2023-03-11 07:17:57] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 3870 ms to find 0 implicit places.
[2023-03-11 07:17:57] [INFO ] Invariant cache hit.
[2023-03-11 07:18:03] [INFO ] Dead Transitions using invariants and state equation in 5182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10371 ms. Remains : 6254/6254 places, 6084/6084 transitions.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :1
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-11 07:18:04] [INFO ] Invariant cache hit.
[2023-03-11 07:18:05] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:18:06] [INFO ] [Nat]Absence check using 513 positive place invariants in 702 ms returned sat
[2023-03-11 07:18:06] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 30 ms returned sat
[2023-03-11 07:18:12] [INFO ] After 5147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:18:16] [INFO ] Deduced a trap composed of 206 places in 3672 ms of which 4 ms to minimize.
[2023-03-11 07:18:19] [INFO ] Deduced a trap composed of 294 places in 3708 ms of which 4 ms to minimize.
[2023-03-11 07:18:24] [INFO ] Deduced a trap composed of 294 places in 4180 ms of which 8 ms to minimize.
[2023-03-11 07:18:28] [INFO ] Deduced a trap composed of 51 places in 3857 ms of which 34 ms to minimize.
[2023-03-11 07:18:32] [INFO ] Deduced a trap composed of 1046 places in 3778 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: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-11 07:18:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:18:32] [INFO ] After 27334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 6254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6254 transition count 3548
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5554 place count 3526 transition count 3258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5556 place count 3524 transition count 3258
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5556 place count 3524 transition count 2556
Deduced a syphon composed of 702 places in 25 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6960 place count 2822 transition count 2556
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 1 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9246 place count 1679 transition count 1269
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 9534 place count 1679 transition count 981
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 9822 place count 1391 transition count 981
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9823 place count 1390 transition count 980
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 5 with 1071 rules applied. Total rules applied 10894 place count 982 transition count 317
Reduce places removed 663 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 664 rules applied. Total rules applied 11558 place count 319 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11559 place count 318 transition count 316
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 104 Pre rules applied. Total rules applied 11559 place count 318 transition count 212
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 8 with 208 rules applied. Total rules applied 11767 place count 214 transition count 212
Applied a total of 11767 rules in 889 ms. Remains 214 /6254 variables (removed 6040) and now considering 212/6084 (removed 5872) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 214/6254 places, 212/6084 transitions.
Finished random walk after 338 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 26 reset in 825 ms.
Product exploration explored 100000 steps with 26 reset in 942 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 6254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Performed 2274 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2274 rules applied. Total rules applied 2274 place count 6254 transition count 6084
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 192 rules applied. Total rules applied 2466 place count 6254 transition count 5988
Performed 844 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 844 Pre rules applied. Total rules applied 2466 place count 6254 transition count 5988
Deduced a syphon composed of 3214 places in 75 ms
Iterating global reduction 2 with 844 rules applied. Total rules applied 3310 place count 6254 transition count 5988
Discarding 2095 places :
Symmetric choice reduction at 2 with 2095 rule applications. Total rules 5405 place count 4159 transition count 3893
Deduced a syphon composed of 1119 places in 46 ms
Iterating global reduction 2 with 2095 rules applied. Total rules applied 7500 place count 4159 transition count 3893
Performed 1360 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 2479 places in 3 ms
Iterating global reduction 2 with 1360 rules applied. Total rules applied 8860 place count 4159 transition count 3749
Renaming transitions due to excessive name length > 1024 char.
Discarding 847 places :
Symmetric choice reduction at 2 with 847 rule applications. Total rules 9707 place count 3312 transition count 2902
Deduced a syphon composed of 1632 places in 2 ms
Iterating global reduction 2 with 847 rules applied. Total rules applied 10554 place count 3312 transition count 2902
Deduced a syphon composed of 1632 places in 2 ms
Applied a total of 10554 rules in 10650 ms. Remains 3312 /6254 variables (removed 2942) and now considering 2902/6084 (removed 3182) transitions.
[2023-03-11 07:18:47] [INFO ] Redundant transitions in 285 ms returned []
// Phase 1: matrix 2902 rows 3312 cols
[2023-03-11 07:18:48] [INFO ] Computed 514 place invariants in 556 ms
[2023-03-11 07:18:52] [INFO ] Dead Transitions using invariants and state equation in 4865 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3312/6254 places, 2902/6084 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15834 ms. Remains : 3312/6254 places, 2902/6084 transitions.
Built C files in :
/tmp/ltsmin13873835832987945353
[2023-03-11 07:18:52] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13873835832987945353
Running compilation step : cd /tmp/ltsmin13873835832987945353;'/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/ltsmin13873835832987945353;'/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/ltsmin13873835832987945353;'/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 3 out of 6254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6254/6254 places, 6084/6084 transitions.
Applied a total of 0 rules in 994 ms. Remains 6254 /6254 variables (removed 0) and now considering 6084/6084 (removed 0) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2023-03-11 07:18:56] [INFO ] Computed 514 place invariants in 88 ms
[2023-03-11 07:18:58] [INFO ] Implicit Places using invariants in 2053 ms returned []
[2023-03-11 07:18:58] [INFO ] Invariant cache hit.
[2023-03-11 07:18:59] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 2855 ms to find 0 implicit places.
[2023-03-11 07:18:59] [INFO ] Invariant cache hit.
[2023-03-11 07:19:05] [INFO ] Dead Transitions using invariants and state equation in 5780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9635 ms. Remains : 6254/6254 places, 6084/6084 transitions.
Built C files in :
/tmp/ltsmin11265487754833741411
[2023-03-11 07:19:05] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11265487754833741411
Running compilation step : cd /tmp/ltsmin11265487754833741411;'/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/ltsmin11265487754833741411;'/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/ltsmin11265487754833741411;'/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-11 07:19:08] [INFO ] Flatten gal took : 144 ms
[2023-03-11 07:19:09] [INFO ] Flatten gal took : 140 ms
[2023-03-11 07:19:09] [INFO ] Time to serialize gal into /tmp/LTL17468904592276851515.gal : 37 ms
[2023-03-11 07:19:09] [INFO ] Time to serialize properties into /tmp/LTL13250971173864925555.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/LTL17468904592276851515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18218705484589594805.hoa' '-atoms' '/tmp/LTL13250971173864925555.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...320
Loading property file /tmp/LTL13250971173864925555.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18218705484589594805.hoa
Detected timeout of ITS tools.
[2023-03-11 07:19:24] [INFO ] Flatten gal took : 127 ms
[2023-03-11 07:19:24] [INFO ] Flatten gal took : 140 ms
[2023-03-11 07:19:24] [INFO ] Time to serialize gal into /tmp/LTL14735577578503700539.gal : 42 ms
[2023-03-11 07:19:24] [INFO ] Time to serialize properties into /tmp/LTL17198694220264089108.ltl : 4 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/LTL14735577578503700539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17198694220264089108.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 : !((X((F(G("(p3376!=1)")))U(G("((p5009==0)||(p5098==1))")))))
Formula 0 simplified : X(GF!"(p3376!=1)" R F!"((p5009==0)||(p5098==1))")
Detected timeout of ITS tools.
[2023-03-11 07:19:40] [INFO ] Flatten gal took : 123 ms
[2023-03-11 07:19:40] [INFO ] Applying decomposition
[2023-03-11 07:19:40] [INFO ] Flatten gal took : 125 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/graph7569462187798824509.txt' '-o' '/tmp/graph7569462187798824509.bin' '-w' '/tmp/graph7569462187798824509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7569462187798824509.bin' '-l' '-1' '-v' '-w' '/tmp/graph7569462187798824509.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:19:40] [INFO ] Decomposing Gal with order
[2023-03-11 07:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:19:43] [INFO ] Removed a total of 1108 redundant transitions.
[2023-03-11 07:19:43] [INFO ] Flatten gal took : 426 ms
[2023-03-11 07:19:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2023-03-11 07:19:43] [INFO ] Time to serialize gal into /tmp/LTL16407996861280175114.gal : 56 ms
[2023-03-11 07:19:43] [INFO ] Time to serialize properties into /tmp/LTL14571235557962244577.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/LTL16407996861280175114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14571235557962244577.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((F(G("(i30.i0.i2.i0.u939.p3376!=1)")))U(G("((i47.u1443.p5009==0)||(i48.i0.i1.i1.u1479.p5098==1))")))))
Formula 0 simplified : X(GF!"(i30.i0.i2.i0.u939.p3376!=1)" R F!"((i47.u1443.p5009==0)||(i48.i0.i1.i1.u1479.p5098==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11787681718606656160
[2023-03-11 07:19:58] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11787681718606656160
Running compilation step : cd /tmp/ltsmin11787681718606656160;'/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/ltsmin11787681718606656160;'/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/ltsmin11787681718606656160;'/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 AutoFlight-PT-96b-LTLCardinality-02 finished in 179221 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))'
Support contains 2 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6258 transition count 6089
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6258 transition count 6089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 6258 transition count 6088
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 6255 transition count 6085
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 6254 transition count 6084
Applied a total of 25 rules in 4456 ms. Remains 6254 /6266 variables (removed 12) and now considering 6084/6097 (removed 13) transitions.
[2023-03-11 07:20:06] [INFO ] Invariant cache hit.
[2023-03-11 07:20:08] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2023-03-11 07:20:08] [INFO ] Invariant cache hit.
[2023-03-11 07:20:10] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 3999 ms to find 0 implicit places.
[2023-03-11 07:20:10] [INFO ] Invariant cache hit.
[2023-03-11 07:20:15] [INFO ] Dead Transitions using invariants and state equation in 5334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6266 places, 6084/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13805 ms. Remains : 6254/6266 places, 6084/6097 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s5974 0) (NEQ s4880 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-04 finished in 14026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 4 out of 6266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6265 transition count 3560
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 1 with 2822 rules applied. Total rules applied 5358 place count 3729 transition count 3274
Reduce places removed 190 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 192 rules applied. Total rules applied 5550 place count 3539 transition count 3272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5552 place count 3537 transition count 3272
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 705 Pre rules applied. Total rules applied 5552 place count 3537 transition count 2567
Deduced a syphon composed of 705 places in 33 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 6962 place count 2832 transition count 2567
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 6967 place count 2827 transition count 2562
Iterating global reduction 4 with 5 rules applied. Total rules applied 6972 place count 2827 transition count 2562
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6972 place count 2827 transition count 2558
Deduced a syphon composed of 4 places in 23 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6980 place count 2823 transition count 2558
Performed 1138 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1138 places in 0 ms
Reduce places removed 1138 places and 0 transitions.
Iterating global reduction 4 with 2276 rules applied. Total rules applied 9256 place count 1685 transition count 1276
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 9258 place count 1684 transition count 1276
Applied a total of 9258 rules in 1044 ms. Remains 1684 /6266 variables (removed 4582) and now considering 1276/6097 (removed 4821) transitions.
// Phase 1: matrix 1276 rows 1684 cols
[2023-03-11 07:20:17] [INFO ] Computed 514 place invariants in 20 ms
[2023-03-11 07:20:30] [INFO ] Implicit Places using invariants in 13190 ms returned [505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 673, 674, 675, 676, 677, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 1606, 1610, 1616, 1622, 1628, 1634, 1640, 1646, 1652, 1658, 1664, 1670, 1676, 1683]
Discarding 204 places :
Implicit Place search using SMT only with invariants took 13203 ms to find 204 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1480/6266 places, 1276/6097 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 213 place count 1480 transition count 1063
Reduce places removed 213 places and 0 transitions.
Iterating post reduction 1 with 213 rules applied. Total rules applied 426 place count 1267 transition count 1063
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 460 place count 1233 transition count 1029
Iterating global reduction 2 with 34 rules applied. Total rules applied 494 place count 1233 transition count 1029
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 632 place count 1164 transition count 960
Applied a total of 632 rules in 209 ms. Remains 1164 /1480 variables (removed 316) and now considering 960/1276 (removed 316) transitions.
// Phase 1: matrix 960 rows 1164 cols
[2023-03-11 07:20:30] [INFO ] Computed 288 place invariants in 10 ms
[2023-03-11 07:20:31] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-11 07:20:31] [INFO ] Invariant cache hit.
[2023-03-11 07:20:31] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-03-11 07:20:34] [INFO ] Implicit Places using invariants and state equation in 3292 ms returned []
Implicit Place search using SMT with State Equation took 3962 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1164/6266 places, 960/6097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18418 ms. Remains : 1164/6266 places, 960/6097 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1049 0) (EQ s511 1)), p1:(OR (EQ s1130 0) (EQ s508 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39536 steps with 190 reset in 492 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-07 finished in 19023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 6266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2544 transitions
Trivial Post-agglo rules discarded 2544 transitions
Performed 2544 trivial Post agglomeration. Transition count delta: 2544
Iterating post reduction 0 with 2544 rules applied. Total rules applied 2544 place count 6265 transition count 3552
Reduce places removed 2544 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2833 rules applied. Total rules applied 5377 place count 3721 transition count 3263
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 2 with 192 rules applied. Total rules applied 5569 place count 3529 transition count 3263
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 701 Pre rules applied. Total rules applied 5569 place count 3529 transition count 2562
Deduced a syphon composed of 701 places in 41 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 3 with 1402 rules applied. Total rules applied 6971 place count 2828 transition count 2562
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 6976 place count 2823 transition count 2557
Iterating global reduction 3 with 5 rules applied. Total rules applied 6981 place count 2823 transition count 2557
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6981 place count 2823 transition count 2553
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 6989 place count 2819 transition count 2553
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 0 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 3 with 2286 rules applied. Total rules applied 9275 place count 1676 transition count 1266
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9276 place count 1675 transition count 1265
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 3 with 286 rules applied. Total rules applied 9562 place count 1484 transition count 1170
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 9657 place count 1389 transition count 1170
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 9657 place count 1389 transition count 1074
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 9849 place count 1293 transition count 1074
Applied a total of 9849 rules in 1025 ms. Remains 1293 /6266 variables (removed 4973) and now considering 1074/6097 (removed 5023) transitions.
// Phase 1: matrix 1074 rows 1293 cols
[2023-03-11 07:20:36] [INFO ] Computed 323 place invariants in 4 ms
[2023-03-11 07:20:37] [INFO ] Implicit Places using invariants in 1013 ms returned [506, 580, 654, 692, 730, 804, 878, 916, 954, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1148, 1150, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1220, 1222, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1243, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1283, 1287, 1292]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1188/6266 places, 1074/6097 transitions.
Graph (trivial) has 496 edges and 1188 vertex of which 24 / 1188 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 81 place count 1085 transition count 949
Iterating global reduction 0 with 80 rules applied. Total rules applied 161 place count 1085 transition count 949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 165 place count 1081 transition count 945
Iterating global reduction 0 with 4 rules applied. Total rules applied 169 place count 1081 transition count 945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 173 place count 1077 transition count 941
Iterating global reduction 0 with 4 rules applied. Total rules applied 177 place count 1077 transition count 941
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 181 place count 1073 transition count 937
Iterating global reduction 0 with 4 rules applied. Total rules applied 185 place count 1073 transition count 937
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 189 place count 1069 transition count 933
Iterating global reduction 0 with 4 rules applied. Total rules applied 193 place count 1069 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 197 place count 1065 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 201 place count 1065 transition count 929
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 205 place count 1061 transition count 925
Iterating global reduction 0 with 4 rules applied. Total rules applied 209 place count 1061 transition count 925
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 213 place count 1057 transition count 921
Iterating global reduction 0 with 4 rules applied. Total rules applied 217 place count 1057 transition count 921
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 221 place count 1053 transition count 917
Iterating global reduction 0 with 4 rules applied. Total rules applied 225 place count 1053 transition count 917
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 229 place count 1049 transition count 913
Iterating global reduction 0 with 4 rules applied. Total rules applied 233 place count 1049 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 237 place count 1045 transition count 909
Iterating global reduction 0 with 4 rules applied. Total rules applied 241 place count 1045 transition count 909
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 245 place count 1041 transition count 905
Iterating global reduction 0 with 4 rules applied. Total rules applied 249 place count 1041 transition count 905
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 253 place count 1037 transition count 901
Iterating global reduction 0 with 4 rules applied. Total rules applied 257 place count 1037 transition count 901
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 259 place count 1035 transition count 899
Iterating global reduction 0 with 2 rules applied. Total rules applied 261 place count 1035 transition count 899
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 263 place count 1033 transition count 897
Iterating global reduction 0 with 2 rules applied. Total rules applied 265 place count 1033 transition count 897
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 267 place count 1031 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 269 place count 1031 transition count 895
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 271 place count 1029 transition count 893
Iterating global reduction 0 with 2 rules applied. Total rules applied 273 place count 1029 transition count 893
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 275 place count 1027 transition count 891
Iterating global reduction 0 with 2 rules applied. Total rules applied 277 place count 1027 transition count 891
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 279 place count 1025 transition count 889
Iterating global reduction 0 with 2 rules applied. Total rules applied 281 place count 1025 transition count 889
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 283 place count 1023 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 285 place count 1023 transition count 887
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 287 place count 1021 transition count 885
Iterating global reduction 0 with 2 rules applied. Total rules applied 289 place count 1021 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 291 place count 1019 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 293 place count 1019 transition count 883
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 295 place count 1017 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 297 place count 1017 transition count 881
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 299 place count 1015 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 301 place count 1015 transition count 879
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 303 place count 1013 transition count 877
Iterating global reduction 0 with 2 rules applied. Total rules applied 305 place count 1013 transition count 877
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 0 with 2 rules applied. Total rules applied 307 place count 1012 transition count 876
Applied a total of 307 rules in 721 ms. Remains 1012 /1188 variables (removed 176) and now considering 876/1074 (removed 198) transitions.
// Phase 1: matrix 876 rows 1012 cols
[2023-03-11 07:20:37] [INFO ] Computed 218 place invariants in 10 ms
[2023-03-11 07:20:38] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-11 07:20:38] [INFO ] Invariant cache hit.
[2023-03-11 07:20:39] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1012/6266 places, 876/6097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4921 ms. Remains : 1012/6266 places, 876/6097 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s505 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26923 steps with 120 reset in 268 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-08 finished in 5276 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(p1)||p0)))'
Support contains 3 out of 6266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2538 transitions
Trivial Post-agglo rules discarded 2538 transitions
Performed 2538 trivial Post agglomeration. Transition count delta: 2538
Iterating post reduction 0 with 2538 rules applied. Total rules applied 2538 place count 6265 transition count 3558
Reduce places removed 2538 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2827 rules applied. Total rules applied 5365 place count 3727 transition count 3269
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5558 place count 3535 transition count 3268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5559 place count 3534 transition count 3268
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5559 place count 3534 transition count 2566
Deduced a syphon composed of 702 places in 26 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6963 place count 2832 transition count 2566
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6967 place count 2828 transition count 2562
Iterating global reduction 4 with 4 rules applied. Total rules applied 6971 place count 2828 transition count 2562
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6971 place count 2828 transition count 2559
Deduced a syphon composed of 3 places in 28 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6977 place count 2825 transition count 2559
Performed 1143 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1143 places in 0 ms
Reduce places removed 1143 places and 0 transitions.
Iterating global reduction 4 with 2286 rules applied. Total rules applied 9263 place count 1682 transition count 1272
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9264 place count 1681 transition count 1271
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 4 with 286 rules applied. Total rules applied 9550 place count 1490 transition count 1176
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 5 with 95 rules applied. Total rules applied 9645 place count 1395 transition count 1176
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9645 place count 1395 transition count 1080
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9837 place count 1299 transition count 1080
Applied a total of 9837 rules in 1082 ms. Remains 1299 /6266 variables (removed 4967) and now considering 1080/6097 (removed 5017) transitions.
// Phase 1: matrix 1080 rows 1299 cols
[2023-03-11 07:20:41] [INFO ] Computed 323 place invariants in 19 ms
[2023-03-11 07:20:42] [INFO ] Implicit Places using invariants in 1015 ms returned [510, 584, 660, 698, 736, 810, 884, 922, 960, 964, 968, 972, 976, 980, 984, 988, 992, 996, 1000, 1004, 1008, 1012, 1016, 1020, 1024, 1028, 1032, 1036, 1040, 1044, 1048, 1052, 1056, 1060, 1064, 1068, 1072, 1076, 1080, 1084, 1088, 1092, 1096, 1100, 1104, 1108, 1112, 1116, 1120, 1124, 1128, 1132, 1136, 1140, 1144, 1148, 1152, 1154, 1156, 1158, 1160, 1162, 1164, 1166, 1168, 1170, 1172, 1174, 1176, 1180, 1184, 1188, 1192, 1196, 1200, 1204, 1208, 1212, 1216, 1220, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1285, 1289, 1293, 1298]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1017 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1194/6266 places, 1080/6097 transitions.
Graph (trivial) has 496 edges and 1194 vertex of which 24 / 1194 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 81 place count 1091 transition count 955
Iterating global reduction 0 with 80 rules applied. Total rules applied 161 place count 1091 transition count 955
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 165 place count 1087 transition count 951
Iterating global reduction 0 with 4 rules applied. Total rules applied 169 place count 1087 transition count 951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 173 place count 1083 transition count 947
Iterating global reduction 0 with 4 rules applied. Total rules applied 177 place count 1083 transition count 947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 181 place count 1079 transition count 943
Iterating global reduction 0 with 4 rules applied. Total rules applied 185 place count 1079 transition count 943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 189 place count 1075 transition count 939
Iterating global reduction 0 with 4 rules applied. Total rules applied 193 place count 1075 transition count 939
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 197 place count 1071 transition count 935
Iterating global reduction 0 with 4 rules applied. Total rules applied 201 place count 1071 transition count 935
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 205 place count 1067 transition count 931
Iterating global reduction 0 with 4 rules applied. Total rules applied 209 place count 1067 transition count 931
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 213 place count 1063 transition count 927
Iterating global reduction 0 with 4 rules applied. Total rules applied 217 place count 1063 transition count 927
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 220 place count 1060 transition count 924
Iterating global reduction 0 with 3 rules applied. Total rules applied 223 place count 1060 transition count 924
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 226 place count 1057 transition count 921
Iterating global reduction 0 with 3 rules applied. Total rules applied 229 place count 1057 transition count 921
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 232 place count 1054 transition count 918
Iterating global reduction 0 with 3 rules applied. Total rules applied 235 place count 1054 transition count 918
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 238 place count 1051 transition count 915
Iterating global reduction 0 with 3 rules applied. Total rules applied 241 place count 1051 transition count 915
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 244 place count 1048 transition count 912
Iterating global reduction 0 with 3 rules applied. Total rules applied 247 place count 1048 transition count 912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 249 place count 1046 transition count 910
Iterating global reduction 0 with 2 rules applied. Total rules applied 251 place count 1046 transition count 910
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 253 place count 1044 transition count 908
Iterating global reduction 0 with 2 rules applied. Total rules applied 255 place count 1044 transition count 908
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1042 transition count 906
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1042 transition count 906
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1040 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1040 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1038 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1038 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1036 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1036 transition count 900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1034 transition count 898
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1034 transition count 898
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1032 transition count 896
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1032 transition count 896
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 281 place count 1030 transition count 894
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 1030 transition count 894
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 1028 transition count 892
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 1028 transition count 892
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 289 place count 1026 transition count 890
Iterating global reduction 0 with 2 rules applied. Total rules applied 291 place count 1026 transition count 890
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 293 place count 1024 transition count 888
Iterating global reduction 0 with 2 rules applied. Total rules applied 295 place count 1024 transition count 888
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 0 with 2 rules applied. Total rules applied 297 place count 1023 transition count 887
Applied a total of 297 rules in 784 ms. Remains 1023 /1194 variables (removed 171) and now considering 887/1080 (removed 193) transitions.
// Phase 1: matrix 887 rows 1023 cols
[2023-03-11 07:20:43] [INFO ] Computed 218 place invariants in 9 ms
[2023-03-11 07:20:43] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 07:20:43] [INFO ] Invariant cache hit.
[2023-03-11 07:20:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:20:45] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1023/6266 places, 887/6097 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5230 ms. Remains : 1023/6266 places, 887/6097 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s606 0) (EQ s143 1)), p1:(EQ s225 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 445 reset in 1036 ms.
Product exploration explored 100000 steps with 445 reset in 1143 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 228765 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228765 steps, saw 88107 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:20:51] [INFO ] Invariant cache hit.
[2023-03-11 07:20:52] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:20:52] [INFO ] [Nat]Absence check using 218 positive place invariants in 37 ms returned sat
[2023-03-11 07:20:52] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:20:53] [INFO ] After 158ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:20:53] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-11 07:20:53] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 584 steps, including 2 resets, run visited all 2 properties in 23 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 23 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1023 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1023/1023 places, 887/887 transitions.
Applied a total of 0 rules in 55 ms. Remains 1023 /1023 variables (removed 0) and now considering 887/887 (removed 0) transitions.
[2023-03-11 07:20:53] [INFO ] Invariant cache hit.
[2023-03-11 07:20:54] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-11 07:20:54] [INFO ] Invariant cache hit.
[2023-03-11 07:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:20:56] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2023-03-11 07:20:56] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 07:20:56] [INFO ] Invariant cache hit.
[2023-03-11 07:20:56] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2576 ms. Remains : 1023/1023 places, 887/887 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 219143 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219143 steps, saw 87098 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 07:21:00] [INFO ] Invariant cache hit.
[2023-03-11 07:21:00] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:21:00] [INFO ] [Nat]Absence check using 218 positive place invariants in 105 ms returned sat
[2023-03-11 07:21:01] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:21:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:21:01] [INFO ] After 96ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:21:01] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-11 07:21:01] [INFO ] After 1232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 43 ms.
Support contains 3 out of 1023 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1023/1023 places, 887/887 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1023 transition count 886
Free-agglomeration rule applied 369 times.
Iterating global reduction 1 with 369 rules applied. Total rules applied 370 place count 1023 transition count 517
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t640.t1253 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 501 edges and 437 vertex of which 271 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 270 places
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 1 with 153 rules applied. Total rules applied 523 place count 167 transition count 365
Reduce places removed 148 places and 0 transitions.
Drop transitions removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 2 with 492 rules applied. Total rules applied 1015 place count 19 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1015 place count 19 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1019 place count 17 transition count 19
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1020 place count 16 transition count 18
Iterating global reduction 3 with 1 rules applied. Total rules applied 1021 place count 16 transition count 18
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 1023 place count 15 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1024 place count 14 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 1025 place count 14 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1026 place count 14 transition count 15
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1030 place count 14 transition count 11
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1034 place count 10 transition count 11
Applied a total of 1034 rules in 85 ms. Remains 10 /1023 variables (removed 1013) and now considering 11/887 (removed 876) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 10/1023 places, 11/887 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 3 factoid took 307 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 444 reset in 1035 ms.
Product exploration explored 100000 steps with 442 reset in 1113 ms.
Built C files in :
/tmp/ltsmin13858774912193118403
[2023-03-11 07:21:04] [INFO ] Computing symmetric may disable matrix : 887 transitions.
[2023-03-11 07:21:04] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:04] [INFO ] Computing symmetric may enable matrix : 887 transitions.
[2023-03-11 07:21:04] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:05] [INFO ] Computing Do-Not-Accords matrix : 887 transitions.
[2023-03-11 07:21:05] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:05] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13858774912193118403
Running compilation step : cd /tmp/ltsmin13858774912193118403;'/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'
Compilation finished in 2380 ms.
Running link step : cd /tmp/ltsmin13858774912193118403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin13858774912193118403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7676995424226519431.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1023 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1023/1023 places, 887/887 transitions.
Applied a total of 0 rules in 29 ms. Remains 1023 /1023 variables (removed 0) and now considering 887/887 (removed 0) transitions.
[2023-03-11 07:21:19] [INFO ] Invariant cache hit.
[2023-03-11 07:21:20] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-11 07:21:20] [INFO ] Invariant cache hit.
[2023-03-11 07:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:21:22] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2023-03-11 07:21:22] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 07:21:22] [INFO ] Invariant cache hit.
[2023-03-11 07:21:22] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2708 ms. Remains : 1023/1023 places, 887/887 transitions.
Built C files in :
/tmp/ltsmin9496209615420975173
[2023-03-11 07:21:22] [INFO ] Computing symmetric may disable matrix : 887 transitions.
[2023-03-11 07:21:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:22] [INFO ] Computing symmetric may enable matrix : 887 transitions.
[2023-03-11 07:21:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:22] [INFO ] Computing Do-Not-Accords matrix : 887 transitions.
[2023-03-11 07:21:22] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:21:22] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9496209615420975173
Running compilation step : cd /tmp/ltsmin9496209615420975173;'/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'
Compilation finished in 2490 ms.
Running link step : cd /tmp/ltsmin9496209615420975173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin9496209615420975173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9298760886457837238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:21:37] [INFO ] Flatten gal took : 26 ms
[2023-03-11 07:21:37] [INFO ] Flatten gal took : 23 ms
[2023-03-11 07:21:37] [INFO ] Time to serialize gal into /tmp/LTL17104292163905806734.gal : 4 ms
[2023-03-11 07:21:37] [INFO ] Time to serialize properties into /tmp/LTL129959044371065294.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/LTL17104292163905806734.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16121751283133515247.hoa' '-atoms' '/tmp/LTL129959044371065294.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/LTL129959044371065294.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16121751283133515247.hoa
Detected timeout of ITS tools.
[2023-03-11 07:21:52] [INFO ] Flatten gal took : 48 ms
[2023-03-11 07:21:53] [INFO ] Flatten gal took : 27 ms
[2023-03-11 07:21:53] [INFO ] Time to serialize gal into /tmp/LTL6068950070759058217.gal : 4 ms
[2023-03-11 07:21:53] [INFO ] Time to serialize properties into /tmp/LTL4148906502917932504.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/LTL6068950070759058217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4148906502917932504.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 : !((G(("((p5200==0)||(p1199==1))")||(F("(p1646==1)")))))
Formula 0 simplified : F(!"((p5200==0)||(p1199==1))" & G!"(p1646==1)")
Detected timeout of ITS tools.
[2023-03-11 07:22:08] [INFO ] Flatten gal took : 60 ms
[2023-03-11 07:22:08] [INFO ] Applying decomposition
[2023-03-11 07:22:08] [INFO ] Flatten gal took : 23 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/graph1574612155138359365.txt' '-o' '/tmp/graph1574612155138359365.bin' '-w' '/tmp/graph1574612155138359365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1574612155138359365.bin' '-l' '-1' '-v' '-w' '/tmp/graph1574612155138359365.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:22:08] [INFO ] Decomposing Gal with order
[2023-03-11 07:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:22:08] [INFO ] Removed a total of 10 redundant transitions.
[2023-03-11 07:22:08] [INFO ] Flatten gal took : 55 ms
[2023-03-11 07:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-11 07:22:08] [INFO ] Time to serialize gal into /tmp/LTL6653470064197156480.gal : 9 ms
[2023-03-11 07:22:08] [INFO ] Time to serialize properties into /tmp/LTL13551132140762384232.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/LTL6653470064197156480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13551132140762384232.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(("((i12.i0.i4.u257.p5200==0)||(i3.i0.i0.u60.p1199==1))")||(F("(i5.u96.p1646==1)")))))
Formula 0 simplified : F(!"((i12.i0.i4.u257.p5200==0)||(i3.i0.i0.u60.p1199==1))" & G!"(i5.u96.p1646==1)")
Reverse transition relation is NOT exact ! Due to transitions i5.t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total)...168
Computing Next relation with stutter on 2.76731e+24 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1377 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.8808,739832,1,0,658086,1.1652e+06,11029,1.25202e+06,3718,4.48002e+06,145431
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-96b-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-96b-LTLCardinality-10 finished in 103237 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 U (F(G((p2 U X(!p0))))||p1)))))'
Support contains 7 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6259 transition count 6090
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6259 transition count 6090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 6259 transition count 6089
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 6256 transition count 6086
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 6256 transition count 6086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 6255 transition count 6085
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 6255 transition count 6085
Applied a total of 23 rules in 4513 ms. Remains 6255 /6266 variables (removed 11) and now considering 6085/6097 (removed 12) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2023-03-11 07:22:28] [INFO ] Computed 514 place invariants in 69 ms
[2023-03-11 07:22:29] [INFO ] Implicit Places using invariants in 1817 ms returned []
[2023-03-11 07:22:29] [INFO ] Invariant cache hit.
[2023-03-11 07:22:31] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 3618 ms to find 0 implicit places.
[2023-03-11 07:22:31] [INFO ] Invariant cache hit.
[2023-03-11 07:22:37] [INFO ] Dead Transitions using invariants and state equation in 5635 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6266 places, 6085/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13768 ms. Remains : 6255/6266 places, 6085/6097 transitions.
Stuttering acceptance computed with spot in 577 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s591 0) (EQ s4736 1)), p0:(OR (EQ s737 0) (EQ s889 1)), p2:(AND (EQ s3949 1) (OR (EQ s575 0) (EQ s169 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 834 ms.
Product exploration explored 100000 steps with 26 reset in 938 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 5410 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 07:22:46] [INFO ] Invariant cache hit.
[2023-03-11 07:22:47] [INFO ] After 1178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 07:22:49] [INFO ] [Nat]Absence check using 513 positive place invariants in 603 ms returned sat
[2023-03-11 07:22:49] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 32 ms returned sat
[2023-03-11 07:22:56] [INFO ] After 6126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 07:22:59] [INFO ] Deduced a trap composed of 384 places in 2766 ms of which 3 ms to minimize.
[2023-03-11 07:23:02] [INFO ] Deduced a trap composed of 121 places in 2756 ms of which 4 ms to minimize.
[2023-03-11 07:23:05] [INFO ] Deduced a trap composed of 470 places in 3185 ms of which 5 ms to minimize.
[2023-03-11 07:23:09] [INFO ] Deduced a trap composed of 1022 places in 3564 ms of which 4 ms to minimize.
[2023-03-11 07:23:13] [INFO ] Deduced a trap composed of 1065 places in 3819 ms of which 3 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-11 07:23:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 07:23:13] [INFO ] After 26552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 905 ms.
Support contains 7 out of 6255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Drop transitions removed 2537 transitions
Trivial Post-agglo rules discarded 2537 transitions
Performed 2537 trivial Post agglomeration. Transition count delta: 2537
Iterating post reduction 0 with 2537 rules applied. Total rules applied 2537 place count 6255 transition count 3548
Reduce places removed 2537 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2825 rules applied. Total rules applied 5362 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5555 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5556 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5556 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 34 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6958 place count 2824 transition count 2558
Performed 1140 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1140 places in 1 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9238 place count 1684 transition count 1276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9240 place count 1684 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 287 times.
Iterating global reduction 5 with 287 rules applied. Total rules applied 9527 place count 1684 transition count 987
Reduce places removed 287 places and 0 transitions.
Iterating post reduction 5 with 287 rules applied. Total rules applied 9814 place count 1397 transition count 987
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9815 place count 1396 transition count 986
Reduce places removed 165 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 6 with 247 rules applied. Total rules applied 10062 place count 1231 transition count 904
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 7 with 82 rules applied. Total rules applied 10144 place count 1149 transition count 904
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 83 Pre rules applied. Total rules applied 10144 place count 1149 transition count 821
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 8 with 166 rules applied. Total rules applied 10310 place count 1066 transition count 821
Applied a total of 10310 rules in 905 ms. Remains 1066 /6255 variables (removed 5189) and now considering 821/6085 (removed 5264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 1066/6255 places, 821/6085 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 821 rows 1066 cols
[2023-03-11 07:23:16] [INFO ] Computed 349 place invariants in 4 ms
[2023-03-11 07:23:16] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:23:16] [INFO ] [Nat]Absence check using 347 positive place invariants in 44 ms returned sat
[2023-03-11 07:23:16] [INFO ] [Nat]Absence check using 347 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-11 07:23:17] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:23:17] [INFO ] State equation strengthened by 599 read => feed constraints.
[2023-03-11 07:23:17] [INFO ] After 252ms SMT Verify possible using 599 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:23:17] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-11 07:23:18] [INFO ] Deduced a trap composed of 647 places in 287 ms of which 0 ms to minimize.
[2023-03-11 07:23:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 518 ms
[2023-03-11 07:23:18] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 07:23:18] [INFO ] After 1733ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 139 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p2))), (X (X p0)), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (AND p2 p0))]
Knowledge based reduction with 21 factoid took 1301 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 6255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6255/6255 places, 6085/6085 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2536 transitions
Trivial Post-agglo rules discarded 2536 transitions
Performed 2536 trivial Post agglomeration. Transition count delta: 2536
Iterating post reduction 0 with 2536 rules applied. Total rules applied 2536 place count 6254 transition count 3548
Reduce places removed 2536 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2824 rules applied. Total rules applied 5360 place count 3718 transition count 3260
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5553 place count 3526 transition count 3259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5554 place count 3525 transition count 3259
Performed 701 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 701 Pre rules applied. Total rules applied 5554 place count 3525 transition count 2558
Deduced a syphon composed of 701 places in 34 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 4 with 1402 rules applied. Total rules applied 6956 place count 2824 transition count 2558
Performed 1140 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1140 places in 1 ms
Reduce places removed 1140 places and 0 transitions.
Iterating global reduction 4 with 2280 rules applied. Total rules applied 9236 place count 1684 transition count 1276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9238 place count 1684 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9239 place count 1683 transition count 1273
Reduce places removed 165 places and 0 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 5 with 247 rules applied. Total rules applied 9486 place count 1518 transition count 1191
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 9568 place count 1436 transition count 1191
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 83 Pre rules applied. Total rules applied 9568 place count 1436 transition count 1108
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 166 rules applied. Total rules applied 9734 place count 1353 transition count 1108
Applied a total of 9734 rules in 829 ms. Remains 1353 /6255 variables (removed 4902) and now considering 1108/6085 (removed 4977) transitions.
// Phase 1: matrix 1108 rows 1353 cols
[2023-03-11 07:23:20] [INFO ] Computed 349 place invariants in 10 ms
[2023-03-11 07:23:21] [INFO ] Implicit Places using invariants in 1057 ms returned [537, 611, 725, 763, 837, 911, 949, 987, 993, 1000, 1006, 1012, 1018, 1024, 1030, 1036, 1042, 1048, 1054, 1060, 1066, 1071, 1075, 1079, 1083, 1087, 1091, 1095, 1099, 1103, 1107, 1111, 1115, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1151, 1155, 1159, 1163, 1167, 1171, 1175, 1179, 1183, 1187, 1191, 1195, 1199, 1203, 1207, 1209, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1225, 1227, 1229, 1231, 1235, 1239, 1243, 1247, 1251, 1255, 1259, 1263, 1267, 1271, 1275, 1279, 1281, 1283, 1285, 1287, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1303, 1307, 1311, 1315, 1319, 1323, 1327, 1331, 1335, 1339, 1343, 1347, 1352]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1074 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/6255 places, 1108/6085 transitions.
Graph (trivial) has 493 edges and 1249 vertex of which 25 / 1249 are part of one of the 1 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 79 place count 1147 transition count 983
Iterating global reduction 0 with 78 rules applied. Total rules applied 157 place count 1147 transition count 983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 160 place count 1144 transition count 980
Iterating global reduction 0 with 3 rules applied. Total rules applied 163 place count 1144 transition count 980
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 166 place count 1141 transition count 977
Iterating global reduction 0 with 3 rules applied. Total rules applied 169 place count 1141 transition count 977
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 172 place count 1138 transition count 974
Iterating global reduction 0 with 3 rules applied. Total rules applied 175 place count 1138 transition count 974
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 178 place count 1135 transition count 971
Iterating global reduction 0 with 3 rules applied. Total rules applied 181 place count 1135 transition count 971
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 184 place count 1132 transition count 968
Iterating global reduction 0 with 3 rules applied. Total rules applied 187 place count 1132 transition count 968
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 190 place count 1129 transition count 965
Iterating global reduction 0 with 3 rules applied. Total rules applied 193 place count 1129 transition count 965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 196 place count 1126 transition count 962
Iterating global reduction 0 with 3 rules applied. Total rules applied 199 place count 1126 transition count 962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 202 place count 1123 transition count 959
Iterating global reduction 0 with 3 rules applied. Total rules applied 205 place count 1123 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 208 place count 1120 transition count 956
Iterating global reduction 0 with 3 rules applied. Total rules applied 211 place count 1120 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 214 place count 1117 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 217 place count 1117 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 220 place count 1114 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 223 place count 1114 transition count 950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 226 place count 1111 transition count 947
Iterating global reduction 0 with 3 rules applied. Total rules applied 229 place count 1111 transition count 947
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 231 place count 1109 transition count 945
Iterating global reduction 0 with 2 rules applied. Total rules applied 233 place count 1109 transition count 945
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 235 place count 1107 transition count 943
Iterating global reduction 0 with 2 rules applied. Total rules applied 237 place count 1107 transition count 943
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 239 place count 1105 transition count 941
Iterating global reduction 0 with 2 rules applied. Total rules applied 241 place count 1105 transition count 941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 243 place count 1103 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 245 place count 1103 transition count 939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 247 place count 1101 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 249 place count 1101 transition count 937
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 251 place count 1099 transition count 935
Iterating global reduction 0 with 2 rules applied. Total rules applied 253 place count 1099 transition count 935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 255 place count 1097 transition count 933
Iterating global reduction 0 with 2 rules applied. Total rules applied 257 place count 1097 transition count 933
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 259 place count 1095 transition count 931
Iterating global reduction 0 with 2 rules applied. Total rules applied 261 place count 1095 transition count 931
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 263 place count 1093 transition count 929
Iterating global reduction 0 with 2 rules applied. Total rules applied 265 place count 1093 transition count 929
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 267 place count 1091 transition count 927
Iterating global reduction 0 with 2 rules applied. Total rules applied 269 place count 1091 transition count 927
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 271 place count 1089 transition count 925
Iterating global reduction 0 with 2 rules applied. Total rules applied 273 place count 1089 transition count 925
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 275 place count 1087 transition count 923
Iterating global reduction 0 with 2 rules applied. Total rules applied 277 place count 1087 transition count 923
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 281 place count 1085 transition count 921
Applied a total of 281 rules in 767 ms. Remains 1085 /1249 variables (removed 164) and now considering 921/1108 (removed 187) transitions.
// Phase 1: matrix 921 rows 1085 cols
[2023-03-11 07:23:22] [INFO ] Computed 245 place invariants in 11 ms
[2023-03-11 07:23:23] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 07:23:23] [INFO ] Invariant cache hit.
[2023-03-11 07:23:23] [INFO ] State equation strengthened by 253 read => feed constraints.
[2023-03-11 07:23:30] [INFO ] Implicit Places using invariants and state equation in 7141 ms returned [510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 7690 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1072/6255 places, 921/6085 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 1072 transition count 908
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1059 transition count 908
Applied a total of 26 rules in 69 ms. Remains 1059 /1072 variables (removed 13) and now considering 908/921 (removed 13) transitions.
// Phase 1: matrix 908 rows 1059 cols
[2023-03-11 07:23:30] [INFO ] Computed 232 place invariants in 5 ms
[2023-03-11 07:23:30] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-11 07:23:30] [INFO ] Invariant cache hit.
[2023-03-11 07:23:31] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 07:23:35] [INFO ] Implicit Places using invariants and state equation in 4941 ms returned []
Implicit Place search using SMT with State Equation took 5452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1059/6255 places, 908/6085 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15881 ms. Remains : 1059/6255 places, 908/6085 transitions.
Computed a total of 18 stabilizing places and 4 stable transitions
Computed a total of 18 stabilizing places and 4 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 307607 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307607 steps, saw 99506 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:23:39] [INFO ] Invariant cache hit.
[2023-03-11 07:23:39] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:23:39] [INFO ] [Nat]Absence check using 232 positive place invariants in 75 ms returned sat
[2023-03-11 07:23:40] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:23:40] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 07:23:40] [INFO ] After 147ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:23:40] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2023-03-11 07:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-11 07:23:40] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-11 07:23:40] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 908/908 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1059 transition count 905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1057 transition count 905
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 1054 transition count 902
Free-agglomeration rule applied 367 times.
Iterating global reduction 2 with 367 rules applied. Total rules applied 378 place count 1054 transition count 535
Reduce places removed 367 places and 0 transitions.
Iterating post reduction 2 with 367 rules applied. Total rules applied 745 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 748 place count 684 transition count 532
Iterating global reduction 3 with 3 rules applied. Total rules applied 751 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 754 place count 681 transition count 529
Iterating global reduction 3 with 3 rules applied. Total rules applied 757 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 760 place count 678 transition count 526
Iterating global reduction 3 with 3 rules applied. Total rules applied 763 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 766 place count 675 transition count 523
Iterating global reduction 3 with 3 rules applied. Total rules applied 769 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 772 place count 672 transition count 520
Iterating global reduction 3 with 3 rules applied. Total rules applied 775 place count 672 transition count 520
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 778 place count 669 transition count 517
Iterating global reduction 3 with 3 rules applied. Total rules applied 781 place count 669 transition count 517
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 784 place count 666 transition count 514
Iterating global reduction 3 with 3 rules applied. Total rules applied 787 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 789 place count 664 transition count 512
Iterating global reduction 3 with 2 rules applied. Total rules applied 791 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 793 place count 662 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 795 place count 662 transition count 510
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 797 place count 660 transition count 508
Iterating global reduction 3 with 2 rules applied. Total rules applied 799 place count 660 transition count 508
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 801 place count 658 transition count 506
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 658 transition count 506
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 805 place count 656 transition count 504
Iterating global reduction 3 with 2 rules applied. Total rules applied 807 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 808 place count 655 transition count 503
Iterating global reduction 3 with 1 rules applied. Total rules applied 809 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 810 place count 654 transition count 502
Iterating global reduction 3 with 1 rules applied. Total rules applied 811 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 812 place count 653 transition count 501
Iterating global reduction 3 with 1 rules applied. Total rules applied 813 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 814 place count 652 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 815 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 816 place count 651 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 817 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 818 place count 650 transition count 498
Iterating global reduction 3 with 1 rules applied. Total rules applied 819 place count 650 transition count 498
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 820 place count 649 transition count 497
Iterating global reduction 3 with 1 rules applied. Total rules applied 821 place count 649 transition count 497
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 822 place count 648 transition count 496
Iterating global reduction 3 with 1 rules applied. Total rules applied 823 place count 648 transition count 496
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 824 place count 647 transition count 495
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 647 transition count 495
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 826 place count 646 transition count 494
Iterating global reduction 3 with 1 rules applied. Total rules applied 827 place count 646 transition count 494
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 828 place count 645 transition count 493
Iterating global reduction 3 with 1 rules applied. Total rules applied 829 place count 645 transition count 493
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 830 place count 644 transition count 492
Iterating global reduction 3 with 1 rules applied. Total rules applied 831 place count 644 transition count 492
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 832 place count 644 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 833 place count 643 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 643 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 835 place count 642 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 642 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 641 transition count 489
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t201.t1251.t724 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 479 edges and 411 vertex of which 259 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 258 places
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 4 with 144 rules applied. Total rules applied 981 place count 153 transition count 346
Reduce places removed 142 places and 0 transitions.
Drop transitions removed 334 transitions
Reduce isomorphic transitions removed 334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 477 rules applied. Total rules applied 1458 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1459 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1459 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1461 place count 9 transition count 10
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 7 with 2 rules applied. Total rules applied 1463 place count 8 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1466 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1469 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1470 place count 5 transition count 5
Applied a total of 1470 rules in 414 ms. Remains 5 /1059 variables (removed 1054) and now considering 5/908 (removed 903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 5/1059 places, 5/908 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 439 reset in 1048 ms.
Product exploration explored 100000 steps with 440 reset in 1082 ms.
Built C files in :
/tmp/ltsmin1495772105022618111
[2023-03-11 07:23:43] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-03-11 07:23:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:23:43] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-03-11 07:23:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:23:43] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-03-11 07:23:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:23:43] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1495772105022618111
Running compilation step : cd /tmp/ltsmin1495772105022618111;'/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'
Compilation finished in 2437 ms.
Running link step : cd /tmp/ltsmin1495772105022618111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin1495772105022618111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13331861564050907947.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1059/1059 places, 908/908 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 3 place count 1056 transition count 904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1054 transition count 904
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1052 transition count 902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1050 transition count 900
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 26 rules applied. Total rules applied 37 place count 1037 transition count 887
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 50 place count 1024 transition count 887
Applied a total of 50 rules in 94 ms. Remains 1024 /1059 variables (removed 35) and now considering 887/908 (removed 21) transitions.
// Phase 1: matrix 887 rows 1024 cols
[2023-03-11 07:23:58] [INFO ] Computed 218 place invariants in 9 ms
[2023-03-11 07:23:59] [INFO ] Implicit Places using invariants in 524 ms returned [649]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1023/1059 places, 887/908 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1022 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1022 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1021 transition count 885
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1021 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1020 transition count 884
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1020 transition count 884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1019 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1019 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1018 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1018 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1017 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1017 transition count 881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1016 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1016 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1015 transition count 879
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1015 transition count 879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1014 transition count 878
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1014 transition count 878
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1013 transition count 877
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1013 transition count 877
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1012 transition count 876
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1012 transition count 876
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1011 transition count 875
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1011 transition count 875
Applied a total of 24 rules in 293 ms. Remains 1011 /1023 variables (removed 12) and now considering 875/887 (removed 12) transitions.
// Phase 1: matrix 875 rows 1011 cols
[2023-03-11 07:23:59] [INFO ] Computed 217 place invariants in 6 ms
[2023-03-11 07:24:00] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-11 07:24:00] [INFO ] Invariant cache hit.
[2023-03-11 07:24:01] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 2200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1011/1059 places, 875/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3113 ms. Remains : 1011/1059 places, 875/908 transitions.
Built C files in :
/tmp/ltsmin9720599946088208309
[2023-03-11 07:24:01] [INFO ] Computing symmetric may disable matrix : 875 transitions.
[2023-03-11 07:24:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:24:01] [INFO ] Computing symmetric may enable matrix : 875 transitions.
[2023-03-11 07:24:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:24:01] [INFO ] Computing Do-Not-Accords matrix : 875 transitions.
[2023-03-11 07:24:01] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:24:01] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9720599946088208309
Running compilation step : cd /tmp/ltsmin9720599946088208309;'/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'
Compilation finished in 2373 ms.
Running link step : cd /tmp/ltsmin9720599946088208309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin9720599946088208309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12518514753566541790.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:24:16] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:24:16] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:24:16] [INFO ] Time to serialize gal into /tmp/LTL10265518617950803507.gal : 3 ms
[2023-03-11 07:24:16] [INFO ] Time to serialize properties into /tmp/LTL12662626363555973708.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/LTL10265518617950803507.gal' '-t' 'CGAL' '-hoa' '/tmp/aut966743904967199367.hoa' '-atoms' '/tmp/LTL12662626363555973708.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/LTL12662626363555973708.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut966743904967199367.hoa
Detected timeout of ITS tools.
[2023-03-11 07:24:32] [INFO ] Flatten gal took : 26 ms
[2023-03-11 07:24:32] [INFO ] Flatten gal took : 25 ms
[2023-03-11 07:24:32] [INFO ] Time to serialize gal into /tmp/LTL5676035477130003384.gal : 4 ms
[2023-03-11 07:24:32] [INFO ] Time to serialize properties into /tmp/LTL5425737927716598544.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/LTL5676035477130003384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5425737927716598544.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(G(("((p963==0)||(p1216==1))")U(("((p713==0)||(p6280==1))")||(F(G(("((p5487==1)&&((p690==0)||(p169==1)))")U(X(!("((p963==0)||(p121...173
Formula 0 simplified : XF(!"((p963==0)||(p1216==1))" R (!"((p713==0)||(p6280==1))" & GF(!"((p5487==1)&&((p690==0)||(p169==1)))" R X"((p963==0)||(p1216==1))...159
Detected timeout of ITS tools.
[2023-03-11 07:24:47] [INFO ] Flatten gal took : 25 ms
[2023-03-11 07:24:47] [INFO ] Applying decomposition
[2023-03-11 07:24:47] [INFO ] Flatten gal took : 23 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/graph2166421641885326823.txt' '-o' '/tmp/graph2166421641885326823.bin' '-w' '/tmp/graph2166421641885326823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2166421641885326823.bin' '-l' '-1' '-v' '-w' '/tmp/graph2166421641885326823.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:24:47] [INFO ] Decomposing Gal with order
[2023-03-11 07:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:24:47] [INFO ] Removed a total of 35 redundant transitions.
[2023-03-11 07:24:47] [INFO ] Flatten gal took : 45 ms
[2023-03-11 07:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-11 07:24:47] [INFO ] Time to serialize gal into /tmp/LTL11538638055888862547.gal : 10 ms
[2023-03-11 07:24:47] [INFO ] Time to serialize properties into /tmp/LTL13163221794250151502.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/LTL11538638055888862547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13163221794250151502.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(G(("((i2.i0.i2.u42.p963==0)||(i4.i0.i1.u62.p1216==1))")U(("((i18.i1.i1.u23.p713==0)||(i19.u388.p6280==1))")||(F(G(("((i5.i2.i0.u3...290
Formula 0 simplified : XF(!"((i2.i0.i2.u42.p963==0)||(i4.i0.i1.u62.p1216==1))" R (!"((i18.i1.i1.u23.p713==0)||(i19.u388.p6280==1))" & GF(!"((i5.i2.i0.u305....276
Reverse transition relation is NOT exact ! Due to transitions t37, t49, t1072, i1.i0.i0.u21.t681, i2.i0.i2.u42.t724, i18.i1.i1.u23.t0, i20.i0.i2.u227.t2, ...253
Computing Next relation with stutter on 1.41671e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17901071731553096398
[2023-03-11 07:25:02] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17901071731553096398
Running compilation step : cd /tmp/ltsmin17901071731553096398;'/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'
Compilation finished in 1393 ms.
Running link step : cd /tmp/ltsmin17901071731553096398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin17901071731553096398;'/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([](((LTLAPp0==true) U (<>([](((LTLAPp2==true) U X(!(LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-11 finished in 174150 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))'
Support contains 2 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6259 transition count 6090
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6259 transition count 6090
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 6256 transition count 6087
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 6256 transition count 6087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 6255 transition count 6086
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 6255 transition count 6086
Applied a total of 22 rules in 4517 ms. Remains 6255 /6266 variables (removed 11) and now considering 6086/6097 (removed 11) transitions.
// Phase 1: matrix 6086 rows 6255 cols
[2023-03-11 07:25:22] [INFO ] Computed 514 place invariants in 64 ms
[2023-03-11 07:25:24] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2023-03-11 07:25:24] [INFO ] Invariant cache hit.
[2023-03-11 07:25:26] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 3965 ms to find 0 implicit places.
[2023-03-11 07:25:26] [INFO ] Invariant cache hit.
[2023-03-11 07:25:32] [INFO ] Dead Transitions using invariants and state equation in 5875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6266 places, 6086/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14370 ms. Remains : 6255/6266 places, 6086/6097 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1730 0) (EQ s4339 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2847 ms.
Product exploration explored 100000 steps with 50000 reset in 2873 ms.
Computed a total of 1578 stabilizing places and 1578 stable transitions
Computed a total of 1578 stabilizing places and 1578 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96b-LTLCardinality-12 finished in 20808 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))))'
Support contains 1 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6258 transition count 6089
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6258 transition count 6089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 6258 transition count 6088
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 6255 transition count 6085
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 6255 transition count 6085
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 6254 transition count 6084
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 6254 transition count 6084
Applied a total of 25 rules in 4172 ms. Remains 6254 /6266 variables (removed 12) and now considering 6084/6097 (removed 13) transitions.
// Phase 1: matrix 6084 rows 6254 cols
[2023-03-11 07:25:42] [INFO ] Computed 514 place invariants in 42 ms
[2023-03-11 07:25:44] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2023-03-11 07:25:44] [INFO ] Invariant cache hit.
[2023-03-11 07:25:46] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
[2023-03-11 07:25:46] [INFO ] Invariant cache hit.
[2023-03-11 07:25:51] [INFO ] Dead Transitions using invariants and state equation in 5095 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6254/6266 places, 6084/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12888 ms. Remains : 6254/6266 places, 6084/6097 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s5550 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][false, false, false]]
Stuttering criterion allowed to conclude after 3702 steps with 0 reset in 51 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-14 finished in 13192 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)&&F(!p1))||X(G(!p0)))))'
Support contains 4 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6259 transition count 6090
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6259 transition count 6090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 6259 transition count 6089
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 6256 transition count 6086
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 6256 transition count 6086
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 6255 transition count 6085
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 6255 transition count 6085
Applied a total of 23 rules in 4229 ms. Remains 6255 /6266 variables (removed 11) and now considering 6085/6097 (removed 12) transitions.
// Phase 1: matrix 6085 rows 6255 cols
[2023-03-11 07:25:55] [INFO ] Computed 514 place invariants in 55 ms
[2023-03-11 07:25:58] [INFO ] Implicit Places using invariants in 2770 ms returned []
[2023-03-11 07:25:58] [INFO ] Invariant cache hit.
[2023-03-11 07:26:00] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 4700 ms to find 0 implicit places.
[2023-03-11 07:26:00] [INFO ] Invariant cache hit.
[2023-03-11 07:26:07] [INFO ] Dead Transitions using invariants and state equation in 6484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6255/6266 places, 6085/6097 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15414 ms. Remains : 6255/6266 places, 6085/6097 transitions.
Stuttering acceptance computed with spot in 349 ms :[p0, p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s5675 0) (EQ s4804 1)), p0:(OR (EQ s5451 0) (EQ s2176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-96b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96b-LTLCardinality-15 finished in 15889 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(G(p0)) U G(p1))))'
Found a Lengthening insensitive property : AutoFlight-PT-96b-LTLCardinality-02
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2537 transitions
Trivial Post-agglo rules discarded 2537 transitions
Performed 2537 trivial Post agglomeration. Transition count delta: 2537
Iterating post reduction 0 with 2537 rules applied. Total rules applied 2537 place count 6265 transition count 3559
Reduce places removed 2537 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2826 rules applied. Total rules applied 5363 place count 3728 transition count 3270
Reduce places removed 192 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 194 rules applied. Total rules applied 5557 place count 3536 transition count 3268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5559 place count 3534 transition count 3268
Performed 703 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 703 Pre rules applied. Total rules applied 5559 place count 3534 transition count 2565
Deduced a syphon composed of 703 places in 34 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 4 with 1406 rules applied. Total rules applied 6965 place count 2831 transition count 2565
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 6970 place count 2826 transition count 2560
Iterating global reduction 4 with 5 rules applied. Total rules applied 6975 place count 2826 transition count 2560
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 6975 place count 2826 transition count 2556
Deduced a syphon composed of 4 places in 31 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 6983 place count 2822 transition count 2556
Performed 1141 Post agglomeration using F-continuation condition with reduction of 144 identical transitions.
Deduced a syphon composed of 1141 places in 1 ms
Reduce places removed 1141 places and 0 transitions.
Iterating global reduction 4 with 2282 rules applied. Total rules applied 9265 place count 1681 transition count 1271
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 9266 place count 1680 transition count 1270
Reduce places removed 190 places and 0 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 4 with 284 rules applied. Total rules applied 9550 place count 1490 transition count 1176
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 5 with 94 rules applied. Total rules applied 9644 place count 1396 transition count 1176
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 9644 place count 1396 transition count 1080
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 9836 place count 1300 transition count 1080
Applied a total of 9836 rules in 1119 ms. Remains 1300 /6266 variables (removed 4966) and now considering 1080/6097 (removed 5017) transitions.
// Phase 1: matrix 1080 rows 1300 cols
[2023-03-11 07:26:09] [INFO ] Computed 324 place invariants in 9 ms
[2023-03-11 07:26:09] [INFO ] Implicit Places using invariants in 838 ms returned [586, 660, 698, 736, 810, 884, 922, 960, 964, 968, 972, 976, 980, 984, 988, 992, 996, 1001, 1005, 1009, 1013, 1017, 1021, 1025, 1029, 1033, 1037, 1041, 1045, 1049, 1053, 1057, 1061, 1065, 1069, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167, 1169, 1171, 1173, 1175, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1213, 1217, 1221, 1225, 1227, 1229, 1231, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1247, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1299]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 840 ms to find 104 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1196/6266 places, 1080/6097 transitions.
Graph (trivial) has 494 edges and 1196 vertex of which 24 / 1196 are part of one of the 1 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1094 transition count 956
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1094 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1091 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1091 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1088 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1088 transition count 950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1085 transition count 947
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1085 transition count 947
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1082 transition count 944
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1082 transition count 944
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1079 transition count 941
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1079 transition count 941
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1076 transition count 938
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1076 transition count 938
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1073 transition count 935
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1073 transition count 935
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1070 transition count 932
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1070 transition count 932
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1067 transition count 929
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1067 transition count 929
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1064 transition count 926
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1064 transition count 926
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1061 transition count 923
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1061 transition count 923
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1058 transition count 920
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1058 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 232 place count 1057 transition count 919
Iterating global reduction 0 with 1 rules applied. Total rules applied 233 place count 1057 transition count 919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 234 place count 1056 transition count 918
Iterating global reduction 0 with 1 rules applied. Total rules applied 235 place count 1056 transition count 918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 236 place count 1055 transition count 917
Iterating global reduction 0 with 1 rules applied. Total rules applied 237 place count 1055 transition count 917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 238 place count 1054 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 239 place count 1054 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 240 place count 1053 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 241 place count 1053 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 242 place count 1052 transition count 914
Iterating global reduction 0 with 1 rules applied. Total rules applied 243 place count 1052 transition count 914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 244 place count 1051 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 245 place count 1051 transition count 913
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 246 place count 1050 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 247 place count 1050 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 248 place count 1049 transition count 911
Iterating global reduction 0 with 1 rules applied. Total rules applied 249 place count 1049 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 250 place count 1048 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 251 place count 1048 transition count 910
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 252 place count 1047 transition count 909
Iterating global reduction 0 with 1 rules applied. Total rules applied 253 place count 1047 transition count 909
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 254 place count 1046 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 255 place count 1046 transition count 908
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 259 place count 1044 transition count 906
Applied a total of 259 rules in 713 ms. Remains 1044 /1196 variables (removed 152) and now considering 906/1080 (removed 174) transitions.
// Phase 1: matrix 906 rows 1044 cols
[2023-03-11 07:26:10] [INFO ] Computed 220 place invariants in 10 ms
[2023-03-11 07:26:11] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-11 07:26:11] [INFO ] Invariant cache hit.
[2023-03-11 07:26:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:26:12] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1044/6266 places, 906/6097 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4677 ms. Remains : 1044/6266 places, 906/6097 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s534 0) (EQ s584 1)), p0:(NEQ s505 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 442 reset in 928 ms.
Product exploration explored 100000 steps with 443 reset in 1040 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 410 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:26:15] [INFO ] Invariant cache hit.
[2023-03-11 07:26:15] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:26:16] [INFO ] [Nat]Absence check using 220 positive place invariants in 39 ms returned sat
[2023-03-11 07:26:16] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:26:16] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:26:16] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-11 07:26:17] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1044 transition count 905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1044 transition count 904
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 1042 transition count 904
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 1042 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1041 transition count 903
Free-agglomeration rule applied 368 times.
Iterating global reduction 3 with 368 rules applied. Total rules applied 374 place count 1041 transition count 535
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t641.t1254 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 525 edges and 454 vertex of which 377 / 454 are part of one of the 1 SCC in 1 ms
Free SCC test removed 376 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 3 with 76 rules applied. Total rules applied 450 place count 78 transition count 460
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 526 rules applied. Total rules applied 976 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 977 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 977 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 979 place count 5 transition count 4
Applied a total of 979 rules in 98 ms. Remains 5 /1044 variables (removed 1039) and now considering 4/906 (removed 902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 5/1044 places, 4/906 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 294 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Applied a total of 0 rules in 52 ms. Remains 1044 /1044 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2023-03-11 07:26:17] [INFO ] Invariant cache hit.
[2023-03-11 07:26:18] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-11 07:26:18] [INFO ] Invariant cache hit.
[2023-03-11 07:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:26:20] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-11 07:26:20] [INFO ] Invariant cache hit.
[2023-03-11 07:26:20] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2918 ms. Remains : 1044/1044 places, 906/906 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 43 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:26:21] [INFO ] Invariant cache hit.
[2023-03-11 07:26:21] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:26:22] [INFO ] [Nat]Absence check using 220 positive place invariants in 45 ms returned sat
[2023-03-11 07:26:22] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:26:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:26:22] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:26:22] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 07:26:22] [INFO ] After 843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1044 transition count 905
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 1044 transition count 904
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 1042 transition count 904
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 1042 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1041 transition count 903
Free-agglomeration rule applied 368 times.
Iterating global reduction 3 with 368 rules applied. Total rules applied 374 place count 1041 transition count 535
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t641.t1254 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 525 edges and 454 vertex of which 377 / 454 are part of one of the 1 SCC in 1 ms
Free SCC test removed 376 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 3 with 76 rules applied. Total rules applied 450 place count 78 transition count 460
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 454 transitions
Reduce isomorphic transitions removed 454 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 526 rules applied. Total rules applied 976 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 977 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 977 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 979 place count 5 transition count 4
Applied a total of 979 rules in 136 ms. Remains 5 /1044 variables (removed 1039) and now considering 4/906 (removed 902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 5/1044 places, 4/906 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 442 reset in 1039 ms.
Product exploration explored 100000 steps with 444 reset in 1117 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 1044 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Applied a total of 0 rules in 66 ms. Remains 1044 /1044 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2023-03-11 07:26:26] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-11 07:26:26] [INFO ] Invariant cache hit.
[2023-03-11 07:26:26] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 1044/1044 places, 906/906 transitions.
Built C files in :
/tmp/ltsmin1662678388630302538
[2023-03-11 07:26:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1662678388630302538
Running compilation step : cd /tmp/ltsmin1662678388630302538;'/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'
Compilation finished in 1496 ms.
Running link step : cd /tmp/ltsmin1662678388630302538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1662678388630302538;'/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' '--hoa' '/tmp/stateBased5370829481208482598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 906/906 transitions.
Applied a total of 0 rules in 47 ms. Remains 1044 /1044 variables (removed 0) and now considering 906/906 (removed 0) transitions.
[2023-03-11 07:26:42] [INFO ] Invariant cache hit.
[2023-03-11 07:26:42] [INFO ] Implicit Places using invariants in 757 ms returned []
[2023-03-11 07:26:42] [INFO ] Invariant cache hit.
[2023-03-11 07:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:26:45] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
[2023-03-11 07:26:45] [INFO ] Invariant cache hit.
[2023-03-11 07:26:45] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3667 ms. Remains : 1044/1044 places, 906/906 transitions.
Built C files in :
/tmp/ltsmin14623919774008185480
[2023-03-11 07:26:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14623919774008185480
Running compilation step : cd /tmp/ltsmin14623919774008185480;'/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'
Compilation finished in 1619 ms.
Running link step : cd /tmp/ltsmin14623919774008185480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin14623919774008185480;'/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' '--hoa' '/tmp/stateBased1259163067525574008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:27:01] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:27:01] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:27:01] [INFO ] Time to serialize gal into /tmp/LTL3313964627339095883.gal : 5 ms
[2023-03-11 07:27:01] [INFO ] Time to serialize properties into /tmp/LTL3042612358261799456.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/LTL3313964627339095883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7411802794208164444.hoa' '-atoms' '/tmp/LTL3042612358261799456.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...317
Loading property file /tmp/LTL3042612358261799456.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7411802794208164444.hoa
Detected timeout of ITS tools.
[2023-03-11 07:27:16] [INFO ] Flatten gal took : 19 ms
[2023-03-11 07:27:16] [INFO ] Flatten gal took : 19 ms
[2023-03-11 07:27:16] [INFO ] Time to serialize gal into /tmp/LTL11635596367835075034.gal : 3 ms
[2023-03-11 07:27:16] [INFO ] Time to serialize properties into /tmp/LTL1543661118761773872.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/LTL11635596367835075034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1543661118761773872.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((F(G("(p3376!=1)")))U(G("((p5009==0)||(p5098==1))")))))
Formula 0 simplified : X(GF!"(p3376!=1)" R F!"((p5009==0)||(p5098==1))")
Detected timeout of ITS tools.
[2023-03-11 07:27:31] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:27:31] [INFO ] Applying decomposition
[2023-03-11 07:27:31] [INFO ] Flatten gal took : 22 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/graph1679134277816132146.txt' '-o' '/tmp/graph1679134277816132146.bin' '-w' '/tmp/graph1679134277816132146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1679134277816132146.bin' '-l' '-1' '-v' '-w' '/tmp/graph1679134277816132146.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:27:31] [INFO ] Decomposing Gal with order
[2023-03-11 07:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:27:31] [INFO ] Removed a total of 32 redundant transitions.
[2023-03-11 07:27:31] [INFO ] Flatten gal took : 64 ms
[2023-03-11 07:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-11 07:27:31] [INFO ] Time to serialize gal into /tmp/LTL8875931633981353442.gal : 9 ms
[2023-03-11 07:27:31] [INFO ] Time to serialize properties into /tmp/LTL8407731399578472346.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/LTL8875931633981353442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8407731399578472346.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 : !((X((F(G("(i17.i1.i2.u217.p3376!=1)")))U(G("((i13.i0.i5.u228.p5009==0)||(i3.u218.p5098==1))")))))
Formula 0 simplified : X(GF!"(i17.i1.i2.u217.p3376!=1)" R F!"((i13.i0.i5.u228.p5009==0)||(i3.u218.p5098==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.94676e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8555882409894423012
[2023-03-11 07:27:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8555882409894423012
Running compilation step : cd /tmp/ltsmin8555882409894423012;'/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'
Compilation finished in 1391 ms.
Running link step : cd /tmp/ltsmin8555882409894423012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8555882409894423012;'/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((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-02 finished in 114196 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 U (F(G((p2 U X(!p0))))||p1)))))'
Found a Lengthening insensitive property : AutoFlight-PT-96b-LTLCardinality-11
Stuttering acceptance computed with spot in 1349 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 7 out of 6266 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6266/6266 places, 6097/6097 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2540 transitions
Trivial Post-agglo rules discarded 2540 transitions
Performed 2540 trivial Post agglomeration. Transition count delta: 2540
Iterating post reduction 0 with 2540 rules applied. Total rules applied 2540 place count 6265 transition count 3556
Reduce places removed 2540 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 2829 rules applied. Total rules applied 5369 place count 3725 transition count 3267
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 193 rules applied. Total rules applied 5562 place count 3533 transition count 3266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5563 place count 3532 transition count 3266
Performed 702 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 702 Pre rules applied. Total rules applied 5563 place count 3532 transition count 2564
Deduced a syphon composed of 702 places in 24 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 4 with 1404 rules applied. Total rules applied 6967 place count 2830 transition count 2564
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 6971 place count 2826 transition count 2560
Iterating global reduction 4 with 4 rules applied. Total rules applied 6975 place count 2826 transition count 2560
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 6975 place count 2826 transition count 2557
Deduced a syphon composed of 3 places in 25 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 6981 place count 2823 transition count 2557
Performed 1138 Post agglomeration using F-continuation condition with reduction of 142 identical transitions.
Deduced a syphon composed of 1138 places in 0 ms
Reduce places removed 1138 places and 0 transitions.
Iterating global reduction 4 with 2276 rules applied. Total rules applied 9257 place count 1685 transition count 1277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 9259 place count 1685 transition count 1275
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9260 place count 1684 transition count 1274
Reduce places removed 164 places and 0 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 5 with 245 rules applied. Total rules applied 9505 place count 1520 transition count 1193
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 6 with 81 rules applied. Total rules applied 9586 place count 1439 transition count 1193
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 83 Pre rules applied. Total rules applied 9586 place count 1439 transition count 1110
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 7 with 166 rules applied. Total rules applied 9752 place count 1356 transition count 1110
Applied a total of 9752 rules in 968 ms. Remains 1356 /6266 variables (removed 4910) and now considering 1110/6097 (removed 4987) transitions.
// Phase 1: matrix 1110 rows 1356 cols
[2023-03-11 07:28:04] [INFO ] Computed 350 place invariants in 10 ms
[2023-03-11 07:28:05] [INFO ] Implicit Places using invariants in 832 ms returned [539, 613, 727, 765, 839, 913, 951, 989, 995, 1002, 1008, 1014, 1020, 1026, 1032, 1038, 1044, 1050, 1056, 1062, 1068, 1073, 1077, 1081, 1085, 1089, 1093, 1097, 1101, 1105, 1109, 1113, 1117, 1121, 1125, 1129, 1133, 1137, 1141, 1145, 1149, 1153, 1157, 1161, 1165, 1169, 1173, 1177, 1181, 1185, 1189, 1193, 1197, 1201, 1205, 1209, 1211, 1213, 1215, 1217, 1219, 1221, 1223, 1225, 1227, 1229, 1231, 1233, 1237, 1241, 1245, 1249, 1253, 1257, 1261, 1265, 1269, 1273, 1277, 1281, 1283, 1285, 1287, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1303, 1306, 1310, 1314, 1318, 1322, 1326, 1330, 1334, 1338, 1342, 1346, 1350, 1355]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 835 ms to find 104 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1252/6266 places, 1110/6097 transitions.
Graph (trivial) has 493 edges and 1252 vertex of which 24 / 1252 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 1150 transition count 986
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 1150 transition count 986
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 162 place count 1147 transition count 983
Iterating global reduction 0 with 3 rules applied. Total rules applied 165 place count 1147 transition count 983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 168 place count 1144 transition count 980
Iterating global reduction 0 with 3 rules applied. Total rules applied 171 place count 1144 transition count 980
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 174 place count 1141 transition count 977
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 1141 transition count 977
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 180 place count 1138 transition count 974
Iterating global reduction 0 with 3 rules applied. Total rules applied 183 place count 1138 transition count 974
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 186 place count 1135 transition count 971
Iterating global reduction 0 with 3 rules applied. Total rules applied 189 place count 1135 transition count 971
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 192 place count 1132 transition count 968
Iterating global reduction 0 with 3 rules applied. Total rules applied 195 place count 1132 transition count 968
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 198 place count 1129 transition count 965
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 1129 transition count 965
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 204 place count 1126 transition count 962
Iterating global reduction 0 with 3 rules applied. Total rules applied 207 place count 1126 transition count 962
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 210 place count 1123 transition count 959
Iterating global reduction 0 with 3 rules applied. Total rules applied 213 place count 1123 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 216 place count 1120 transition count 956
Iterating global reduction 0 with 3 rules applied. Total rules applied 219 place count 1120 transition count 956
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 222 place count 1117 transition count 953
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1117 transition count 953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 228 place count 1114 transition count 950
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1114 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 233 place count 1112 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 235 place count 1112 transition count 948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 237 place count 1110 transition count 946
Iterating global reduction 0 with 2 rules applied. Total rules applied 239 place count 1110 transition count 946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 241 place count 1108 transition count 944
Iterating global reduction 0 with 2 rules applied. Total rules applied 243 place count 1108 transition count 944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 245 place count 1106 transition count 942
Iterating global reduction 0 with 2 rules applied. Total rules applied 247 place count 1106 transition count 942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 249 place count 1104 transition count 940
Iterating global reduction 0 with 2 rules applied. Total rules applied 251 place count 1104 transition count 940
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 253 place count 1102 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 255 place count 1102 transition count 938
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 257 place count 1100 transition count 936
Iterating global reduction 0 with 2 rules applied. Total rules applied 259 place count 1100 transition count 936
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 261 place count 1098 transition count 934
Iterating global reduction 0 with 2 rules applied. Total rules applied 263 place count 1098 transition count 934
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 265 place count 1096 transition count 932
Iterating global reduction 0 with 2 rules applied. Total rules applied 267 place count 1096 transition count 932
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 269 place count 1094 transition count 930
Iterating global reduction 0 with 2 rules applied. Total rules applied 271 place count 1094 transition count 930
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 273 place count 1092 transition count 928
Iterating global reduction 0 with 2 rules applied. Total rules applied 275 place count 1092 transition count 928
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 277 place count 1090 transition count 926
Iterating global reduction 0 with 2 rules applied. Total rules applied 279 place count 1090 transition count 926
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 283 place count 1088 transition count 924
Applied a total of 283 rules in 878 ms. Remains 1088 /1252 variables (removed 164) and now considering 924/1110 (removed 186) transitions.
// Phase 1: matrix 924 rows 1088 cols
[2023-03-11 07:28:05] [INFO ] Computed 246 place invariants in 11 ms
[2023-03-11 07:28:06] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-11 07:28:06] [INFO ] Invariant cache hit.
[2023-03-11 07:28:06] [INFO ] State equation strengthened by 254 read => feed constraints.
[2023-03-11 07:28:12] [INFO ] Implicit Places using invariants and state equation in 5632 ms returned [510, 512, 514, 516, 518, 520, 522, 524, 526, 528, 530, 532, 534]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 6147 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1075/6266 places, 924/6097 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 1075 transition count 911
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 1062 transition count 911
Applied a total of 26 rules in 68 ms. Remains 1062 /1075 variables (removed 13) and now considering 911/924 (removed 13) transitions.
// Phase 1: matrix 911 rows 1062 cols
[2023-03-11 07:28:12] [INFO ] Computed 233 place invariants in 5 ms
[2023-03-11 07:28:12] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-11 07:28:12] [INFO ] Invariant cache hit.
[2023-03-11 07:28:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 07:28:18] [INFO ] Implicit Places using invariants and state equation in 6118 ms returned []
Implicit Place search using SMT with State Equation took 6723 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1062/6266 places, 911/6097 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 15619 ms. Remains : 1062/6266 places, 911/6097 transitions.
Running random walk in product with property : AutoFlight-PT-96b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s58 0) (EQ s905 1)), p0:(OR (EQ s104 0) (EQ s151 1)), p2:(AND (EQ s708 1) (OR (EQ s53 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 439 reset in 1080 ms.
Product exploration explored 100000 steps with 438 reset in 1069 ms.
Computed a total of 20 stabilizing places and 5 stable transitions
Computed a total of 20 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 16 factoid took 1223 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 07:28:23] [INFO ] Invariant cache hit.
[2023-03-11 07:28:23] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 07:28:23] [INFO ] [Nat]Absence check using 233 positive place invariants in 53 ms returned sat
[2023-03-11 07:28:24] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 07:28:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 07:28:25] [INFO ] After 442ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 07:28:25] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
[2023-03-11 07:28:25] [INFO ] Deduced a trap composed of 497 places in 185 ms of which 0 ms to minimize.
[2023-03-11 07:28:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2023-03-11 07:28:26] [INFO ] After 1773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-11 07:28:27] [INFO ] After 3452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 240 ms.
Support contains 7 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1062 transition count 910
Free-agglomeration rule applied 367 times.
Iterating global reduction 1 with 367 rules applied. Total rules applied 368 place count 1062 transition count 543
Reduce places removed 367 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1309 edges and 695 vertex of which 693 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 369 rules applied. Total rules applied 737 place count 693 transition count 542
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 738 place count 693 transition count 541
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 741 place count 690 transition count 538
Iterating global reduction 3 with 3 rules applied. Total rules applied 744 place count 690 transition count 538
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 747 place count 687 transition count 535
Iterating global reduction 3 with 3 rules applied. Total rules applied 750 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 753 place count 684 transition count 532
Iterating global reduction 3 with 3 rules applied. Total rules applied 756 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 759 place count 681 transition count 529
Iterating global reduction 3 with 3 rules applied. Total rules applied 762 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 765 place count 678 transition count 526
Iterating global reduction 3 with 3 rules applied. Total rules applied 768 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 771 place count 675 transition count 523
Iterating global reduction 3 with 3 rules applied. Total rules applied 774 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 777 place count 672 transition count 520
Iterating global reduction 3 with 3 rules applied. Total rules applied 780 place count 672 transition count 520
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 782 place count 670 transition count 518
Iterating global reduction 3 with 2 rules applied. Total rules applied 784 place count 670 transition count 518
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 786 place count 668 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 788 place count 668 transition count 516
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 790 place count 666 transition count 514
Iterating global reduction 3 with 2 rules applied. Total rules applied 792 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 794 place count 664 transition count 512
Iterating global reduction 3 with 2 rules applied. Total rules applied 796 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 798 place count 662 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 800 place count 662 transition count 510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 801 place count 661 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 802 place count 661 transition count 509
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 803 place count 660 transition count 508
Iterating global reduction 3 with 1 rules applied. Total rules applied 804 place count 660 transition count 508
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 805 place count 659 transition count 507
Iterating global reduction 3 with 1 rules applied. Total rules applied 806 place count 659 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 807 place count 658 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 808 place count 658 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 809 place count 657 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 810 place count 657 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 811 place count 656 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 813 place count 655 transition count 503
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 815 place count 654 transition count 502
Iterating global reduction 3 with 1 rules applied. Total rules applied 816 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 817 place count 653 transition count 501
Iterating global reduction 3 with 1 rules applied. Total rules applied 818 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 819 place count 652 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 820 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 821 place count 651 transition count 499
Iterating global reduction 3 with 1 rules applied. Total rules applied 822 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 823 place count 650 transition count 498
Iterating global reduction 3 with 1 rules applied. Total rules applied 824 place count 650 transition count 498
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 650 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 826 place count 649 transition count 497
Applied a total of 826 rules in 300 ms. Remains 649 /1062 variables (removed 413) and now considering 497/911 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 649/1062 places, 497/911 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 497 rows 649 cols
[2023-03-11 07:28:27] [INFO ] Computed 232 place invariants in 4 ms
[2023-03-11 07:28:28] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:28:28] [INFO ] [Nat]Absence check using 232 positive place invariants in 39 ms returned sat
[2023-03-11 07:28:28] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:28:28] [INFO ] State equation strengthened by 483 read => feed constraints.
[2023-03-11 07:28:28] [INFO ] After 130ms SMT Verify possible using 483 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:28:28] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 7 ms to minimize.
[2023-03-11 07:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-11 07:28:28] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-11 07:28:29] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 10 ms.
Support contains 4 out of 649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 649/649 places, 497/497 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 649 transition count 496
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 648 transition count 496
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 646 transition count 494
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 646 transition count 494
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 645 transition count 493
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 645 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 644 transition count 492
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t734.t1255 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 474 edges and 416 vertex of which 258 / 416 are part of one of the 1 SCC in 0 ms
Free SCC test removed 257 places
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 2 with 136 rules applied. Total rules applied 146 place count 159 transition count 357
Reduce places removed 134 places and 0 transitions.
Drop transitions removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 467 rules applied. Total rules applied 613 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 24 transition count 24
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 614 place count 24 transition count 19
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 624 place count 19 transition count 19
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 5 with 2 rules applied. Total rules applied 626 place count 18 transition count 18
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 630 place count 18 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 634 place count 14 transition count 14
Applied a total of 634 rules in 67 ms. Remains 14 /649 variables (removed 635) and now considering 14/497 (removed 483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 14/649 places, 14/497 transitions.
Incomplete random walk after 10000 steps, including 985 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) 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 2) seen :0
Probably explored full state space saw : 42 states, properties seen :0
Probabilistic random walk after 130 steps, saw 42 distinct states, run finished after 7 ms. (steps per millisecond=18 ) properties seen :0
Explored full state space saw : 42 states, properties seen :0
Exhaustive walk after 130 steps, saw 42 distinct states, run finished after 2 ms. (steps per millisecond=65 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (G (OR p1 p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p2))), (X (X p2)), (F p2), (F (AND (NOT p1) p2 p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (AND p2 p0))]
Knowledge based reduction with 18 factoid took 1063 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Applied a total of 0 rules in 59 ms. Remains 1062 /1062 variables (removed 0) and now considering 911/911 (removed 0) transitions.
// Phase 1: matrix 911 rows 1062 cols
[2023-03-11 07:28:30] [INFO ] Computed 233 place invariants in 9 ms
[2023-03-11 07:28:31] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-11 07:28:31] [INFO ] Invariant cache hit.
[2023-03-11 07:28:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 07:28:36] [INFO ] Implicit Places using invariants and state equation in 5611 ms returned []
Implicit Place search using SMT with State Equation took 6269 ms to find 0 implicit places.
[2023-03-11 07:28:36] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-11 07:28:36] [INFO ] Invariant cache hit.
[2023-03-11 07:28:37] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6909 ms. Remains : 1062/1062 places, 911/911 transitions.
Computed a total of 20 stabilizing places and 5 stable transitions
Computed a total of 20 stabilizing places and 5 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 299200 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299200 steps, saw 98777 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:28:40] [INFO ] Invariant cache hit.
[2023-03-11 07:28:41] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:28:41] [INFO ] [Nat]Absence check using 233 positive place invariants in 82 ms returned sat
[2023-03-11 07:28:41] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:28:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 07:28:41] [INFO ] After 135ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:28:42] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2023-03-11 07:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-11 07:28:42] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-11 07:28:42] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1062 transition count 908
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1060 transition count 908
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 1057 transition count 905
Free-agglomeration rule applied 368 times.
Iterating global reduction 2 with 368 rules applied. Total rules applied 379 place count 1057 transition count 537
Reduce places removed 368 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1297 edges and 689 vertex of which 687 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 370 rules applied. Total rules applied 749 place count 687 transition count 536
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 687 transition count 535
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 753 place count 684 transition count 532
Iterating global reduction 4 with 3 rules applied. Total rules applied 756 place count 684 transition count 532
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 759 place count 681 transition count 529
Iterating global reduction 4 with 3 rules applied. Total rules applied 762 place count 681 transition count 529
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 765 place count 678 transition count 526
Iterating global reduction 4 with 3 rules applied. Total rules applied 768 place count 678 transition count 526
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 771 place count 675 transition count 523
Iterating global reduction 4 with 3 rules applied. Total rules applied 774 place count 675 transition count 523
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 777 place count 672 transition count 520
Iterating global reduction 4 with 3 rules applied. Total rules applied 780 place count 672 transition count 520
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 783 place count 669 transition count 517
Iterating global reduction 4 with 3 rules applied. Total rules applied 786 place count 669 transition count 517
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 789 place count 666 transition count 514
Iterating global reduction 4 with 3 rules applied. Total rules applied 792 place count 666 transition count 514
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 794 place count 664 transition count 512
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 664 transition count 512
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 798 place count 662 transition count 510
Iterating global reduction 4 with 2 rules applied. Total rules applied 800 place count 662 transition count 510
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 802 place count 660 transition count 508
Iterating global reduction 4 with 2 rules applied. Total rules applied 804 place count 660 transition count 508
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 806 place count 658 transition count 506
Iterating global reduction 4 with 2 rules applied. Total rules applied 808 place count 658 transition count 506
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 810 place count 656 transition count 504
Iterating global reduction 4 with 2 rules applied. Total rules applied 812 place count 656 transition count 504
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 813 place count 655 transition count 503
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 655 transition count 503
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 815 place count 654 transition count 502
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 654 transition count 502
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 817 place count 653 transition count 501
Iterating global reduction 4 with 1 rules applied. Total rules applied 818 place count 653 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 819 place count 652 transition count 500
Iterating global reduction 4 with 1 rules applied. Total rules applied 820 place count 652 transition count 500
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 821 place count 651 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 822 place count 651 transition count 499
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 823 place count 650 transition count 498
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 650 transition count 498
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 825 place count 649 transition count 497
Iterating global reduction 4 with 1 rules applied. Total rules applied 826 place count 649 transition count 497
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 827 place count 648 transition count 496
Iterating global reduction 4 with 1 rules applied. Total rules applied 828 place count 648 transition count 496
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 829 place count 647 transition count 495
Iterating global reduction 4 with 1 rules applied. Total rules applied 830 place count 647 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 831 place count 646 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 832 place count 646 transition count 494
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 833 place count 645 transition count 493
Iterating global reduction 4 with 1 rules applied. Total rules applied 834 place count 645 transition count 493
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 835 place count 644 transition count 492
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 644 transition count 492
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 644 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 643 transition count 491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 839 place count 643 transition count 491
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 840 place count 642 transition count 490
Iterating global reduction 5 with 1 rules applied. Total rules applied 841 place count 642 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 842 place count 641 transition count 489
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t202.t1255.t727 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 479 edges and 411 vertex of which 259 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 258 places
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 5 with 144 rules applied. Total rules applied 986 place count 153 transition count 346
Reduce places removed 142 places and 0 transitions.
Drop transitions removed 334 transitions
Reduce isomorphic transitions removed 334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 477 rules applied. Total rules applied 1463 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1464 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1464 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1466 place count 9 transition count 10
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 8 with 2 rules applied. Total rules applied 1468 place count 8 transition count 9
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1471 place count 8 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1474 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1475 place count 5 transition count 5
Applied a total of 1475 rules in 403 ms. Remains 5 /1062 variables (removed 1057) and now considering 5/911 (removed 906) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 5/1062 places, 5/911 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 441 reset in 1070 ms.
Product exploration explored 100000 steps with 440 reset in 1044 ms.
Built C files in :
/tmp/ltsmin18015312352918041385
[2023-03-11 07:28:49] [INFO ] Computing symmetric may disable matrix : 911 transitions.
[2023-03-11 07:28:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:28:49] [INFO ] Computing symmetric may enable matrix : 911 transitions.
[2023-03-11 07:28:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:28:49] [INFO ] Computing Do-Not-Accords matrix : 911 transitions.
[2023-03-11 07:28:49] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:28:49] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18015312352918041385
Running compilation step : cd /tmp/ltsmin18015312352918041385;'/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'
Compilation finished in 2369 ms.
Running link step : cd /tmp/ltsmin18015312352918041385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin18015312352918041385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2058174941372564766.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 911/911 transitions.
Reduce places removed 2 places and 2 transitions.
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 3 place count 1059 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 1057 transition count 907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 1055 transition count 905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 1053 transition count 903
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 26 rules applied. Total rules applied 37 place count 1040 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 50 place count 1027 transition count 890
Applied a total of 50 rules in 101 ms. Remains 1027 /1062 variables (removed 35) and now considering 890/911 (removed 21) transitions.
// Phase 1: matrix 890 rows 1027 cols
[2023-03-11 07:29:04] [INFO ] Computed 219 place invariants in 8 ms
[2023-03-11 07:29:04] [INFO ] Implicit Places using invariants in 474 ms returned [651]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 475 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1062 places, 890/911 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1025 transition count 889
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 889
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1024 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1024 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1023 transition count 887
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1023 transition count 887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1022 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1022 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1021 transition count 885
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1021 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1020 transition count 884
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1020 transition count 884
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1019 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1019 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1018 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1018 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1017 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1017 transition count 881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1016 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1016 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1015 transition count 879
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1015 transition count 879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1014 transition count 878
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1014 transition count 878
Applied a total of 24 rules in 303 ms. Remains 1014 /1026 variables (removed 12) and now considering 878/890 (removed 12) transitions.
// Phase 1: matrix 878 rows 1014 cols
[2023-03-11 07:29:05] [INFO ] Computed 218 place invariants in 9 ms
[2023-03-11 07:29:05] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-11 07:29:05] [INFO ] Invariant cache hit.
[2023-03-11 07:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:29:06] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1014/1062 places, 878/911 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2710 ms. Remains : 1014/1062 places, 878/911 transitions.
Built C files in :
/tmp/ltsmin5473138015270996232
[2023-03-11 07:29:07] [INFO ] Computing symmetric may disable matrix : 878 transitions.
[2023-03-11 07:29:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:29:07] [INFO ] Computing symmetric may enable matrix : 878 transitions.
[2023-03-11 07:29:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:29:07] [INFO ] Computing Do-Not-Accords matrix : 878 transitions.
[2023-03-11 07:29:07] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 07:29:07] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5473138015270996232
Running compilation step : cd /tmp/ltsmin5473138015270996232;'/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'
Compilation finished in 2429 ms.
Running link step : cd /tmp/ltsmin5473138015270996232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin5473138015270996232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13705388900228408835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 07:29:22] [INFO ] Flatten gal took : 21 ms
[2023-03-11 07:29:22] [INFO ] Flatten gal took : 20 ms
[2023-03-11 07:29:22] [INFO ] Time to serialize gal into /tmp/LTL14723505686182177740.gal : 3 ms
[2023-03-11 07:29:22] [INFO ] Time to serialize properties into /tmp/LTL12155510969483330863.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/LTL14723505686182177740.gal' '-t' 'CGAL' '-hoa' '/tmp/aut565366875105505525.hoa' '-atoms' '/tmp/LTL12155510969483330863.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/LTL12155510969483330863.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut565366875105505525.hoa
Detected timeout of ITS tools.
[2023-03-11 07:29:37] [INFO ] Flatten gal took : 29 ms
[2023-03-11 07:29:37] [INFO ] Flatten gal took : 26 ms
[2023-03-11 07:29:37] [INFO ] Time to serialize gal into /tmp/LTL3732204159151208283.gal : 4 ms
[2023-03-11 07:29:37] [INFO ] Time to serialize properties into /tmp/LTL15498502593739118696.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/LTL3732204159151208283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15498502593739118696.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(G(("((p963==0)||(p1216==1))")U(("((p713==0)||(p6280==1))")||(F(G(("((p5487==1)&&((p690==0)||(p169==1)))")U(X(!("((p963==0)||(p121...173
Formula 0 simplified : XF(!"((p963==0)||(p1216==1))" R (!"((p713==0)||(p6280==1))" & GF(!"((p5487==1)&&((p690==0)||(p169==1)))" R X"((p963==0)||(p1216==1))...159
Detected timeout of ITS tools.
[2023-03-11 07:29:52] [INFO ] Flatten gal took : 65 ms
[2023-03-11 07:29:52] [INFO ] Applying decomposition
[2023-03-11 07:29:52] [INFO ] Flatten gal took : 45 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/graph14558520904829921822.txt' '-o' '/tmp/graph14558520904829921822.bin' '-w' '/tmp/graph14558520904829921822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14558520904829921822.bin' '-l' '-1' '-v' '-w' '/tmp/graph14558520904829921822.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:29:52] [INFO ] Decomposing Gal with order
[2023-03-11 07:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:29:52] [INFO ] Removed a total of 34 redundant transitions.
[2023-03-11 07:29:52] [INFO ] Flatten gal took : 52 ms
[2023-03-11 07:29:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-11 07:29:52] [INFO ] Time to serialize gal into /tmp/LTL9194213467139047007.gal : 11 ms
[2023-03-11 07:29:52] [INFO ] Time to serialize properties into /tmp/LTL10373093461737032185.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/LTL9194213467139047007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10373093461737032185.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(G(("((i20.i1.i0.u43.p963==0)||(i3.u64.p1216==1))")U(("((i24.u24.p713==0)||(i25.i1.i1.u384.p6280==1))")||(F(G(("((i4.i0.i1.u305.p5...278
Formula 0 simplified : XF(!"((i20.i1.i0.u43.p963==0)||(i3.u64.p1216==1))" R (!"((i24.u24.p713==0)||(i25.i1.i1.u384.p6280==1))" & GF(!"((i4.i0.i1.u305.p5487...264
Reverse transition relation is NOT exact ! Due to transitions t1073, i1.i1.i1.u22.t684, i18.i0.i2.u0.t2, i20.i1.i0.u43.t727, i23.t49, i23.t37, i24.u24.t0, ...254
Computing Next relation with stutter on 2.83342e+24 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13465574070023802240
[2023-03-11 07:30:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13465574070023802240
Running compilation step : cd /tmp/ltsmin13465574070023802240;'/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'
Compilation finished in 1547 ms.
Running link step : cd /tmp/ltsmin13465574070023802240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin13465574070023802240;'/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([](((LTLAPp0==true) U (<>([](((LTLAPp2==true) U X(!(LTLAPp0==true)))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-96b-LTLCardinality-11 finished in 141146 ms.
[2023-03-11 07:30:23] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4697924929708490565
[2023-03-11 07:30:23] [INFO ] Too many transitions (6097) to apply POR reductions. Disabling POR matrices.
[2023-03-11 07:30:23] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4697924929708490565
Running compilation step : cd /tmp/ltsmin4697924929708490565;'/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-11 07:30:23] [INFO ] Applying decomposition
[2023-03-11 07:30:23] [INFO ] Flatten gal took : 164 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/graph15661530846834067755.txt' '-o' '/tmp/graph15661530846834067755.bin' '-w' '/tmp/graph15661530846834067755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15661530846834067755.bin' '-l' '-1' '-v' '-w' '/tmp/graph15661530846834067755.weights' '-q' '0' '-e' '0.001'
[2023-03-11 07:30:23] [INFO ] Decomposing Gal with order
[2023-03-11 07:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:30:25] [INFO ] Removed a total of 1097 redundant transitions.
[2023-03-11 07:30:26] [INFO ] Flatten gal took : 278 ms
[2023-03-11 07:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-11 07:30:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality16866289036896267879.gal : 61 ms
[2023-03-11 07:30:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality7993215296145258800.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/LTLCardinality16866289036896267879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7993215296145258800.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 : !((X((F(G("(i26.u929.p3376!=1)")))U(G("((i48.i1.i0.i0.u1433.p5009==0)||(i49.i0.i1.i0.u1470.p5098==1))")))))
Formula 0 simplified : X(GF!"(i26.u929.p3376!=1)" R F!"((i48.i1.i0.i0.u1433.p5009==0)||(i49.i0.i1.i0.u1470.p5098==1))")
Compilation finished in 26606 ms.
Running link step : cd /tmp/ltsmin4697924929708490565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin4697924929708490565;'/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((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 07:55:14] [INFO ] Applying decomposition
[2023-03-11 07:55:14] [INFO ] Flatten gal took : 406 ms
[2023-03-11 07:55:14] [INFO ] Decomposing Gal with order
[2023-03-11 07:55:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 07:55:33] [INFO ] Removed a total of 206 redundant transitions.
[2023-03-11 07:55:33] [INFO ] Flatten gal took : 519 ms
[2023-03-11 07:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10710 labels/synchronizations in 78452 ms.
[2023-03-11 07:57:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality7891081159491270482.gal : 2276 ms
[2023-03-11 07:57:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality7690016975705153156.ltl : 381 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/LTLCardinality7891081159491270482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7690016975705153156.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 : !((X((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1242
Formula 0 simplified : X(GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1233
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin4697924929708490565;'/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((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4697924929708490565;'/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([](((LTLAPp2==true) U (<>([](((LTLAPp4==true) U X(!(LTLAPp2==true)))))||(LTLAPp3==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2023-03-11 08:12:43] [INFO ] Flatten gal took : 756 ms
[2023-03-11 08:12:48] [INFO ] Input system was already deterministic with 6097 transitions.
[2023-03-11 08:12:48] [INFO ] Transformed 6266 places.
[2023-03-11 08:12:48] [INFO ] Transformed 6097 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 08:12:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality11636417573588375959.gal : 88 ms
[2023-03-11 08:12:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality15452867525458719836.ltl : 4 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/LTLCardinality11636417573588375959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15452867525458719836.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F(G("(p3376!=1)")))U(G("((p5009==0)||(p5098==1))")))))
Formula 0 simplified : X(GF!"(p3376!=1)" R F!"((p5009==0)||(p5098==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8189488 kB
After kill :
MemTotal: 16393220 kB
MemFree: 12713792 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-96b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813593200523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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