Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716992580017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:23:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:23:02] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2024-05-29 14:23:02] [INFO ] Transformed 7803 places.
[2024-05-29 14:23:02] [INFO ] Transformed 7103 transitions.
[2024-05-29 14:23:02] [INFO ] Found NUPN structural information;
[2024-05-29 14:23:02] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 688 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1089 places :
Symmetric choice reduction at 0 with 1089 rule applications. Total rules 1089 place count 6714 transition count 6014
Iterating global reduction 0 with 1089 rules applied. Total rules applied 2178 place count 6714 transition count 6014
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2179 place count 6713 transition count 6013
Iterating global reduction 0 with 1 rules applied. Total rules applied 2180 place count 6713 transition count 6013
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2181 place count 6712 transition count 6012
Iterating global reduction 0 with 1 rules applied. Total rules applied 2182 place count 6712 transition count 6012
Applied a total of 2182 rules in 4819 ms. Remains 6712 /7803 variables (removed 1091) and now considering 6012/7103 (removed 1091) transitions.
// Phase 1: matrix 6012 rows 6712 cols
[2024-05-29 14:23:07] [INFO ] Computed 1101 invariants in 95 ms
[2024-05-29 14:23:10] [INFO ] Implicit Places using invariants in 2618 ms returned []
[2024-05-29 14:23:10] [INFO ] Invariant cache hit.
[2024-05-29 14:23:12] [INFO ] Implicit Places using invariants and state equation in 2611 ms returned []
Implicit Place search using SMT with State Equation took 5267 ms to find 0 implicit places.
[2024-05-29 14:23:12] [INFO ] Invariant cache hit.
[2024-05-29 14:23:17] [INFO ] Dead Transitions using invariants and state equation in 5029 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6712/7803 places, 6012/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15119 ms. Remains : 6712/7803 places, 6012/7103 transitions.
Support contains 41 out of 6712 places after structural reductions.
[2024-05-29 14:23:18] [INFO ] Flatten gal took : 303 ms
[2024-05-29 14:23:18] [INFO ] Flatten gal took : 179 ms
[2024-05-29 14:23:19] [INFO ] Input system was already deterministic with 6012 transitions.
Support contains 39 out of 6712 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 34) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2024-05-29 14:23:19] [INFO ] Invariant cache hit.
[2024-05-29 14:23:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 712 ms returned sat
[2024-05-29 14:23:23] [INFO ] After 3860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-05-29 14:23:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 779 ms returned sat
[2024-05-29 14:23:40] [INFO ] After 10859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-05-29 14:23:42] [INFO ] Deduced a trap composed of 35 places in 1982 ms of which 9 ms to minimize.
[2024-05-29 14:23:44] [INFO ] Deduced a trap composed of 28 places in 2199 ms of which 4 ms to minimize.
[2024-05-29 14:23:47] [INFO ] Deduced a trap composed of 27 places in 2267 ms of which 4 ms to minimize.
[2024-05-29 14:23:49] [INFO ] Deduced a trap composed of 19 places in 2141 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:23:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:23:49] [INFO ] After 26067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 6475 ms.
Support contains 33 out of 6712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Drop transitions removed 1381 transitions
Trivial Post-agglo rules discarded 1381 transitions
Performed 1381 trivial Post agglomeration. Transition count delta: 1381
Iterating post reduction 0 with 1381 rules applied. Total rules applied 1381 place count 6712 transition count 4631
Reduce places removed 1381 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1386 rules applied. Total rules applied 2767 place count 5331 transition count 4626
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2772 place count 5326 transition count 4626
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 2772 place count 5326 transition count 3835
Deduced a syphon composed of 791 places in 11 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 4354 place count 4535 transition count 3835
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4357 place count 4532 transition count 3832
Iterating global reduction 3 with 3 rules applied. Total rules applied 4360 place count 4532 transition count 3832
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4360 place count 4532 transition count 3830
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4364 place count 4530 transition count 3830
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 7 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7760 place count 2832 transition count 2132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7761 place count 2832 transition count 2131
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7763 place count 2831 transition count 2130
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7965 place count 2730 transition count 2130
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8167 place count 2629 transition count 2130
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 8347 place count 2539 transition count 2130
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8349 place count 2539 transition count 2128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8351 place count 2537 transition count 2128
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 5 with 292 rules applied. Total rules applied 8643 place count 2537 transition count 2128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8644 place count 2536 transition count 2127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8645 place count 2535 transition count 2127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8645 place count 2535 transition count 2125
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8649 place count 2533 transition count 2125
Applied a total of 8649 rules in 2486 ms. Remains 2533 /6712 variables (removed 4179) and now considering 2125/6012 (removed 3887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2486 ms. Remains : 2533/6712 places, 2125/6012 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 2125 rows 2533 cols
[2024-05-29 14:23:59] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:24:00] [INFO ] [Real]Absence check using 1100 positive place invariants in 218 ms returned sat
[2024-05-29 14:24:01] [INFO ] After 1679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-29 14:24:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 216 ms returned sat
[2024-05-29 14:24:06] [INFO ] After 2823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-29 14:24:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:07] [INFO ] After 1699ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2024-05-29 14:24:08] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2024-05-29 14:24:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-05-29 14:24:11] [INFO ] After 4893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1651 ms.
[2024-05-29 14:24:12] [INFO ] After 11647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 594 ms.
Support contains 30 out of 2533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2533/2533 places, 2125/2125 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2530 transition count 2122
Applied a total of 6 rules in 184 ms. Remains 2530 /2533 variables (removed 3) and now considering 2122/2125 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 2530/2533 places, 2122/2125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 62367 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62367 steps, saw 50330 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 2122 rows 2530 cols
[2024-05-29 14:24:17] [INFO ] Computed 1100 invariants in 17 ms
[2024-05-29 14:24:18] [INFO ] [Real]Absence check using 1100 positive place invariants in 208 ms returned sat
[2024-05-29 14:24:18] [INFO ] After 1655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-29 14:24:20] [INFO ] [Nat]Absence check using 1100 positive place invariants in 207 ms returned sat
[2024-05-29 14:24:23] [INFO ] After 2816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-29 14:24:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:25] [INFO ] After 1725ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2024-05-29 14:24:26] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 14:24:26] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 14:24:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2024-05-29 14:24:29] [INFO ] After 5151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1735 ms.
[2024-05-29 14:24:30] [INFO ] After 11849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 545 ms.
Support contains 29 out of 2530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2530/2530 places, 2122/2122 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2529 transition count 2121
Applied a total of 2 rules in 173 ms. Remains 2529 /2530 variables (removed 1) and now considering 2121/2122 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 2529/2530 places, 2121/2122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 62175 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62175 steps, saw 50179 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 2121 rows 2529 cols
[2024-05-29 14:24:35] [INFO ] Computed 1100 invariants in 5 ms
[2024-05-29 14:24:36] [INFO ] [Real]Absence check using 1100 positive place invariants in 209 ms returned sat
[2024-05-29 14:24:36] [INFO ] After 1625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-29 14:24:38] [INFO ] [Nat]Absence check using 1100 positive place invariants in 211 ms returned sat
[2024-05-29 14:24:41] [INFO ] After 2694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-29 14:24:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:24:43] [INFO ] After 1638ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2024-05-29 14:24:46] [INFO ] After 4465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1628 ms.
[2024-05-29 14:24:47] [INFO ] After 10890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 552 ms.
Support contains 29 out of 2529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2529/2529 places, 2121/2121 transitions.
Applied a total of 0 rules in 102 ms. Remains 2529 /2529 variables (removed 0) and now considering 2121/2121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2529/2529 places, 2121/2121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2529/2529 places, 2121/2121 transitions.
Applied a total of 0 rules in 92 ms. Remains 2529 /2529 variables (removed 0) and now considering 2121/2121 (removed 0) transitions.
[2024-05-29 14:24:48] [INFO ] Invariant cache hit.
[2024-05-29 14:24:50] [INFO ] Implicit Places using invariants in 1923 ms returned [2512, 2516]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1927 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2527/2529 places, 2121/2121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2525 transition count 2119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2525 transition count 2119
Applied a total of 4 rules in 174 ms. Remains 2525 /2527 variables (removed 2) and now considering 2119/2121 (removed 2) transitions.
// Phase 1: matrix 2119 rows 2525 cols
[2024-05-29 14:24:50] [INFO ] Computed 1098 invariants in 12 ms
[2024-05-29 14:24:52] [INFO ] Implicit Places using invariants in 1940 ms returned []
[2024-05-29 14:24:52] [INFO ] Invariant cache hit.
[2024-05-29 14:24:56] [INFO ] Implicit Places using invariants and state equation in 3857 ms returned []
Implicit Place search using SMT with State Equation took 5802 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2525/2529 places, 2119/2121 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7995 ms. Remains : 2525/2529 places, 2119/2121 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 61701 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61701 steps, saw 50686 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 23 properties.
[2024-05-29 14:25:00] [INFO ] Invariant cache hit.
[2024-05-29 14:25:01] [INFO ] [Real]Absence check using 1098 positive place invariants in 202 ms returned sat
[2024-05-29 14:25:01] [INFO ] After 1599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2024-05-29 14:25:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:25:06] [INFO ] After 2728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2024-05-29 14:25:06] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-05-29 14:25:09] [INFO ] After 5823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1638 ms.
[2024-05-29 14:25:11] [INFO ] After 9556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 731 ms.
Support contains 29 out of 2525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2525/2525 places, 2119/2119 transitions.
Applied a total of 0 rules in 86 ms. Remains 2525 /2525 variables (removed 0) and now considering 2119/2119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2525/2525 places, 2119/2119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2525/2525 places, 2119/2119 transitions.
Applied a total of 0 rules in 86 ms. Remains 2525 /2525 variables (removed 0) and now considering 2119/2119 (removed 0) transitions.
[2024-05-29 14:25:12] [INFO ] Invariant cache hit.
[2024-05-29 14:25:14] [INFO ] Implicit Places using invariants in 1850 ms returned []
[2024-05-29 14:25:14] [INFO ] Invariant cache hit.
[2024-05-29 14:25:17] [INFO ] Implicit Places using invariants and state equation in 3824 ms returned []
Implicit Place search using SMT with State Equation took 5677 ms to find 0 implicit places.
[2024-05-29 14:25:18] [INFO ] Redundant transitions in 112 ms returned []
[2024-05-29 14:25:18] [INFO ] Invariant cache hit.
[2024-05-29 14:25:19] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7457 ms. Remains : 2525/2525 places, 2119/2119 transitions.
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1)))||G(p2))))'
Support contains 3 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6702 transition count 6002
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6702 transition count 6002
Applied a total of 20 rules in 2032 ms. Remains 6702 /6712 variables (removed 10) and now considering 6002/6012 (removed 10) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:25:22] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 14:25:24] [INFO ] Implicit Places using invariants in 2560 ms returned []
[2024-05-29 14:25:24] [INFO ] Invariant cache hit.
[2024-05-29 14:25:26] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 4919 ms to find 0 implicit places.
[2024-05-29 14:25:26] [INFO ] Invariant cache hit.
[2024-05-29 14:25:31] [INFO ] Dead Transitions using invariants and state equation in 4980 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6712 places, 6002/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11934 ms. Remains : 6702/6712 places, 6002/6012 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(EQ s3006 1), p0:(EQ s6167 0), p1:(EQ s4685 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1499 ms.
Product exploration explored 100000 steps with 0 reset in 1935 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6702 stabilizing places and 1598/6002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:25:36] [INFO ] Invariant cache hit.
[2024-05-29 14:25:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 693 ms returned sat
[2024-05-29 14:25:43] [INFO ] After 6996ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:25:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 677 ms returned sat
[2024-05-29 14:25:50] [INFO ] After 5517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:25:52] [INFO ] Deduced a trap composed of 20 places in 2090 ms of which 3 ms to minimize.
[2024-05-29 14:25:54] [INFO ] Deduced a trap composed of 17 places in 2046 ms of which 3 ms to minimize.
[2024-05-29 14:25:57] [INFO ] Deduced a trap composed of 19 places in 2167 ms of which 3 ms to minimize.
[2024-05-29 14:25:59] [INFO ] Deduced a trap composed of 20 places in 2046 ms of which 3 ms to minimize.
[2024-05-29 14:26:01] [INFO ] Deduced a trap composed of 25 places in 2170 ms of which 4 ms to minimize.
[2024-05-29 14:26:03] [INFO ] Deduced a trap composed of 21 places in 2146 ms of which 4 ms to minimize.
[2024-05-29 14:26:06] [INFO ] Deduced a trap composed of 25 places in 2133 ms of which 3 ms to minimize.
[2024-05-29 14:26:08] [INFO ] Deduced a trap composed of 18 places in 2019 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:26:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:26:08] [INFO ] After 25316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 414 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5304 transition count 4604
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2796 place count 5304 transition count 3804
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4397 place count 4503 transition count 3803
Iterating global reduction 2 with 1 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4398 place count 4503 transition count 3802
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4400 place count 4502 transition count 3802
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7796 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7797 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8001 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8203 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8397 place count 2504 transition count 2102
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8697 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8698 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8698 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2099
Applied a total of 8702 rules in 2108 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2099/6002 (removed 3903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2108 ms. Remains : 2500/6702 places, 2099/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66616 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66616 steps, saw 45008 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2099 rows 2500 cols
[2024-05-29 14:26:14] [INFO ] Computed 1100 invariants in 17 ms
[2024-05-29 14:26:14] [INFO ] [Real]Absence check using 1100 positive place invariants in 203 ms returned sat
[2024-05-29 14:26:16] [INFO ] After 1722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:26:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 202 ms returned sat
[2024-05-29 14:26:17] [INFO ] After 1201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 14:26:18] [INFO ] After 145ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:18] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2024-05-29 14:26:18] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:26:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2024-05-29 14:26:18] [INFO ] After 845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-29 14:26:18] [INFO ] After 2778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2500/2500 places, 2099/2099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2099/2099 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2024-05-29 14:26:19] [INFO ] Invariant cache hit.
[2024-05-29 14:26:21] [INFO ] Implicit Places using invariants in 1874 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1875 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2498/2500 places, 2099/2099 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2496 transition count 2097
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 164 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:26:21] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:26:23] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-29 14:26:23] [INFO ] Invariant cache hit.
[2024-05-29 14:26:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:26:26] [INFO ] Implicit Places using invariants and state equation in 3850 ms returned []
Implicit Place search using SMT with State Equation took 5729 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2500 places, 2097/2099 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7853 ms. Remains : 2496/2500 places, 2097/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69166 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69166 steps, saw 48035 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:26:30] [INFO ] Invariant cache hit.
[2024-05-29 14:26:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:26:32] [INFO ] After 1704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:26:32] [INFO ] [Nat]Absence check using 1098 positive place invariants in 211 ms returned sat
[2024-05-29 14:26:33] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:26:33] [INFO ] After 144ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:34] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 14:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2024-05-29 14:26:34] [INFO ] After 628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-05-29 14:26:34] [INFO ] After 2539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:26:34] [INFO ] Invariant cache hit.
[2024-05-29 14:26:36] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2024-05-29 14:26:36] [INFO ] Invariant cache hit.
[2024-05-29 14:26:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:26:40] [INFO ] Implicit Places using invariants and state equation in 3903 ms returned []
Implicit Place search using SMT with State Equation took 5809 ms to find 0 implicit places.
[2024-05-29 14:26:40] [INFO ] Redundant transitions in 90 ms returned []
[2024-05-29 14:26:40] [INFO ] Invariant cache hit.
[2024-05-29 14:26:42] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7578 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 197 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:26:42] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:26:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:26:44] [INFO ] After 1705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:26:44] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:26:46] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:46] [INFO ] State equation strengthened by 592 read => feed constraints.
[2024-05-29 14:26:46] [INFO ] After 482ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:26:47] [INFO ] Deduced a trap composed of 7 places in 667 ms of which 2 ms to minimize.
[2024-05-29 14:26:48] [INFO ] Deduced a trap composed of 5 places in 678 ms of which 1 ms to minimize.
[2024-05-29 14:26:48] [INFO ] Deduced a trap composed of 5 places in 679 ms of which 1 ms to minimize.
[2024-05-29 14:26:49] [INFO ] Deduced a trap composed of 5 places in 669 ms of which 1 ms to minimize.
[2024-05-29 14:26:50] [INFO ] Deduced a trap composed of 5 places in 679 ms of which 1 ms to minimize.
[2024-05-29 14:26:51] [INFO ] Deduced a trap composed of 5 places in 661 ms of which 2 ms to minimize.
[2024-05-29 14:26:51] [INFO ] Deduced a trap composed of 5 places in 663 ms of which 1 ms to minimize.
[2024-05-29 14:26:52] [INFO ] Deduced a trap composed of 5 places in 670 ms of which 1 ms to minimize.
[2024-05-29 14:26:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6275 ms
[2024-05-29 14:26:53] [INFO ] After 7003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-29 14:26:53] [INFO ] After 9085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 179 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 6702 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 : 6702/6702 places, 6002/6002 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6701 transition count 4603
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5303 transition count 4603
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2796 place count 5303 transition count 3803
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4396 place count 4503 transition count 3803
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7790 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7791 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7793 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7995 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8197 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8391 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8393 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8394 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8394 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8398 place count 2501 transition count 2100
Applied a total of 8398 rules in 1589 ms. Remains 2501 /6702 variables (removed 4201) and now considering 2100/6002 (removed 3902) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2024-05-29 14:26:55] [INFO ] Computed 1100 invariants in 4 ms
[2024-05-29 14:26:57] [INFO ] Implicit Places using invariants in 2072 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2074 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6702 places, 2100/6002 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 160 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:26:57] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:26:59] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2024-05-29 14:26:59] [INFO ] Invariant cache hit.
[2024-05-29 14:27:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:27:03] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 5545 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6702 places, 2098/6002 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9370 ms. Remains : 2497/6702 places, 2098/6002 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:27:03] [INFO ] Invariant cache hit.
[2024-05-29 14:27:04] [INFO ] [Real]Absence check using 1098 positive place invariants in 204 ms returned sat
[2024-05-29 14:27:05] [INFO ] After 1653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:27:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:27:07] [INFO ] After 1153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:27:07] [INFO ] After 141ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:27:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-29 14:27:07] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-29 14:27:07] [INFO ] After 2368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Applied a total of 2 rules in 156 ms. Remains 2496 /2497 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 2496/2497 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79107 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79107 steps, saw 55838 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:27:11] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:27:12] [INFO ] [Real]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:27:13] [INFO ] After 1659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:27:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:27:14] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:27:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:27:15] [INFO ] After 139ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:27:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-05-29 14:27:15] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 14:27:15] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:27:15] [INFO ] Invariant cache hit.
[2024-05-29 14:27:17] [INFO ] Implicit Places using invariants in 1821 ms returned []
[2024-05-29 14:27:17] [INFO ] Invariant cache hit.
[2024-05-29 14:27:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:27:21] [INFO ] Implicit Places using invariants and state equation in 3675 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
[2024-05-29 14:27:21] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:27:21] [INFO ] Invariant cache hit.
[2024-05-29 14:27:22] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7186 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 218 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:27:23] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:27:23] [INFO ] [Real]Absence check using 1098 positive place invariants in 197 ms returned sat
[2024-05-29 14:27:24] [INFO ] After 1609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:27:25] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2024-05-29 14:27:26] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:27:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 14:27:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:27:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2024-05-29 14:27:26] [INFO ] After 1560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 14:27:27] [INFO ] After 2276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1282 ms.
Product exploration explored 100000 steps with 0 reset in 1728 ms.
Built C files in :
/tmp/ltsmin2868105135756952430
[2024-05-29 14:27:30] [INFO ] Too many transitions (2098) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:30] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2868105135756952430
Running compilation step : cd /tmp/ltsmin2868105135756952430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2868105135756952430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2868105135756952430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Applied a total of 2 rules in 165 ms. Remains 2496 /2497 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:27:33] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:27:35] [INFO ] Implicit Places using invariants in 1803 ms returned []
[2024-05-29 14:27:35] [INFO ] Invariant cache hit.
[2024-05-29 14:27:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:27:39] [INFO ] Implicit Places using invariants and state equation in 3743 ms returned []
Implicit Place search using SMT with State Equation took 5550 ms to find 0 implicit places.
[2024-05-29 14:27:39] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:27:39] [INFO ] Invariant cache hit.
[2024-05-29 14:27:40] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2496/2497 places, 2097/2098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7276 ms. Remains : 2496/2497 places, 2097/2098 transitions.
Built C files in :
/tmp/ltsmin10138843612785272277
[2024-05-29 14:27:40] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:40] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10138843612785272277
Running compilation step : cd /tmp/ltsmin10138843612785272277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10138843612785272277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10138843612785272277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:27:44] [INFO ] Flatten gal took : 66 ms
[2024-05-29 14:27:44] [INFO ] Flatten gal took : 64 ms
[2024-05-29 14:27:44] [INFO ] Time to serialize gal into /tmp/LTL13733051096078269806.gal : 19 ms
[2024-05-29 14:27:44] [INFO ] Time to serialize properties into /tmp/LTL8427820275462772465.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13733051096078269806.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8518825049282553486.hoa' '-atoms' '/tmp/LTL8427820275462772465.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8427820275462772465.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8518825049282553486.hoa
Detected timeout of ITS tools.
[2024-05-29 14:27:59] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:27:59] [INFO ] Flatten gal took : 66 ms
[2024-05-29 14:27:59] [INFO ] Time to serialize gal into /tmp/LTL2251671740457345197.gal : 11 ms
[2024-05-29 14:27:59] [INFO ] Time to serialize properties into /tmp/LTL15469691401532440160.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2251671740457345197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15469691401532440160.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(p7175==0)"))||(G("(p5443==1)"))))||(G("(p3488==1)")))))
Formula 0 simplified : X(G(F!"(p7175==0)" & F!"(p5443==1)") & F!"(p3488==1)")
Detected timeout of ITS tools.
[2024-05-29 14:28:14] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:28:14] [INFO ] Applying decomposition
[2024-05-29 14:28:14] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5849202031746372924.txt' '-o' '/tmp/graph5849202031746372924.bin' '-w' '/tmp/graph5849202031746372924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5849202031746372924.bin' '-l' '-1' '-v' '-w' '/tmp/graph5849202031746372924.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:28:15] [INFO ] Decomposing Gal with order
[2024-05-29 14:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:28:15] [INFO ] Removed a total of 608 redundant transitions.
[2024-05-29 14:28:15] [INFO ] Flatten gal took : 182 ms
[2024-05-29 14:28:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 55 ms.
[2024-05-29 14:28:15] [INFO ] Time to serialize gal into /tmp/LTL16379835659769095640.gal : 25 ms
[2024-05-29 14:28:15] [INFO ] Time to serialize properties into /tmp/LTL4208395528652572129.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16379835659769095640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4208395528652572129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(i41.i1.i1.u738.p7175==0)"))||(G("(i31.i1.i1.u559.p5443==1)"))))||(G("(i19.i1.i2.u353.p3488==1)")))))
Formula 0 simplified : X(G(F!"(i41.i1.i1.u738.p7175==0)" & F!"(i31.i1.i1.u559.p5443==1)") & F!"(i19.i1.i2.u353.p3488==1)")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1606, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...5677
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4798775019658723978
[2024-05-29 14:28:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4798775019658723978
Running compilation step : cd /tmp/ltsmin4798775019658723978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4798775019658723978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4798775019658723978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-00 finished in 193877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6711 transition count 4611
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5311 transition count 4611
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2800 place count 5311 transition count 3818
Deduced a syphon composed of 793 places in 12 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 4386 place count 4518 transition count 3818
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4393 place count 4511 transition count 3811
Iterating global reduction 2 with 7 rules applied. Total rules applied 4400 place count 4511 transition count 3811
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4400 place count 4511 transition count 3805
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4412 place count 4505 transition count 3805
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7812 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7813 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7815 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8017 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8219 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8411 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8413 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8414 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8414 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8418 place count 2501 transition count 2099
Applied a total of 8418 rules in 2079 ms. Remains 2501 /6712 variables (removed 4211) and now considering 2099/6012 (removed 3913) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2024-05-29 14:28:35] [INFO ] Computed 1100 invariants in 10 ms
[2024-05-29 14:28:37] [INFO ] Implicit Places using invariants in 2033 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2036 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6712 places, 2099/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 160 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:28:38] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:28:39] [INFO ] Implicit Places using invariants in 1761 ms returned []
[2024-05-29 14:28:39] [INFO ] Invariant cache hit.
[2024-05-29 14:28:43] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 5309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6712 places, 2097/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9585 ms. Remains : 2497/6712 places, 2097/6012 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s1677 1) (NEQ s810 1)), p0:(EQ s2155 0), p1:(NEQ s810 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1344 ms.
Product exploration explored 100000 steps with 0 reset in 1862 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84613 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84613 steps, saw 64031 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:28:50] [INFO ] Invariant cache hit.
[2024-05-29 14:28:50] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:28:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 225 ms returned sat
[2024-05-29 14:28:52] [INFO ] After 1186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:28:52] [INFO ] After 1432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-29 14:28:52] [INFO ] After 2195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 89 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 94 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81408 steps, run timeout after 3024 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 81408 steps, saw 61578 distinct states, run finished after 3024 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:28:56] [INFO ] Invariant cache hit.
[2024-05-29 14:28:56] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:28:57] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:28:58] [INFO ] After 1135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:28:58] [INFO ] After 1381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-29 14:28:59] [INFO ] After 2143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 85 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:28:59] [INFO ] Invariant cache hit.
[2024-05-29 14:29:01] [INFO ] Implicit Places using invariants in 1824 ms returned []
[2024-05-29 14:29:01] [INFO ] Invariant cache hit.
[2024-05-29 14:29:04] [INFO ] Implicit Places using invariants and state equation in 3769 ms returned []
Implicit Place search using SMT with State Equation took 5595 ms to find 0 implicit places.
[2024-05-29 14:29:04] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:29:04] [INFO ] Invariant cache hit.
[2024-05-29 14:29:06] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7306 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2497 transition count 2097
Applied a total of 593 rules in 198 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:29:06] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:29:07] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:07] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:29:08] [INFO ] After 1217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:09] [INFO ] After 1478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-29 14:29:09] [INFO ] After 2230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:29:09] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:29:11] [INFO ] Implicit Places using invariants in 1845 ms returned []
[2024-05-29 14:29:11] [INFO ] Invariant cache hit.
[2024-05-29 14:29:15] [INFO ] Implicit Places using invariants and state equation in 3768 ms returned []
Implicit Place search using SMT with State Equation took 5617 ms to find 0 implicit places.
[2024-05-29 14:29:15] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:29:15] [INFO ] Invariant cache hit.
[2024-05-29 14:29:16] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7260 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78779 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78779 steps, saw 59477 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:29:20] [INFO ] Invariant cache hit.
[2024-05-29 14:29:20] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:29:22] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:22] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-29 14:29:23] [INFO ] After 2210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 99 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 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 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 75572 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75572 steps, saw 57195 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:29:26] [INFO ] Invariant cache hit.
[2024-05-29 14:29:27] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:29:28] [INFO ] After 1186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:29] [INFO ] After 1472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-29 14:29:29] [INFO ] After 2223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 98 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:29:29] [INFO ] Invariant cache hit.
[2024-05-29 14:29:31] [INFO ] Implicit Places using invariants in 1849 ms returned []
[2024-05-29 14:29:31] [INFO ] Invariant cache hit.
[2024-05-29 14:29:35] [INFO ] Implicit Places using invariants and state equation in 3524 ms returned []
Implicit Place search using SMT with State Equation took 5375 ms to find 0 implicit places.
[2024-05-29 14:29:35] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:29:35] [INFO ] Invariant cache hit.
[2024-05-29 14:29:36] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7109 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2497 transition count 2097
Applied a total of 593 rules in 203 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:29:36] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:29:37] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2024-05-29 14:29:39] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:39] [INFO ] After 1457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2024-05-29 14:29:39] [INFO ] After 2193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1351 ms.
Product exploration explored 100000 steps with 0 reset in 1789 ms.
Built C files in :
/tmp/ltsmin17607375752401307233
[2024-05-29 14:29:42] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:29:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17607375752401307233
Running compilation step : cd /tmp/ltsmin17607375752401307233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17607375752401307233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17607375752401307233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 101 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:29:46] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:29:48] [INFO ] Implicit Places using invariants in 1923 ms returned []
[2024-05-29 14:29:48] [INFO ] Invariant cache hit.
[2024-05-29 14:29:51] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 5629 ms to find 0 implicit places.
[2024-05-29 14:29:51] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:29:51] [INFO ] Invariant cache hit.
[2024-05-29 14:29:53] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7363 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin1295644720247888648
[2024-05-29 14:29:53] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:29:53] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1295644720247888648
Running compilation step : cd /tmp/ltsmin1295644720247888648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1295644720247888648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1295644720247888648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:29:56] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:29:56] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:29:56] [INFO ] Time to serialize gal into /tmp/LTL1612366124229485379.gal : 10 ms
[2024-05-29 14:29:56] [INFO ] Time to serialize properties into /tmp/LTL4803208731048022647.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1612366124229485379.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8431760458439145429.hoa' '-atoms' '/tmp/LTL4803208731048022647.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4803208731048022647.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8431760458439145429.hoa
Detected timeout of ITS tools.
[2024-05-29 14:30:11] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:30:11] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:30:11] [INFO ] Time to serialize gal into /tmp/LTL9195158743674620119.gal : 10 ms
[2024-05-29 14:30:11] [INFO ] Time to serialize properties into /tmp/LTL1272308781329915244.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9195158743674620119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1272308781329915244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p6722==0)")||(G(F(("(p2586!=1)")U(("((p5244!=1)&&(p2586!=1))")||(G("(p2586!=1)"))))))))))
Formula 0 simplified : FG(!"(p6722==0)" & (!"(p2586!=1)" M !"((p5244!=1)&&(p2586!=1))"))
Detected timeout of ITS tools.
[2024-05-29 14:30:26] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:30:26] [INFO ] Applying decomposition
[2024-05-29 14:30:26] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3493492658712514855.txt' '-o' '/tmp/graph3493492658712514855.bin' '-w' '/tmp/graph3493492658712514855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3493492658712514855.bin' '-l' '-1' '-v' '-w' '/tmp/graph3493492658712514855.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:30:27] [INFO ] Decomposing Gal with order
[2024-05-29 14:30:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:30:27] [INFO ] Removed a total of 602 redundant transitions.
[2024-05-29 14:30:27] [INFO ] Flatten gal took : 132 ms
[2024-05-29 14:30:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 42 ms.
[2024-05-29 14:30:27] [INFO ] Time to serialize gal into /tmp/LTL10522655857614465153.gal : 37 ms
[2024-05-29 14:30:27] [INFO ] Time to serialize properties into /tmp/LTL10921645453968270521.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10522655857614465153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10921645453968270521.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i36.i1.i2.u691.p6722==0)")||(G(F(("(i14.i1.i0.u261.p2586!=1)")U(("((i28.i2.i1.u538.p5244!=1)&&(i14.i1.i0.u261.p2586!=1))")||...195
Formula 0 simplified : FG(!"(i36.i1.i2.u691.p6722==0)" & (!"(i14.i1.i0.u261.p2586!=1)" M !"((i28.i2.i1.u538.p5244!=1)&&(i14.i1.i0.u261.p2586!=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10845646088667225030
[2024-05-29 14:30:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10845646088667225030
Running compilation step : cd /tmp/ltsmin10845646088667225030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10845646088667225030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10845646088667225030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-01 finished in 131925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6702 transition count 6002
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6702 transition count 6002
Applied a total of 20 rules in 2114 ms. Remains 6702 /6712 variables (removed 10) and now considering 6002/6012 (removed 10) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:30:47] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 14:30:50] [INFO ] Implicit Places using invariants in 2586 ms returned []
[2024-05-29 14:30:50] [INFO ] Invariant cache hit.
[2024-05-29 14:30:53] [INFO ] Implicit Places using invariants and state equation in 2610 ms returned []
Implicit Place search using SMT with State Equation took 5197 ms to find 0 implicit places.
[2024-05-29 14:30:53] [INFO ] Invariant cache hit.
[2024-05-29 14:30:57] [INFO ] Dead Transitions using invariants and state equation in 4924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6712 places, 6002/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12235 ms. Remains : 6702/6712 places, 6002/6012 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1457 ms.
Product exploration explored 100000 steps with 0 reset in 1880 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 216330 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216330 steps, saw 208962 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:31:05] [INFO ] Invariant cache hit.
[2024-05-29 14:31:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 740 ms returned sat
[2024-05-29 14:31:12] [INFO ] After 7370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:13] [INFO ] [Nat]Absence check using 1101 positive place invariants in 720 ms returned sat
[2024-05-29 14:31:19] [INFO ] After 5944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:22] [INFO ] Deduced a trap composed of 16 places in 2269 ms of which 4 ms to minimize.
[2024-05-29 14:31:24] [INFO ] Deduced a trap composed of 16 places in 2311 ms of which 4 ms to minimize.
[2024-05-29 14:31:27] [INFO ] Deduced a trap composed of 23 places in 2266 ms of which 4 ms to minimize.
[2024-05-29 14:31:29] [INFO ] Deduced a trap composed of 25 places in 2200 ms of which 3 ms to minimize.
[2024-05-29 14:31:32] [INFO ] Deduced a trap composed of 18 places in 2214 ms of which 3 ms to minimize.
[2024-05-29 14:31:34] [INFO ] Deduced a trap composed of 18 places in 2229 ms of which 4 ms to minimize.
[2024-05-29 14:31:37] [INFO ] Deduced a trap composed of 21 places in 2190 ms of which 3 ms to minimize.
[2024-05-29 14:31:39] [INFO ] Deduced a trap composed of 22 places in 2237 ms of which 8 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:31:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:31:39] [INFO ] After 27026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 127 ms.
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6702 transition count 4602
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5302 transition count 4602
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2800 place count 5302 transition count 3803
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7800 place count 2802 transition count 2102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7803 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2700 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2599 transition count 2100
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2498 transition count 2097
Applied a total of 8706 rules in 1697 ms. Remains 2498 /6702 variables (removed 4204) and now considering 2097/6002 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 2498/6702 places, 2097/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 69127 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69127 steps, saw 46842 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2498 cols
[2024-05-29 14:31:44] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:31:45] [INFO ] [Real]Absence check using 1100 positive place invariants in 228 ms returned sat
[2024-05-29 14:31:46] [INFO ] After 1708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:46] [INFO ] [Nat]Absence check using 1100 positive place invariants in 222 ms returned sat
[2024-05-29 14:31:48] [INFO ] After 1215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:31:48] [INFO ] After 73ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:48] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2024-05-29 14:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-05-29 14:31:48] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 14:31:48] [INFO ] After 2311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 90 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2498/2498 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:31:48] [INFO ] Invariant cache hit.
[2024-05-29 14:31:50] [INFO ] Implicit Places using invariants in 2094 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2098 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2496/2498 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 164 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:31:51] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:31:53] [INFO ] Implicit Places using invariants in 2028 ms returned []
[2024-05-29 14:31:53] [INFO ] Invariant cache hit.
[2024-05-29 14:31:56] [INFO ] Implicit Places using invariants and state equation in 3668 ms returned []
Implicit Place search using SMT with State Equation took 5698 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2494/2498 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8044 ms. Remains : 2494/2498 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67835 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67835 steps, saw 45933 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:32:00] [INFO ] Invariant cache hit.
[2024-05-29 14:32:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 227 ms returned sat
[2024-05-29 14:32:01] [INFO ] After 1776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:32:02] [INFO ] [Nat]Absence check using 1098 positive place invariants in 226 ms returned sat
[2024-05-29 14:32:03] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:32:03] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:32:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-05-29 14:32:04] [INFO ] After 1590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 14:32:04] [INFO ] After 2258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 103 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 99 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:32:04] [INFO ] Invariant cache hit.
[2024-05-29 14:32:06] [INFO ] Implicit Places using invariants in 1977 ms returned []
[2024-05-29 14:32:06] [INFO ] Invariant cache hit.
[2024-05-29 14:32:10] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 5894 ms to find 0 implicit places.
[2024-05-29 14:32:10] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:32:10] [INFO ] Invariant cache hit.
[2024-05-29 14:32:11] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7654 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 203 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:32:12] [INFO ] Computed 1098 invariants in 3 ms
[2024-05-29 14:32:12] [INFO ] [Real]Absence check using 1098 positive place invariants in 207 ms returned sat
[2024-05-29 14:32:13] [INFO ] After 1730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:32:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:32:15] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:32:15] [INFO ] State equation strengthened by 594 read => feed constraints.
[2024-05-29 14:32:15] [INFO ] After 341ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:32:16] [INFO ] Deduced a trap composed of 6 places in 728 ms of which 1 ms to minimize.
[2024-05-29 14:32:17] [INFO ] Deduced a trap composed of 5 places in 730 ms of which 1 ms to minimize.
[2024-05-29 14:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1760 ms
[2024-05-29 14:32:17] [INFO ] After 2198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-29 14:32:17] [INFO ] After 4029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 994 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:32:19] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 14:32:21] [INFO ] Implicit Places using invariants in 2653 ms returned []
[2024-05-29 14:32:21] [INFO ] Invariant cache hit.
[2024-05-29 14:32:24] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 5234 ms to find 0 implicit places.
[2024-05-29 14:32:24] [INFO ] Invariant cache hit.
[2024-05-29 14:32:29] [INFO ] Dead Transitions using invariants and state equation in 4882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11112 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212897 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212897 steps, saw 207000 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:32:32] [INFO ] Invariant cache hit.
[2024-05-29 14:32:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 702 ms returned sat
[2024-05-29 14:32:39] [INFO ] After 6947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:32:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 720 ms returned sat
[2024-05-29 14:32:46] [INFO ] After 5595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:32:49] [INFO ] Deduced a trap composed of 16 places in 2309 ms of which 4 ms to minimize.
[2024-05-29 14:32:51] [INFO ] Deduced a trap composed of 16 places in 2316 ms of which 3 ms to minimize.
[2024-05-29 14:32:54] [INFO ] Deduced a trap composed of 23 places in 2267 ms of which 4 ms to minimize.
[2024-05-29 14:32:56] [INFO ] Deduced a trap composed of 25 places in 2219 ms of which 4 ms to minimize.
[2024-05-29 14:32:59] [INFO ] Deduced a trap composed of 18 places in 2141 ms of which 4 ms to minimize.
[2024-05-29 14:33:01] [INFO ] Deduced a trap composed of 18 places in 2195 ms of which 3 ms to minimize.
[2024-05-29 14:33:03] [INFO ] Deduced a trap composed of 21 places in 2184 ms of which 4 ms to minimize.
[2024-05-29 14:33:06] [INFO ] Deduced a trap composed of 22 places in 2117 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:33:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:33:06] [INFO ] After 26332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 157 ms.
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6702 transition count 4602
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5302 transition count 4602
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2800 place count 5302 transition count 3803
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7800 place count 2802 transition count 2102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7803 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2700 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2599 transition count 2100
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2498 transition count 2097
Applied a total of 8706 rules in 1757 ms. Remains 2498 /6702 variables (removed 4204) and now considering 2097/6002 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1757 ms. Remains : 2498/6702 places, 2097/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66953 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66953 steps, saw 45372 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2498 cols
[2024-05-29 14:33:11] [INFO ] Computed 1100 invariants in 3 ms
[2024-05-29 14:33:11] [INFO ] [Real]Absence check using 1100 positive place invariants in 206 ms returned sat
[2024-05-29 14:33:13] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:13] [INFO ] [Nat]Absence check using 1100 positive place invariants in 234 ms returned sat
[2024-05-29 14:33:14] [INFO ] After 1244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:33:14] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:15] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2024-05-29 14:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-05-29 14:33:15] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 14:33:15] [INFO ] After 2366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2498/2498 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 89 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:33:15] [INFO ] Invariant cache hit.
[2024-05-29 14:33:17] [INFO ] Implicit Places using invariants in 1816 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1818 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2496/2498 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 174 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:33:17] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:33:19] [INFO ] Implicit Places using invariants in 1912 ms returned []
[2024-05-29 14:33:19] [INFO ] Invariant cache hit.
[2024-05-29 14:33:23] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 5524 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2494/2498 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7605 ms. Remains : 2494/2498 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 68408 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68408 steps, saw 46340 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:33:26] [INFO ] Invariant cache hit.
[2024-05-29 14:33:26] [INFO ] [Real]Absence check using 1098 positive place invariants in 196 ms returned sat
[2024-05-29 14:33:28] [INFO ] After 1678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:33:29] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:29] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:33:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-05-29 14:33:30] [INFO ] After 1488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:33:30] [INFO ] After 2088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 82 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:33:30] [INFO ] Invariant cache hit.
[2024-05-29 14:33:32] [INFO ] Implicit Places using invariants in 1921 ms returned []
[2024-05-29 14:33:32] [INFO ] Invariant cache hit.
[2024-05-29 14:33:36] [INFO ] Implicit Places using invariants and state equation in 3876 ms returned []
Implicit Place search using SMT with State Equation took 5798 ms to find 0 implicit places.
[2024-05-29 14:33:36] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:33:36] [INFO ] Invariant cache hit.
[2024-05-29 14:33:37] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7496 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 205 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:33:37] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:33:38] [INFO ] [Real]Absence check using 1098 positive place invariants in 209 ms returned sat
[2024-05-29 14:33:39] [INFO ] After 1697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:33:41] [INFO ] After 1148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:41] [INFO ] State equation strengthened by 594 read => feed constraints.
[2024-05-29 14:33:41] [INFO ] After 338ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:42] [INFO ] Deduced a trap composed of 6 places in 728 ms of which 4 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Deduced a trap composed of 5 places in 719 ms of which 2 ms to minimize.
[2024-05-29 14:33:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1745 ms
[2024-05-29 14:33:43] [INFO ] After 2178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-29 14:33:43] [INFO ] After 3970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1515 ms.
Product exploration explored 100000 steps with 0 reset in 1994 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Performed 1400 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6702 transition count 6002
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 499 Pre rules applied. Total rules applied 1400 place count 6702 transition count 6401
Deduced a syphon composed of 1899 places in 19 ms
Iterating global reduction 1 with 499 rules applied. Total rules applied 1899 place count 6702 transition count 6401
Performed 1901 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3800 places in 23 ms
Iterating global reduction 1 with 1901 rules applied. Total rules applied 3800 place count 6702 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3801 place count 6702 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 703 places :
Symmetric choice reduction at 2 with 703 rule applications. Total rules 4504 place count 5999 transition count 5697
Deduced a syphon composed of 3097 places in 20 ms
Iterating global reduction 2 with 703 rules applied. Total rules applied 5207 place count 5999 transition count 5697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3098 places in 19 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5208 place count 5999 transition count 5697
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5210 place count 5997 transition count 5695
Deduced a syphon composed of 3096 places in 21 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5212 place count 5997 transition count 5695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -428
Deduced a syphon composed of 3197 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5313 place count 5997 transition count 6123
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5414 place count 5896 transition count 5921
Deduced a syphon composed of 3096 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5515 place count 5896 transition count 5921
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3197 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5616 place count 5896 transition count 6348
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5717 place count 5795 transition count 6146
Deduced a syphon composed of 3096 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5818 place count 5795 transition count 6146
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3197 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5919 place count 5795 transition count 6576
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6020 place count 5694 transition count 6374
Deduced a syphon composed of 3096 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6121 place count 5694 transition count 6374
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 3192 places in 14 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6217 place count 5694 transition count 6782
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6313 place count 5598 transition count 6590
Deduced a syphon composed of 3096 places in 12 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6409 place count 5598 transition count 6590
Deduced a syphon composed of 3096 places in 19 ms
Applied a total of 6409 rules in 10035 ms. Remains 5598 /6702 variables (removed 1104) and now considering 6590/6002 (removed -588) transitions.
[2024-05-29 14:33:58] [INFO ] Redundant transitions in 371 ms returned []
// Phase 1: matrix 6590 rows 5598 cols
[2024-05-29 14:33:58] [INFO ] Computed 1101 invariants in 134 ms
[2024-05-29 14:34:03] [INFO ] Dead Transitions using invariants and state equation in 4725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5598/6702 places, 6590/6002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15142 ms. Remains : 5598/6702 places, 6590/6002 transitions.
Built C files in :
/tmp/ltsmin3543805944072624404
[2024-05-29 14:34:03] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3543805944072624404
Running compilation step : cd /tmp/ltsmin3543805944072624404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3543805944072624404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3543805944072624404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1221 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:34:07] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 14:34:09] [INFO ] Implicit Places using invariants in 2609 ms returned []
[2024-05-29 14:34:09] [INFO ] Invariant cache hit.
[2024-05-29 14:34:12] [INFO ] Implicit Places using invariants and state equation in 2367 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
[2024-05-29 14:34:12] [INFO ] Invariant cache hit.
[2024-05-29 14:34:17] [INFO ] Dead Transitions using invariants and state equation in 4824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11026 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Built C files in :
/tmp/ltsmin15379038429225054763
[2024-05-29 14:34:17] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15379038429225054763
Running compilation step : cd /tmp/ltsmin15379038429225054763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15379038429225054763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15379038429225054763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:34:20] [INFO ] Flatten gal took : 123 ms
[2024-05-29 14:34:20] [INFO ] Flatten gal took : 144 ms
[2024-05-29 14:34:20] [INFO ] Time to serialize gal into /tmp/LTL12698215924682944437.gal : 37 ms
[2024-05-29 14:34:20] [INFO ] Time to serialize properties into /tmp/LTL13374690122758564979.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12698215924682944437.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7977702097557716755.hoa' '-atoms' '/tmp/LTL13374690122758564979.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13374690122758564979.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7977702097557716755.hoa
Detected timeout of ITS tools.
[2024-05-29 14:34:36] [INFO ] Flatten gal took : 132 ms
[2024-05-29 14:34:36] [INFO ] Flatten gal took : 137 ms
[2024-05-29 14:34:36] [INFO ] Time to serialize gal into /tmp/LTL17163882369316734551.gal : 22 ms
[2024-05-29 14:34:36] [INFO ] Time to serialize properties into /tmp/LTL1369854681493482251.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17163882369316734551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1369854681493482251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p403!=1)")))))
Formula 0 simplified : XXF!"(p403!=1)"
Detected timeout of ITS tools.
[2024-05-29 14:34:51] [INFO ] Flatten gal took : 125 ms
[2024-05-29 14:34:51] [INFO ] Applying decomposition
[2024-05-29 14:34:51] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3731202352273807814.txt' '-o' '/tmp/graph3731202352273807814.bin' '-w' '/tmp/graph3731202352273807814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3731202352273807814.bin' '-l' '-1' '-v' '-w' '/tmp/graph3731202352273807814.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:34:51] [INFO ] Decomposing Gal with order
[2024-05-29 14:34:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:34:53] [INFO ] Removed a total of 987 redundant transitions.
[2024-05-29 14:34:53] [INFO ] Flatten gal took : 240 ms
[2024-05-29 14:34:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 37 ms.
[2024-05-29 14:34:54] [INFO ] Time to serialize gal into /tmp/LTL2557349424839313350.gal : 65 ms
[2024-05-29 14:34:54] [INFO ] Time to serialize properties into /tmp/LTL9850938376243996501.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2557349424839313350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9850938376243996501.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i4.u140.p403!=1)")))))
Formula 0 simplified : XXF!"(i4.u140.p403!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin33390541694935506
[2024-05-29 14:35:09] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin33390541694935506
Running compilation step : cd /tmp/ltsmin33390541694935506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin33390541694935506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin33390541694935506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-03 finished in 266560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1402 transitions
Trivial Post-agglo rules discarded 1402 transitions
Performed 1402 trivial Post agglomeration. Transition count delta: 1402
Iterating post reduction 0 with 1402 rules applied. Total rules applied 1402 place count 6711 transition count 4609
Reduce places removed 1402 places and 0 transitions.
Iterating post reduction 1 with 1402 rules applied. Total rules applied 2804 place count 5309 transition count 4609
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2804 place count 5309 transition count 3816
Deduced a syphon composed of 793 places in 11 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 4390 place count 4516 transition count 3816
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4397 place count 4509 transition count 3809
Iterating global reduction 2 with 7 rules applied. Total rules applied 4404 place count 4509 transition count 3809
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4404 place count 4509 transition count 3803
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4416 place count 4503 transition count 3803
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7816 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7817 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7819 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8021 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8223 place count 2600 transition count 2101
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8417 place count 2503 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8419 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8420 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8420 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8424 place count 2498 transition count 2097
Applied a total of 8424 rules in 1940 ms. Remains 2498 /6712 variables (removed 4214) and now considering 2097/6012 (removed 3915) transitions.
// Phase 1: matrix 2097 rows 2498 cols
[2024-05-29 14:35:14] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:35:16] [INFO ] Implicit Places using invariants in 1824 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1826 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2496/6712 places, 2097/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 158 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:35:16] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:35:17] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2024-05-29 14:35:17] [INFO ] Invariant cache hit.
[2024-05-29 14:35:21] [INFO ] Implicit Places using invariants and state equation in 3728 ms returned []
Implicit Place search using SMT with State Equation took 5426 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2494/6712 places, 2095/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9351 ms. Remains : 2494/6712 places, 2095/6012 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1430 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-04 finished in 10838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0 U p1) U p2))))'
Support contains 4 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 6701 transition count 6001
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 6701 transition count 6001
Applied a total of 22 rules in 2232 ms. Remains 6701 /6712 variables (removed 11) and now considering 6001/6012 (removed 11) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2024-05-29 14:35:25] [INFO ] Computed 1101 invariants in 21 ms
[2024-05-29 14:35:27] [INFO ] Implicit Places using invariants in 2569 ms returned []
[2024-05-29 14:35:27] [INFO ] Invariant cache hit.
[2024-05-29 14:35:30] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 5196 ms to find 0 implicit places.
[2024-05-29 14:35:30] [INFO ] Invariant cache hit.
[2024-05-29 14:35:35] [INFO ] Dead Transitions using invariants and state equation in 4568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6712 places, 6001/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11998 ms. Remains : 6701/6712 places, 6001/6012 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s4100 1), p1:(NEQ s899 1), p0:(AND (EQ s4027 1) (EQ s4053 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 1326 ms.
Stack based approach found an accepted trace after 11570 steps with 3 reset with depth 5198 and stack size 5198 in 180 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-05 finished in 13783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))&&F(p2)))'
Support contains 2 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6702 transition count 6002
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6702 transition count 6002
Applied a total of 20 rules in 2259 ms. Remains 6702 /6712 variables (removed 10) and now considering 6002/6012 (removed 10) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:35:39] [INFO ] Computed 1101 invariants in 30 ms
[2024-05-29 14:35:41] [INFO ] Implicit Places using invariants in 2552 ms returned []
[2024-05-29 14:35:41] [INFO ] Invariant cache hit.
[2024-05-29 14:35:44] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 5241 ms to find 0 implicit places.
[2024-05-29 14:35:44] [INFO ] Invariant cache hit.
[2024-05-29 14:35:49] [INFO ] Dead Transitions using invariants and state equation in 5018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6712 places, 6002/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12519 ms. Remains : 6702/6712 places, 6002/6012 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s4060 0), p0:(EQ s4060 1), p1:(EQ s1927 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1543 ms.
Product exploration explored 100000 steps with 0 reset in 1978 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 213565 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213565 steps, saw 207374 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:35:56] [INFO ] Invariant cache hit.
[2024-05-29 14:35:57] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:35:58] [INFO ] [Nat]Absence check using 1101 positive place invariants in 697 ms returned sat
[2024-05-29 14:36:04] [INFO ] After 5800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:36:07] [INFO ] Deduced a trap composed of 27 places in 2315 ms of which 4 ms to minimize.
[2024-05-29 14:36:09] [INFO ] Deduced a trap composed of 24 places in 2259 ms of which 3 ms to minimize.
[2024-05-29 14:36:12] [INFO ] Deduced a trap composed of 21 places in 2329 ms of which 3 ms to minimize.
[2024-05-29 14:36:14] [INFO ] Deduced a trap composed of 22 places in 2367 ms of which 3 ms to minimize.
[2024-05-29 14:36:17] [INFO ] Deduced a trap composed of 23 places in 2362 ms of which 3 ms to minimize.
[2024-05-29 14:36:19] [INFO ] Deduced a trap composed of 22 places in 2310 ms of which 3 ms to minimize.
[2024-05-29 14:36:22] [INFO ] Deduced a trap composed of 23 places in 2287 ms of which 3 ms to minimize.
[2024-05-29 14:36:29] [INFO ] Deduced a trap composed of 16 places in 6800 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:36:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:36:29] [INFO ] After 31823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 125 ms.
Support contains 1 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6702 transition count 4602
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5302 transition count 4602
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2800 place count 5302 transition count 3803
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4398 place count 4503 transition count 3803
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 5 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2600 transition count 2101
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2503 transition count 2101
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8400 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8401 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8700 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8701 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8702 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8702 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8706 place count 2498 transition count 2097
Applied a total of 8706 rules in 1872 ms. Remains 2498 /6702 variables (removed 4204) and now considering 2097/6002 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1873 ms. Remains : 2498/6702 places, 2097/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67209 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67209 steps, saw 45516 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2498 cols
[2024-05-29 14:36:34] [INFO ] Computed 1100 invariants in 19 ms
[2024-05-29 14:36:34] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:36:35] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2024-05-29 14:36:36] [INFO ] After 1157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:36:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:36:36] [INFO ] After 70ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:36:36] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:36:37] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:36:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2024-05-29 14:36:37] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 14:36:37] [INFO ] After 2418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 103 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2498/2498 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2097/2097 transitions.
Applied a total of 0 rules in 102 ms. Remains 2498 /2498 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:36:37] [INFO ] Invariant cache hit.
[2024-05-29 14:36:39] [INFO ] Implicit Places using invariants in 2067 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2069 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2496/2498 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 163 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:36:39] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:36:41] [INFO ] Implicit Places using invariants in 2071 ms returned []
[2024-05-29 14:36:41] [INFO ] Invariant cache hit.
[2024-05-29 14:36:45] [INFO ] Implicit Places using invariants and state equation in 3706 ms returned []
Implicit Place search using SMT with State Equation took 5778 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2494/2498 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8113 ms. Remains : 2494/2498 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66501 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66501 steps, saw 45107 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:36:48] [INFO ] Invariant cache hit.
[2024-05-29 14:36:49] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:36:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2024-05-29 14:36:50] [INFO ] After 1135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:36:50] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2024-05-29 14:36:51] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2024-05-29 14:36:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2024-05-29 14:36:51] [INFO ] After 1731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:36:51] [INFO ] After 2321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 89 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 101 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:36:51] [INFO ] Invariant cache hit.
[2024-05-29 14:36:53] [INFO ] Implicit Places using invariants in 1912 ms returned []
[2024-05-29 14:36:53] [INFO ] Invariant cache hit.
[2024-05-29 14:36:57] [INFO ] Implicit Places using invariants and state equation in 4084 ms returned []
Implicit Place search using SMT with State Equation took 5996 ms to find 0 implicit places.
[2024-05-29 14:36:57] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:36:57] [INFO ] Invariant cache hit.
[2024-05-29 14:36:59] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7724 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 244 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:36:59] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:36:59] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:37:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 180 ms returned sat
[2024-05-29 14:37:01] [INFO ] After 1108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:37:01] [INFO ] State equation strengthened by 594 read => feed constraints.
[2024-05-29 14:37:01] [INFO ] After 240ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:37:02] [INFO ] Deduced a trap composed of 5 places in 641 ms of which 2 ms to minimize.
[2024-05-29 14:37:03] [INFO ] Deduced a trap composed of 9 places in 680 ms of which 1 ms to minimize.
[2024-05-29 14:37:03] [INFO ] Deduced a trap composed of 7 places in 700 ms of which 1 ms to minimize.
[2024-05-29 14:37:04] [INFO ] Deduced a trap composed of 11 places in 690 ms of which 2 ms to minimize.
[2024-05-29 14:37:05] [INFO ] Deduced a trap composed of 5 places in 625 ms of which 2 ms to minimize.
[2024-05-29 14:37:06] [INFO ] Deduced a trap composed of 7 places in 645 ms of which 1 ms to minimize.
[2024-05-29 14:37:07] [INFO ] Deduced a trap composed of 5 places in 714 ms of which 1 ms to minimize.
[2024-05-29 14:37:07] [INFO ] Deduced a trap composed of 11 places in 665 ms of which 1 ms to minimize.
[2024-05-29 14:37:08] [INFO ] Deduced a trap composed of 7 places in 675 ms of which 1 ms to minimize.
[2024-05-29 14:37:09] [INFO ] Deduced a trap composed of 5 places in 714 ms of which 1 ms to minimize.
[2024-05-29 14:37:10] [INFO ] Deduced a trap composed of 5 places in 651 ms of which 1 ms to minimize.
[2024-05-29 14:37:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8665 ms
[2024-05-29 14:37:10] [INFO ] After 8993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-29 14:37:10] [INFO ] After 10697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (AND (NOT p0) p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 77 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 38 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Support contains 1 out of 6702 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 : 6702/6702 places, 6002/6002 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 4602
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5302 transition count 4602
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2798 place count 5302 transition count 3803
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4396 place count 4503 transition count 3803
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7792 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7793 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7795 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 20 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7997 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8199 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8391 place count 2506 transition count 2103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8392 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8394 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8395 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8395 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8399 place count 2501 transition count 2099
Applied a total of 8399 rules in 1813 ms. Remains 2501 /6702 variables (removed 4201) and now considering 2099/6002 (removed 3903) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2024-05-29 14:37:12] [INFO ] Computed 1100 invariants in 4 ms
[2024-05-29 14:37:14] [INFO ] Implicit Places using invariants in 2029 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2030 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6702 places, 2099/6002 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 201 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:37:14] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:37:16] [INFO ] Implicit Places using invariants in 2024 ms returned []
[2024-05-29 14:37:16] [INFO ] Invariant cache hit.
[2024-05-29 14:37:20] [INFO ] Implicit Places using invariants and state equation in 3515 ms returned []
Implicit Place search using SMT with State Equation took 5542 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6702 places, 2097/6002 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9587 ms. Remains : 2497/6702 places, 2097/6002 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 63 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 37 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92123 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92123 steps, saw 69900 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:37:23] [INFO ] Invariant cache hit.
[2024-05-29 14:37:24] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:37:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 218 ms returned sat
[2024-05-29 14:37:25] [INFO ] After 1149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:37:25] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:37:25] [INFO ] After 1875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 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 2497 transition count 2096
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2496 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 195 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2097 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 2495/2497 places, 2096/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93542 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93542 steps, saw 71084 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2024-05-29 14:37:29] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:37:29] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:37:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 206 ms returned sat
[2024-05-29 14:37:31] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:37:31] [INFO ] After 1228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 14:37:31] [INFO ] After 1832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 86 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2495/2495 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2096/2096 transitions.
Applied a total of 0 rules in 89 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2024-05-29 14:37:31] [INFO ] Invariant cache hit.
[2024-05-29 14:37:33] [INFO ] Implicit Places using invariants in 1922 ms returned []
[2024-05-29 14:37:33] [INFO ] Invariant cache hit.
[2024-05-29 14:37:37] [INFO ] Implicit Places using invariants and state equation in 4002 ms returned []
Implicit Place search using SMT with State Equation took 5925 ms to find 0 implicit places.
[2024-05-29 14:37:37] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-29 14:37:37] [INFO ] Invariant cache hit.
[2024-05-29 14:37:39] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7711 ms. Remains : 2495/2495 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2495 transition count 2096
Applied a total of 596 rules in 204 ms. Remains 2495 /2495 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2495 cols
[2024-05-29 14:37:39] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:37:39] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:37:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:37:41] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:37:41] [INFO ] After 1284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:37:41] [INFO ] After 1929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 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 37 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1446 ms.
Product exploration explored 100000 steps with 0 reset in 1875 ms.
Built C files in :
/tmp/ltsmin3325938950063428742
[2024-05-29 14:37:45] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:37:45] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3325938950063428742
Running compilation step : cd /tmp/ltsmin3325938950063428742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3325938950063428742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3325938950063428742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 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 2497 transition count 2096
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2496 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 185 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2097 (removed 1) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2024-05-29 14:37:48] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:37:50] [INFO ] Implicit Places using invariants in 1778 ms returned []
[2024-05-29 14:37:50] [INFO ] Invariant cache hit.
[2024-05-29 14:37:54] [INFO ] Implicit Places using invariants and state equation in 3835 ms returned []
Implicit Place search using SMT with State Equation took 5615 ms to find 0 implicit places.
[2024-05-29 14:37:54] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:37:54] [INFO ] Invariant cache hit.
[2024-05-29 14:37:55] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2497 places, 2096/2097 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7405 ms. Remains : 2495/2497 places, 2096/2097 transitions.
Built C files in :
/tmp/ltsmin5900364631906102383
[2024-05-29 14:37:55] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:37:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5900364631906102383
Running compilation step : cd /tmp/ltsmin5900364631906102383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5900364631906102383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5900364631906102383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:37:59] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:37:59] [INFO ] Flatten gal took : 60 ms
[2024-05-29 14:37:59] [INFO ] Time to serialize gal into /tmp/LTL17226321715662774583.gal : 9 ms
[2024-05-29 14:37:59] [INFO ] Time to serialize properties into /tmp/LTL17772702884259697899.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17226321715662774583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18180730284365881667.hoa' '-atoms' '/tmp/LTL17772702884259697899.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17772702884259697899.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18180730284365881667.hoa
Detected timeout of ITS tools.
[2024-05-29 14:38:14] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:38:14] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:38:14] [INFO ] Time to serialize gal into /tmp/LTL12859348004435899281.gal : 7 ms
[2024-05-29 14:38:14] [INFO ] Time to serialize properties into /tmp/LTL18290145259720584589.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12859348004435899281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18290145259720584589.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(("(p4717==1)")||(G("(p2227==0)"))))&&(F("(p4717==0)"))))
Formula 0 simplified : X(!"(p4717==1)" & F!"(p2227==0)") | G!"(p4717==0)"
Detected timeout of ITS tools.
[2024-05-29 14:38:29] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:38:29] [INFO ] Applying decomposition
[2024-05-29 14:38:29] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph908458725494993824.txt' '-o' '/tmp/graph908458725494993824.bin' '-w' '/tmp/graph908458725494993824.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph908458725494993824.bin' '-l' '-1' '-v' '-w' '/tmp/graph908458725494993824.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:38:29] [INFO ] Decomposing Gal with order
[2024-05-29 14:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:38:29] [INFO ] Removed a total of 603 redundant transitions.
[2024-05-29 14:38:29] [INFO ] Flatten gal took : 89 ms
[2024-05-29 14:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 14 ms.
[2024-05-29 14:38:29] [INFO ] Time to serialize gal into /tmp/LTL13576917898012652047.gal : 18 ms
[2024-05-29 14:38:29] [INFO ] Time to serialize properties into /tmp/LTL15107924167963956945.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13576917898012652047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15107924167963956945.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(("(i25.i0.i2.u483.p4717==1)")||(G("(i11.i2.i0.u225.p2227==0)"))))&&(F("(i25.i0.i2.u483.p4717==0)"))))
Formula 0 simplified : X(!"(i25.i0.i2.u483.p4717==1)" & F!"(i11.i2.i0.u225.p2227==0)") | G!"(i25.i0.i2.u483.p4717==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4413279788930076395
[2024-05-29 14:38:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4413279788930076395
Running compilation step : cd /tmp/ltsmin4413279788930076395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4413279788930076395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4413279788930076395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-06 finished in 191077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6711 transition count 4610
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5310 transition count 4610
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2802 place count 5310 transition count 3817
Deduced a syphon composed of 793 places in 11 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 4388 place count 4517 transition count 3817
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 4396 place count 4509 transition count 3809
Iterating global reduction 2 with 8 rules applied. Total rules applied 4404 place count 4509 transition count 3809
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4404 place count 4509 transition count 3802
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4418 place count 4502 transition count 3802
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7814 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7815 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7817 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8019 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8221 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8415 place count 2504 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8417 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8418 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8418 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8422 place count 2499 transition count 2098
Applied a total of 8422 rules in 2065 ms. Remains 2499 /6712 variables (removed 4213) and now considering 2098/6012 (removed 3914) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2024-05-29 14:38:50] [INFO ] Computed 1100 invariants in 5 ms
[2024-05-29 14:38:51] [INFO ] Implicit Places using invariants in 1849 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1866 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6712 places, 2098/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 177 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2024-05-29 14:38:52] [INFO ] Computed 1098 invariants in 3 ms
[2024-05-29 14:38:53] [INFO ] Implicit Places using invariants in 1848 ms returned []
[2024-05-29 14:38:53] [INFO ] Invariant cache hit.
[2024-05-29 14:38:57] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 5658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6712 places, 2096/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9766 ms. Remains : 2495/6712 places, 2096/6012 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s230 1), p1:(EQ s2056 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1467 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-07 finished in 11300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(((p1 U p2)||(G(p3)&&F(p4))))))))'
Support contains 5 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6711 transition count 4614
Reduce places removed 1397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2796 place count 5314 transition count 4612
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2798 place count 5312 transition count 4612
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 793 Pre rules applied. Total rules applied 2798 place count 5312 transition count 3819
Deduced a syphon composed of 793 places in 11 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 4384 place count 4519 transition count 3819
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 4392 place count 4511 transition count 3811
Iterating global reduction 3 with 8 rules applied. Total rules applied 4400 place count 4511 transition count 3811
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4400 place count 4511 transition count 3804
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4414 place count 4504 transition count 3804
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7804 place count 2809 transition count 2109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7805 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7807 place count 2808 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8009 place count 2707 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8211 place count 2606 transition count 2107
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 8401 place count 2511 transition count 2107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2509 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2508 transition count 2105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2508 transition count 2103
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2506 transition count 2103
Applied a total of 8408 rules in 2067 ms. Remains 2506 /6712 variables (removed 4206) and now considering 2103/6012 (removed 3909) transitions.
// Phase 1: matrix 2103 rows 2506 cols
[2024-05-29 14:39:01] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:39:03] [INFO ] Implicit Places using invariants in 1835 ms returned [2489, 2493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1837 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2504/6712 places, 2103/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2502 transition count 2101
Applied a total of 4 rules in 163 ms. Remains 2502 /2504 variables (removed 2) and now considering 2101/2103 (removed 2) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2024-05-29 14:39:03] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:39:05] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-29 14:39:05] [INFO ] Invariant cache hit.
[2024-05-29 14:39:08] [INFO ] Implicit Places using invariants and state equation in 3797 ms returned []
Implicit Place search using SMT with State Equation took 5634 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2502/6712 places, 2101/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9704 ms. Remains : 2502/6712 places, 2101/6012 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s352 1), p2:(AND (EQ s957 1) (EQ s982 1)), p3:(EQ s149 1), p4:(EQ s1960 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1434 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-08 finished in 11319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6711 transition count 4610
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5310 transition count 4610
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2802 place count 5310 transition count 3818
Deduced a syphon composed of 792 places in 13 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 4386 place count 4518 transition count 3818
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 4394 place count 4510 transition count 3810
Iterating global reduction 2 with 8 rules applied. Total rules applied 4402 place count 4510 transition count 3810
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4402 place count 4510 transition count 3803
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4416 place count 4503 transition count 3803
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7816 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7817 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7819 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8021 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8223 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 9 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8415 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8417 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8418 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8418 place count 2501 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8422 place count 2499 transition count 2097
Applied a total of 8422 rules in 2035 ms. Remains 2499 /6712 variables (removed 4213) and now considering 2097/6012 (removed 3915) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2024-05-29 14:39:12] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:39:14] [INFO ] Implicit Places using invariants in 1848 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1852 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6712 places, 2097/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 159 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:39:14] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:39:16] [INFO ] Implicit Places using invariants in 1791 ms returned []
[2024-05-29 14:39:16] [INFO ] Invariant cache hit.
[2024-05-29 14:39:19] [INFO ] Implicit Places using invariants and state equation in 3501 ms returned []
Implicit Place search using SMT with State Equation took 5292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6712 places, 2095/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9339 ms. Remains : 2495/6712 places, 2095/6012 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1947 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 0 reset in 1396 ms.
Product exploration explored 100000 steps with 0 reset in 1952 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 94111 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94111 steps, saw 71541 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:39:26] [INFO ] Invariant cache hit.
[2024-05-29 14:39:27] [INFO ] [Real]Absence check using 1098 positive place invariants in 231 ms returned sat
[2024-05-29 14:39:28] [INFO ] After 1166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:39:28] [INFO ] After 1294ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 14:39:28] [INFO ] After 1945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91810 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91810 steps, saw 69673 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:39:32] [INFO ] Invariant cache hit.
[2024-05-29 14:39:32] [INFO ] [Real]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:39:33] [INFO ] After 1146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:39:33] [INFO ] After 1270ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 14:39:34] [INFO ] After 1900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 95 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:39:34] [INFO ] Invariant cache hit.
[2024-05-29 14:39:36] [INFO ] Implicit Places using invariants in 1894 ms returned []
[2024-05-29 14:39:36] [INFO ] Invariant cache hit.
[2024-05-29 14:39:39] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 5687 ms to find 0 implicit places.
[2024-05-29 14:39:40] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:39:40] [INFO ] Invariant cache hit.
[2024-05-29 14:39:41] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7384 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 208 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:39:41] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:39:42] [INFO ] [Real]Absence check using 1098 positive place invariants in 204 ms returned sat
[2024-05-29 14:39:43] [INFO ] After 1085ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:39:43] [INFO ] After 1207ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:39:43] [INFO ] After 1807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 86 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:39:43] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:39:45] [INFO ] Implicit Places using invariants in 1818 ms returned []
[2024-05-29 14:39:45] [INFO ] Invariant cache hit.
[2024-05-29 14:39:49] [INFO ] Implicit Places using invariants and state equation in 3475 ms returned []
Implicit Place search using SMT with State Equation took 5296 ms to find 0 implicit places.
[2024-05-29 14:39:49] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:39:49] [INFO ] Invariant cache hit.
[2024-05-29 14:39:50] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6955 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93009 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 93009 steps, saw 70653 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:39:54] [INFO ] Invariant cache hit.
[2024-05-29 14:39:54] [INFO ] [Real]Absence check using 1098 positive place invariants in 204 ms returned sat
[2024-05-29 14:39:55] [INFO ] After 1126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:39:55] [INFO ] After 1260ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 14:39:56] [INFO ] After 1867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 101 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96775 steps, run timeout after 3024 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96775 steps, saw 73416 distinct states, run finished after 3024 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:39:59] [INFO ] Invariant cache hit.
[2024-05-29 14:40:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:40:01] [INFO ] After 1119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:40:01] [INFO ] After 1245ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-29 14:40:01] [INFO ] After 1854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 82 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 82 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:40:01] [INFO ] Invariant cache hit.
[2024-05-29 14:40:03] [INFO ] Implicit Places using invariants in 1809 ms returned []
[2024-05-29 14:40:03] [INFO ] Invariant cache hit.
[2024-05-29 14:40:07] [INFO ] Implicit Places using invariants and state equation in 3773 ms returned []
Implicit Place search using SMT with State Equation took 5584 ms to find 0 implicit places.
[2024-05-29 14:40:07] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 14:40:07] [INFO ] Invariant cache hit.
[2024-05-29 14:40:08] [INFO ] Dead Transitions using invariants and state equation in 1603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7323 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 197 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:40:08] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:40:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:40:10] [INFO ] After 1112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 14:40:10] [INFO ] After 1240ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:40:10] [INFO ] After 1853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1375 ms.
Product exploration explored 100000 steps with 0 reset in 1932 ms.
Built C files in :
/tmp/ltsmin8908214450184792186
[2024-05-29 14:40:14] [INFO ] Too many transitions (2095) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:40:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8908214450184792186
Running compilation step : cd /tmp/ltsmin8908214450184792186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8908214450184792186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8908214450184792186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:40:17] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:40:19] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2024-05-29 14:40:19] [INFO ] Invariant cache hit.
[2024-05-29 14:40:23] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 5832 ms to find 0 implicit places.
[2024-05-29 14:40:23] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:40:23] [INFO ] Invariant cache hit.
[2024-05-29 14:40:25] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7604 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Built C files in :
/tmp/ltsmin8945818326924290437
[2024-05-29 14:40:25] [INFO ] Too many transitions (2095) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:40:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8945818326924290437
Running compilation step : cd /tmp/ltsmin8945818326924290437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8945818326924290437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8945818326924290437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:40:28] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:40:28] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:40:28] [INFO ] Time to serialize gal into /tmp/LTL9784129512260803678.gal : 8 ms
[2024-05-29 14:40:28] [INFO ] Time to serialize properties into /tmp/LTL8199452492305251125.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9784129512260803678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5462794554728103528.hoa' '-atoms' '/tmp/LTL8199452492305251125.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8199452492305251125.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5462794554728103528.hoa
Detected timeout of ITS tools.
[2024-05-29 14:40:43] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:40:43] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:40:43] [INFO ] Time to serialize gal into /tmp/LTL830595673443493121.gal : 9 ms
[2024-05-29 14:40:43] [INFO ] Time to serialize properties into /tmp/LTL14858846533934315114.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL830595673443493121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14858846533934315114.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p6071!=1)"))))
Formula 0 simplified : FG!"(p6071!=1)"
Detected timeout of ITS tools.
[2024-05-29 14:40:58] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:40:58] [INFO ] Applying decomposition
[2024-05-29 14:40:58] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18056560916369443231.txt' '-o' '/tmp/graph18056560916369443231.bin' '-w' '/tmp/graph18056560916369443231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18056560916369443231.bin' '-l' '-1' '-v' '-w' '/tmp/graph18056560916369443231.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:40:58] [INFO ] Decomposing Gal with order
[2024-05-29 14:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:40:59] [INFO ] Removed a total of 605 redundant transitions.
[2024-05-29 14:40:59] [INFO ] Flatten gal took : 76 ms
[2024-05-29 14:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 21 ms.
[2024-05-29 14:40:59] [INFO ] Time to serialize gal into /tmp/LTL12228375325803448484.gal : 16 ms
[2024-05-29 14:40:59] [INFO ] Time to serialize properties into /tmp/LTL5296222943591621273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12228375325803448484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5296222943591621273.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(i35.i1.i0.u625.p6071!=1)"))))
Formula 0 simplified : FG!"(i35.i1.i0.u625.p6071!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1110 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,11.3839,181904,1,0,277447,332,5587,623732,214,1773,342368
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-09 finished in 120736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((G(F(!p0))||(!p1&&F(!p0)))))||(!p0&&F((G(F(!p0))||(!p1&&F(!p0))))))))))'
Support contains 4 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 6701 transition count 6001
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 6701 transition count 6001
Applied a total of 22 rules in 2261 ms. Remains 6701 /6712 variables (removed 11) and now considering 6001/6012 (removed 11) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2024-05-29 14:41:13] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 14:41:16] [INFO ] Implicit Places using invariants in 2642 ms returned []
[2024-05-29 14:41:16] [INFO ] Invariant cache hit.
[2024-05-29 14:41:18] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 5033 ms to find 0 implicit places.
[2024-05-29 14:41:18] [INFO ] Invariant cache hit.
[2024-05-29 14:41:23] [INFO ] Dead Transitions using invariants and state equation in 5163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6712 places, 6001/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12458 ms. Remains : 6701/6712 places, 6001/6012 transitions.
Stuttering acceptance computed with spot in 205 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3168 1) (EQ s3170 1)), p1:(OR (EQ s525 1) (EQ s1581 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3772 ms.
Product exploration explored 100000 steps with 33333 reset in 3708 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-10 finished in 20411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 2 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6702 transition count 6002
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6702 transition count 6002
Applied a total of 20 rules in 2360 ms. Remains 6702 /6712 variables (removed 10) and now considering 6002/6012 (removed 10) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:41:34] [INFO ] Computed 1101 invariants in 28 ms
[2024-05-29 14:41:36] [INFO ] Implicit Places using invariants in 2658 ms returned []
[2024-05-29 14:41:36] [INFO ] Invariant cache hit.
[2024-05-29 14:41:39] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 5330 ms to find 0 implicit places.
[2024-05-29 14:41:39] [INFO ] Invariant cache hit.
[2024-05-29 14:41:44] [INFO ] Dead Transitions using invariants and state equation in 4906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6712 places, 6002/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12598 ms. Remains : 6702/6712 places, 6002/6012 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s5591 1), p1:(EQ s2677 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-12 finished in 12810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 6702 transition count 6002
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 6702 transition count 6002
Applied a total of 20 rules in 2262 ms. Remains 6702 /6712 variables (removed 10) and now considering 6002/6012 (removed 10) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:41:46] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 14:41:49] [INFO ] Implicit Places using invariants in 2650 ms returned []
[2024-05-29 14:41:49] [INFO ] Invariant cache hit.
[2024-05-29 14:41:52] [INFO ] Implicit Places using invariants and state equation in 2577 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
[2024-05-29 14:41:52] [INFO ] Invariant cache hit.
[2024-05-29 14:41:56] [INFO ] Dead Transitions using invariants and state equation in 4932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6712 places, 6002/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12426 ms. Remains : 6702/6712 places, 6002/6012 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s404 1), p0:(EQ s5501 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1453 ms.
Product exploration explored 100000 steps with 0 reset in 1921 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 199718 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199718 steps, saw 196659 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:42:04] [INFO ] Invariant cache hit.
[2024-05-29 14:42:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 722 ms returned sat
[2024-05-29 14:42:06] [INFO ] After 1768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:42:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 725 ms returned sat
[2024-05-29 14:42:14] [INFO ] After 6591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:42:17] [INFO ] Deduced a trap composed of 24 places in 2577 ms of which 4 ms to minimize.
[2024-05-29 14:42:19] [INFO ] Deduced a trap composed of 22 places in 2474 ms of which 4 ms to minimize.
[2024-05-29 14:42:22] [INFO ] Deduced a trap composed of 25 places in 2434 ms of which 3 ms to minimize.
[2024-05-29 14:42:25] [INFO ] Deduced a trap composed of 21 places in 2467 ms of which 4 ms to minimize.
[2024-05-29 14:42:27] [INFO ] Deduced a trap composed of 24 places in 2419 ms of which 4 ms to minimize.
[2024-05-29 14:42:30] [INFO ] Deduced a trap composed of 18 places in 2462 ms of which 3 ms to minimize.
[2024-05-29 14:42:32] [INFO ] Deduced a trap composed of 20 places in 2258 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:42:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:42:32] [INFO ] After 26918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 924 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8003 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 1640 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1640 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 82127 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 82127 steps, saw 64566 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2024-05-29 14:42:39] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:42:39] [INFO ] [Real]Absence check using 1100 positive place invariants in 230 ms returned sat
[2024-05-29 14:42:40] [INFO ] After 1847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:42:41] [INFO ] [Nat]Absence check using 1100 positive place invariants in 203 ms returned sat
[2024-05-29 14:42:42] [INFO ] After 1103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:42:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:42:42] [INFO ] After 73ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:42:42] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 14:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-05-29 14:42:42] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:42:43] [INFO ] After 2122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 181 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72179 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72179 steps, saw 48295 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2024-05-29 14:42:46] [INFO ] Computed 1100 invariants in 10 ms
[2024-05-29 14:42:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 203 ms returned sat
[2024-05-29 14:42:48] [INFO ] After 1630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:42:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 206 ms returned sat
[2024-05-29 14:42:49] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:42:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:42:49] [INFO ] After 72ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:42:49] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 14:42:50] [INFO ] After 1913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:42:50] [INFO ] Invariant cache hit.
[2024-05-29 14:42:52] [INFO ] Implicit Places using invariants in 1852 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1854 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 172 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:42:52] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:42:54] [INFO ] Implicit Places using invariants in 1848 ms returned []
[2024-05-29 14:42:54] [INFO ] Invariant cache hit.
[2024-05-29 14:42:58] [INFO ] Implicit Places using invariants and state equation in 3920 ms returned []
Implicit Place search using SMT with State Equation took 5770 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7879 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 74354 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74354 steps, saw 50974 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:43:01] [INFO ] Invariant cache hit.
[2024-05-29 14:43:01] [INFO ] [Real]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:43:03] [INFO ] After 1732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:43:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:43:04] [INFO ] After 1184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:43:04] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:43:04] [INFO ] After 1934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 85 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 84 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:43:05] [INFO ] Invariant cache hit.
[2024-05-29 14:43:07] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2024-05-29 14:43:07] [INFO ] Invariant cache hit.
[2024-05-29 14:43:10] [INFO ] Implicit Places using invariants and state equation in 3849 ms returned []
Implicit Place search using SMT with State Equation took 5819 ms to find 0 implicit places.
[2024-05-29 14:43:11] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:43:11] [INFO ] Invariant cache hit.
[2024-05-29 14:43:12] [INFO ] Dead Transitions using invariants and state equation in 1547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7508 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 201 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:43:12] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:43:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:43:14] [INFO ] After 1645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:43:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 211 ms returned sat
[2024-05-29 14:43:16] [INFO ] After 1181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:43:16] [INFO ] State equation strengthened by 592 read => feed constraints.
[2024-05-29 14:43:16] [INFO ] After 255ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:43:16] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-29 14:43:16] [INFO ] After 2233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1048 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:43:18] [INFO ] Computed 1101 invariants in 25 ms
[2024-05-29 14:43:20] [INFO ] Implicit Places using invariants in 2607 ms returned []
[2024-05-29 14:43:20] [INFO ] Invariant cache hit.
[2024-05-29 14:43:23] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 5241 ms to find 0 implicit places.
[2024-05-29 14:43:23] [INFO ] Invariant cache hit.
[2024-05-29 14:43:28] [INFO ] Dead Transitions using invariants and state equation in 5271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11563 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 199340 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199340 steps, saw 196295 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:43:32] [INFO ] Invariant cache hit.
[2024-05-29 14:43:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 703 ms returned sat
[2024-05-29 14:43:34] [INFO ] After 1723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:43:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 705 ms returned sat
[2024-05-29 14:43:42] [INFO ] After 6302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:43:45] [INFO ] Deduced a trap composed of 24 places in 2582 ms of which 3 ms to minimize.
[2024-05-29 14:43:48] [INFO ] Deduced a trap composed of 22 places in 2539 ms of which 3 ms to minimize.
[2024-05-29 14:43:50] [INFO ] Deduced a trap composed of 25 places in 2523 ms of which 3 ms to minimize.
[2024-05-29 14:43:53] [INFO ] Deduced a trap composed of 21 places in 2527 ms of which 4 ms to minimize.
[2024-05-29 14:43:56] [INFO ] Deduced a trap composed of 24 places in 2509 ms of which 3 ms to minimize.
[2024-05-29 14:43:58] [INFO ] Deduced a trap composed of 18 places in 2458 ms of which 4 ms to minimize.
[2024-05-29 14:44:01] [INFO ] Deduced a trap composed of 20 places in 2175 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:44:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:44:01] [INFO ] After 26919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 873 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8003 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 1670 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1670 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 78629 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 78629 steps, saw 61446 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2024-05-29 14:44:07] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:44:07] [INFO ] [Real]Absence check using 1100 positive place invariants in 222 ms returned sat
[2024-05-29 14:44:09] [INFO ] After 1709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:44:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 215 ms returned sat
[2024-05-29 14:44:10] [INFO ] After 1190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:44:10] [INFO ] After 76ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:11] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 14:44:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2024-05-29 14:44:11] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 14:44:11] [INFO ] After 2240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 183 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72506 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72506 steps, saw 48542 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2024-05-29 14:44:14] [INFO ] Computed 1100 invariants in 9 ms
[2024-05-29 14:44:15] [INFO ] [Real]Absence check using 1100 positive place invariants in 212 ms returned sat
[2024-05-29 14:44:16] [INFO ] After 1688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:44:17] [INFO ] [Nat]Absence check using 1100 positive place invariants in 221 ms returned sat
[2024-05-29 14:44:18] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:44:18] [INFO ] After 74ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:18] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:44:18] [INFO ] After 1967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 87 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 88 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:44:18] [INFO ] Invariant cache hit.
[2024-05-29 14:44:20] [INFO ] Implicit Places using invariants in 1901 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1903 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 169 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:44:20] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:44:22] [INFO ] Implicit Places using invariants in 1782 ms returned []
[2024-05-29 14:44:22] [INFO ] Invariant cache hit.
[2024-05-29 14:44:26] [INFO ] Implicit Places using invariants and state equation in 3980 ms returned []
Implicit Place search using SMT with State Equation took 5765 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7925 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 71097 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71097 steps, saw 48710 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:44:29] [INFO ] Invariant cache hit.
[2024-05-29 14:44:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:44:31] [INFO ] After 1693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:44:31] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:44:33] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:33] [INFO ] After 1268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:44:33] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 103 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 103 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:44:33] [INFO ] Invariant cache hit.
[2024-05-29 14:44:35] [INFO ] Implicit Places using invariants in 1841 ms returned []
[2024-05-29 14:44:35] [INFO ] Invariant cache hit.
[2024-05-29 14:44:39] [INFO ] Implicit Places using invariants and state equation in 3852 ms returned []
Implicit Place search using SMT with State Equation took 5694 ms to find 0 implicit places.
[2024-05-29 14:44:39] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:44:39] [INFO ] Invariant cache hit.
[2024-05-29 14:44:40] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7381 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 198 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2024-05-29 14:44:41] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:44:41] [INFO ] [Real]Absence check using 1098 positive place invariants in 206 ms returned sat
[2024-05-29 14:44:42] [INFO ] After 1695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:44:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 201 ms returned sat
[2024-05-29 14:44:44] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:44] [INFO ] State equation strengthened by 592 read => feed constraints.
[2024-05-29 14:44:44] [INFO ] After 260ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:44:44] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-29 14:44:44] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1464 ms.
Product exploration explored 100000 steps with 0 reset in 1913 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6702 transition count 6002
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1399 place count 6702 transition count 6401
Deduced a syphon composed of 1899 places in 18 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1899 place count 6702 transition count 6401
Performed 1900 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3799 places in 23 ms
Iterating global reduction 1 with 1900 rules applied. Total rules applied 3799 place count 6702 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3800 place count 6702 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 2 with 702 rule applications. Total rules 4502 place count 6000 transition count 5698
Deduced a syphon composed of 3097 places in 19 ms
Iterating global reduction 2 with 702 rules applied. Total rules applied 5204 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3098 places in 21 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5205 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5207 place count 5998 transition count 5696
Deduced a syphon composed of 3096 places in 20 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5209 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3197 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5310 place count 5998 transition count 6123
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5411 place count 5897 transition count 5921
Deduced a syphon composed of 3096 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5512 place count 5897 transition count 5921
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3197 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5613 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5714 place count 5796 transition count 6149
Deduced a syphon composed of 3096 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5815 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3197 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5916 place count 5796 transition count 6579
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6017 place count 5695 transition count 6377
Deduced a syphon composed of 3096 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6118 place count 5695 transition count 6377
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -401
Deduced a syphon composed of 3191 places in 12 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6213 place count 5695 transition count 6778
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6308 place count 5600 transition count 6588
Deduced a syphon composed of 3096 places in 12 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6403 place count 5600 transition count 6588
Deduced a syphon composed of 3096 places in 13 ms
Applied a total of 6403 rules in 7697 ms. Remains 5600 /6702 variables (removed 1102) and now considering 6588/6002 (removed -586) transitions.
[2024-05-29 14:44:57] [INFO ] Redundant transitions in 316 ms returned []
// Phase 1: matrix 6588 rows 5600 cols
[2024-05-29 14:44:57] [INFO ] Computed 1101 invariants in 135 ms
[2024-05-29 14:45:01] [INFO ] Dead Transitions using invariants and state equation in 4470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6702 places, 6588/6002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12501 ms. Remains : 5600/6702 places, 6588/6002 transitions.
Built C files in :
/tmp/ltsmin16310909555684093783
[2024-05-29 14:45:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16310909555684093783
Running compilation step : cd /tmp/ltsmin16310909555684093783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16310909555684093783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16310909555684093783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1112 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2024-05-29 14:45:05] [INFO ] Computed 1101 invariants in 26 ms
[2024-05-29 14:45:08] [INFO ] Implicit Places using invariants in 2809 ms returned []
[2024-05-29 14:45:08] [INFO ] Invariant cache hit.
[2024-05-29 14:45:11] [INFO ] Implicit Places using invariants and state equation in 2808 ms returned []
Implicit Place search using SMT with State Equation took 5618 ms to find 0 implicit places.
[2024-05-29 14:45:11] [INFO ] Invariant cache hit.
[2024-05-29 14:45:16] [INFO ] Dead Transitions using invariants and state equation in 5144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11874 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Built C files in :
/tmp/ltsmin1606823842325371265
[2024-05-29 14:45:16] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1606823842325371265
Running compilation step : cd /tmp/ltsmin1606823842325371265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1606823842325371265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1606823842325371265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:45:19] [INFO ] Flatten gal took : 125 ms
[2024-05-29 14:45:20] [INFO ] Flatten gal took : 130 ms
[2024-05-29 14:45:20] [INFO ] Time to serialize gal into /tmp/LTL7926168816820205370.gal : 20 ms
[2024-05-29 14:45:20] [INFO ] Time to serialize properties into /tmp/LTL2363084874475398937.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7926168816820205370.gal' '-t' 'CGAL' '-hoa' '/tmp/aut931377166095381243.hoa' '-atoms' '/tmp/LTL2363084874475398937.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2363084874475398937.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut931377166095381243.hoa
Detected timeout of ITS tools.
[2024-05-29 14:45:35] [INFO ] Flatten gal took : 120 ms
[2024-05-29 14:45:35] [INFO ] Flatten gal took : 125 ms
[2024-05-29 14:45:35] [INFO ] Time to serialize gal into /tmp/LTL8253276140257702240.gal : 19 ms
[2024-05-29 14:45:35] [INFO ] Time to serialize properties into /tmp/LTL5431435049624884734.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8253276140257702240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5431435049624884734.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(p6397==0)"))||(X(F("(p449==1)"))))))
Formula 0 simplified : X(F!"(p6397==0)" & XG!"(p449==1)")
Detected timeout of ITS tools.
[2024-05-29 14:45:50] [INFO ] Flatten gal took : 117 ms
[2024-05-29 14:45:50] [INFO ] Applying decomposition
[2024-05-29 14:45:50] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3966187213399560796.txt' '-o' '/tmp/graph3966187213399560796.bin' '-w' '/tmp/graph3966187213399560796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3966187213399560796.bin' '-l' '-1' '-v' '-w' '/tmp/graph3966187213399560796.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:45:51] [INFO ] Decomposing Gal with order
[2024-05-29 14:45:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:45:52] [INFO ] Removed a total of 992 redundant transitions.
[2024-05-29 14:45:53] [INFO ] Flatten gal took : 202 ms
[2024-05-29 14:45:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 14:45:53] [INFO ] Time to serialize gal into /tmp/LTL13923465012979208899.gal : 50 ms
[2024-05-29 14:45:53] [INFO ] Time to serialize properties into /tmp/LTL13613394582073725072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13923465012979208899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13613394582073725072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("(i56.i0.i8.u1961.p6397==0)"))||(X(F("(i5.u149.p449==1)"))))))
Formula 0 simplified : X(F!"(i56.i0.i8.u1961.p6397==0)" & XG!"(i5.u149.p449==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin949271824865509364
[2024-05-29 14:46:08] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin949271824865509364
Running compilation step : cd /tmp/ltsmin949271824865509364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin949271824865509364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin949271824865509364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-13 finished in 266731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 6712 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6711 transition count 4611
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5311 transition count 4611
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2800 place count 5311 transition count 3817
Deduced a syphon composed of 794 places in 12 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 4388 place count 4517 transition count 3817
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 4396 place count 4509 transition count 3809
Iterating global reduction 2 with 8 rules applied. Total rules applied 4404 place count 4509 transition count 3809
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4404 place count 4509 transition count 3802
Deduced a syphon composed of 7 places in 28 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4418 place count 4502 transition count 3802
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 5 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7810 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7813 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8015 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8217 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8411 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8413 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8414 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8414 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8418 place count 2501 transition count 2100
Applied a total of 8418 rules in 2038 ms. Remains 2501 /6712 variables (removed 4211) and now considering 2100/6012 (removed 3912) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2024-05-29 14:46:13] [INFO ] Computed 1100 invariants in 4 ms
[2024-05-29 14:46:15] [INFO ] Implicit Places using invariants in 1829 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1832 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6712 places, 2100/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 169 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:46:15] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:46:17] [INFO ] Implicit Places using invariants in 1814 ms returned []
[2024-05-29 14:46:17] [INFO ] Invariant cache hit.
[2024-05-29 14:46:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:46:21] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 5678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6712 places, 2098/6012 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9720 ms. Remains : 2497/6712 places, 2098/6012 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s728 1), p1:(AND (EQ s1067 1) (EQ s1102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1372 ms.
Product exploration explored 100000 steps with 0 reset in 1846 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:46:25] [INFO ] Invariant cache hit.
[2024-05-29 14:46:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 218 ms returned sat
[2024-05-29 14:46:26] [INFO ] After 1178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 14:46:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:46:27] [INFO ] After 80ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:46:27] [INFO ] After 1883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:46:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:46:28] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:29] [INFO ] After 148ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:29] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-29 14:46:29] [INFO ] After 2403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 71 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 168 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 87081 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87081 steps, saw 63267 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:46:33] [INFO ] Computed 1098 invariants in 4 ms
[2024-05-29 14:46:33] [INFO ] [Real]Absence check using 1098 positive place invariants in 218 ms returned sat
[2024-05-29 14:46:34] [INFO ] After 1783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:46:35] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:46:36] [INFO ] After 1215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:46:36] [INFO ] After 151ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:37] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-29 14:46:37] [INFO ] After 2385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 86 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 82 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2024-05-29 14:46:37] [INFO ] Invariant cache hit.
[2024-05-29 14:46:39] [INFO ] Implicit Places using invariants in 1825 ms returned []
[2024-05-29 14:46:39] [INFO ] Invariant cache hit.
[2024-05-29 14:46:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:46:43] [INFO ] Implicit Places using invariants and state equation in 3908 ms returned []
Implicit Place search using SMT with State Equation took 5734 ms to find 0 implicit places.
[2024-05-29 14:46:43] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:46:43] [INFO ] Invariant cache hit.
[2024-05-29 14:46:44] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7425 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2497 transition count 2098
Applied a total of 598 rules in 196 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:46:45] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:46:45] [INFO ] [Real]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:46:46] [INFO ] After 1124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 14:46:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 14:46:46] [INFO ] After 80ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:46:46] [INFO ] After 1820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:46:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 209 ms returned sat
[2024-05-29 14:46:48] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:48] [INFO ] After 160ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:46:49] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:46:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-05-29 14:46:49] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-29 14:46:49] [INFO ] After 2587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 404 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 82 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:46:50] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:46:51] [INFO ] Implicit Places using invariants in 1835 ms returned []
[2024-05-29 14:46:51] [INFO ] Invariant cache hit.
[2024-05-29 14:46:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:46:55] [INFO ] Implicit Places using invariants and state equation in 3856 ms returned []
Implicit Place search using SMT with State Equation took 5693 ms to find 0 implicit places.
[2024-05-29 14:46:55] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:46:55] [INFO ] Invariant cache hit.
[2024-05-29 14:46:57] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7445 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:46:58] [INFO ] Invariant cache hit.
[2024-05-29 14:46:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:47:00] [INFO ] After 1160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 14:47:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:47:00] [INFO ] After 79ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:47:00] [INFO ] After 1870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:47:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 225 ms returned sat
[2024-05-29 14:47:02] [INFO ] After 1262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:02] [INFO ] After 149ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:02] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-29 14:47:02] [INFO ] After 2437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 76 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 166 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84458 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84458 steps, saw 61407 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:47:06] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:47:06] [INFO ] [Real]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:47:08] [INFO ] After 1785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:47:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 218 ms returned sat
[2024-05-29 14:47:10] [INFO ] After 1245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:47:10] [INFO ] After 151ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:10] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-29 14:47:10] [INFO ] After 2445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 99 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2024-05-29 14:47:10] [INFO ] Invariant cache hit.
[2024-05-29 14:47:12] [INFO ] Implicit Places using invariants in 1953 ms returned []
[2024-05-29 14:47:12] [INFO ] Invariant cache hit.
[2024-05-29 14:47:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:47:16] [INFO ] Implicit Places using invariants and state equation in 4021 ms returned []
Implicit Place search using SMT with State Equation took 5987 ms to find 0 implicit places.
[2024-05-29 14:47:16] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:47:16] [INFO ] Invariant cache hit.
[2024-05-29 14:47:18] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7695 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2497 transition count 2098
Applied a total of 598 rules in 204 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:47:18] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:47:19] [INFO ] [Real]Absence check using 1098 positive place invariants in 222 ms returned sat
[2024-05-29 14:47:20] [INFO ] After 1151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 14:47:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 14:47:20] [INFO ] After 81ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:47:20] [INFO ] After 1866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:47:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 223 ms returned sat
[2024-05-29 14:47:22] [INFO ] After 1229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:22] [INFO ] After 155ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:47:22] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:47:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2024-05-29 14:47:23] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-29 14:47:23] [INFO ] After 2651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1392 ms.
Product exploration explored 100000 steps with 0 reset in 1885 ms.
Built C files in :
/tmp/ltsmin17830034909942948086
[2024-05-29 14:47:27] [INFO ] Too many transitions (2098) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:47:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17830034909942948086
Running compilation step : cd /tmp/ltsmin17830034909942948086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17830034909942948086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17830034909942948086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:47:30] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:47:32] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2024-05-29 14:47:32] [INFO ] Invariant cache hit.
[2024-05-29 14:47:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 14:47:35] [INFO ] Implicit Places using invariants and state equation in 3769 ms returned []
Implicit Place search using SMT with State Equation took 5666 ms to find 0 implicit places.
[2024-05-29 14:47:35] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-29 14:47:35] [INFO ] Invariant cache hit.
[2024-05-29 14:47:37] [INFO ] Dead Transitions using invariants and state equation in 1534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7329 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Built C files in :
/tmp/ltsmin2997539909072890518
[2024-05-29 14:47:37] [INFO ] Too many transitions (2098) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:47:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2997539909072890518
Running compilation step : cd /tmp/ltsmin2997539909072890518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2997539909072890518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2997539909072890518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:47:40] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:47:40] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:47:40] [INFO ] Time to serialize gal into /tmp/LTL1448562231924946392.gal : 8 ms
[2024-05-29 14:47:40] [INFO ] Time to serialize properties into /tmp/LTL9992374206511799680.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1448562231924946392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7742311593055250272.hoa' '-atoms' '/tmp/LTL9992374206511799680.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p2340!=1)"))||(G("((p3362==1)&&(p3472==1))")))))
Formula 0 simplified : G(F!"(p2340!=1)" & F!"((p3362==1)&&(p3472==1))")
Detected timeout of ITS tools.
[2024-05-29 14:48:10] [INFO ] Flatten gal took : 52 ms
[2024-05-29 14:48:10] [INFO ] Applying decomposition
[2024-05-29 14:48:10] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16196259167435554184.txt' '-o' '/tmp/graph16196259167435554184.bin' '-w' '/tmp/graph16196259167435554184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16196259167435554184.bin' '-l' '-1' '-v' '-w' '/tmp/graph16196259167435554184.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:48:11] [INFO ] Decomposing Gal with order
[2024-05-29 14:48:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:48:11] [INFO ] Removed a total of 606 redundant transitions.
[2024-05-29 14:48:11] [INFO ] Flatten gal took : 81 ms
[2024-05-29 14:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 28 ms.
[2024-05-29 14:48:11] [INFO ] Time to serialize gal into /tmp/LTL7943868784924225537.gal : 112 ms
[2024-05-29 14:48:11] [INFO ] Time to serialize properties into /tmp/LTL855880671434152873.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7943868784924225537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL855880671434152873.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(i13.i0.i0.u234.p2340!=1)"))||(G("((i19.i1.i2.u344.p3362==1)&&(i20.i0.i1.u354.p3472==1))")))))
Formula 0 simplified : G(F!"(i13.i0.i0.u234.p2340!=1)" & F!"((i19.i1.i2.u344.p3362==1)&&(i20.i0.i1.u354.p3472==1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1603, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i1.u10.t...2556
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1780390148359453122
[2024-05-29 14:48:26] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1780390148359453122
Running compilation step : cd /tmp/ltsmin1780390148359453122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1780390148359453122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1780390148359453122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-14 finished in 138262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(G((p1||X(X(p2)))))&&p0))) U G(p3)))'
Support contains 6 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 6703 transition count 6003
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 6703 transition count 6003
Applied a total of 18 rules in 2118 ms. Remains 6703 /6712 variables (removed 9) and now considering 6003/6012 (removed 9) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2024-05-29 14:48:31] [INFO ] Computed 1101 invariants in 27 ms
[2024-05-29 14:48:34] [INFO ] Implicit Places using invariants in 2582 ms returned []
[2024-05-29 14:48:34] [INFO ] Invariant cache hit.
[2024-05-29 14:48:36] [INFO ] Implicit Places using invariants and state equation in 2531 ms returned []
Implicit Place search using SMT with State Equation took 5113 ms to find 0 implicit places.
[2024-05-29 14:48:36] [INFO ] Invariant cache hit.
[2024-05-29 14:48:41] [INFO ] Dead Transitions using invariants and state equation in 4843 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6712 places, 6003/6012 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12076 ms. Remains : 6703/6712 places, 6003/6012 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}]], initial=0, aps=[p3:(NEQ s1012 1), p0:(AND (EQ s1439 1) (EQ s1464 1)), p1:(EQ s1349 1), p2:(AND (EQ s2569 1) (EQ s2571 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 33163 reset in 3570 ms.
Product exploration explored 100000 steps with 33364 reset in 3609 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/6703 stabilizing places and 1599/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p3)), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 176 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 14 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 686 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 14:48:50] [INFO ] Invariant cache hit.
[2024-05-29 14:48:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 715 ms returned sat
[2024-05-29 14:49:00] [INFO ] After 6737ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:10
[2024-05-29 14:49:03] [INFO ] Deduced a trap composed of 18 places in 2772 ms of which 4 ms to minimize.
[2024-05-29 14:49:06] [INFO ] Deduced a trap composed of 16 places in 2616 ms of which 4 ms to minimize.
[2024-05-29 14:49:09] [INFO ] Deduced a trap composed of 32 places in 2768 ms of which 4 ms to minimize.
[2024-05-29 14:49:12] [INFO ] Deduced a trap composed of 17 places in 2622 ms of which 3 ms to minimize.
[2024-05-29 14:49:15] [INFO ] Deduced a trap composed of 33 places in 2573 ms of which 3 ms to minimize.
[2024-05-29 14:49:17] [INFO ] Deduced a trap composed of 21 places in 2565 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:49:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:49:17] [INFO ] After 27082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1373 ms.
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6703 transition count 4605
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5305 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5304 transition count 4604
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2798 place count 5304 transition count 3806
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 5 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 3 with 3400 rules applied. Total rules applied 7794 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7795 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7797 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7999 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8201 place count 2603 transition count 2104
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8393 place count 2507 transition count 2104
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8394 place count 2507 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8395 place count 2506 transition count 2103
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 5 with 298 rules applied. Total rules applied 8693 place count 2506 transition count 2103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8694 place count 2505 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8695 place count 2504 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8695 place count 2504 transition count 2100
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8699 place count 2502 transition count 2100
Applied a total of 8699 rules in 1727 ms. Remains 2502 /6703 variables (removed 4201) and now considering 2100/6003 (removed 3903) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1727 ms. Remains : 2502/6703 places, 2100/6003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 51917 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51917 steps, saw 43096 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2100 rows 2502 cols
[2024-05-29 14:49:24] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:49:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 232 ms returned sat
[2024-05-29 14:49:27] [INFO ] After 1495ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2024-05-29 14:49:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 14:49:27] [INFO ] After 309ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:49:27] [INFO ] After 3118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:49:28] [INFO ] [Nat]Absence check using 1100 positive place invariants in 230 ms returned sat
[2024-05-29 14:49:31] [INFO ] After 2241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:49:32] [INFO ] After 1107ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 14:49:32] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2024-05-29 14:49:33] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2024-05-29 14:49:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2024-05-29 14:49:35] [INFO ] After 3549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1106 ms.
[2024-05-29 14:49:36] [INFO ] After 8548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 691 ms.
Support contains 6 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2100/2100 transitions.
Applied a total of 0 rules in 84 ms. Remains 2502 /2502 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2502/2502 places, 2100/2100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2100/2100 transitions.
Applied a total of 0 rules in 83 ms. Remains 2502 /2502 variables (removed 0) and now considering 2100/2100 (removed 0) transitions.
[2024-05-29 14:49:36] [INFO ] Invariant cache hit.
[2024-05-29 14:49:38] [INFO ] Implicit Places using invariants in 1983 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1986 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2502 places, 2100/2100 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2498 transition count 2098
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2498 transition count 2098
Applied a total of 4 rules in 172 ms. Remains 2498 /2500 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2498 cols
[2024-05-29 14:49:39] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:49:41] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2024-05-29 14:49:41] [INFO ] Invariant cache hit.
[2024-05-29 14:49:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:49:45] [INFO ] Implicit Places using invariants and state equation in 3909 ms returned []
Implicit Place search using SMT with State Equation took 5941 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2498/2502 places, 2098/2100 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8182 ms. Remains : 2498/2502 places, 2098/2100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 62596 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62596 steps, saw 51675 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 15 properties.
[2024-05-29 14:49:48] [INFO ] Invariant cache hit.
[2024-05-29 14:49:49] [INFO ] [Real]Absence check using 1098 positive place invariants in 219 ms returned sat
[2024-05-29 14:49:51] [INFO ] After 1421ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:10
[2024-05-29 14:49:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:49:51] [INFO ] After 393ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:49:51] [INFO ] After 3102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:49:52] [INFO ] [Nat]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:49:55] [INFO ] After 2156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:49:56] [INFO ] After 1083ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 14:49:56] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:49:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2024-05-29 14:49:57] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:49:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-05-29 14:49:58] [INFO ] After 3446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2024-05-29 14:49:59] [INFO ] After 8258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 762 ms.
Support contains 6 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2098/2098 transitions.
Applied a total of 0 rules in 85 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2498/2498 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2098/2098 transitions.
Applied a total of 0 rules in 84 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2024-05-29 14:50:00] [INFO ] Invariant cache hit.
[2024-05-29 14:50:02] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2024-05-29 14:50:02] [INFO ] Invariant cache hit.
[2024-05-29 14:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:50:06] [INFO ] Implicit Places using invariants and state equation in 3871 ms returned []
Implicit Place search using SMT with State Equation took 5761 ms to find 0 implicit places.
[2024-05-29 14:50:06] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:50:06] [INFO ] Invariant cache hit.
[2024-05-29 14:50:08] [INFO ] Dead Transitions using invariants and state equation in 1614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7503 ms. Remains : 2498/2498 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 590 place count 2498 transition count 2098
Applied a total of 590 rules in 199 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 2098 rows 2498 cols
[2024-05-29 14:50:08] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:50:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 219 ms returned sat
[2024-05-29 14:50:11] [INFO ] After 1475ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2024-05-29 14:50:11] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-05-29 14:50:11] [INFO ] After 519ms SMT Verify possible using 587 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:50:11] [INFO ] After 3233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:50:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:50:15] [INFO ] After 2156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:50:17] [INFO ] After 1911ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 14:50:18] [INFO ] Deduced a trap composed of 5 places in 674 ms of which 1 ms to minimize.
[2024-05-29 14:50:18] [INFO ] Deduced a trap composed of 6 places in 665 ms of which 1 ms to minimize.
[2024-05-29 14:50:19] [INFO ] Deduced a trap composed of 5 places in 660 ms of which 2 ms to minimize.
[2024-05-29 14:50:20] [INFO ] Deduced a trap composed of 5 places in 662 ms of which 2 ms to minimize.
[2024-05-29 14:50:21] [INFO ] Deduced a trap composed of 5 places in 666 ms of which 1 ms to minimize.
[2024-05-29 14:50:22] [INFO ] Deduced a trap composed of 7 places in 663 ms of which 1 ms to minimize.
[2024-05-29 14:50:22] [INFO ] Deduced a trap composed of 7 places in 673 ms of which 2 ms to minimize.
[2024-05-29 14:50:23] [INFO ] Deduced a trap composed of 5 places in 664 ms of which 1 ms to minimize.
[2024-05-29 14:50:24] [INFO ] Deduced a trap composed of 5 places in 647 ms of which 1 ms to minimize.
[2024-05-29 14:50:25] [INFO ] Deduced a trap composed of 5 places in 693 ms of which 2 ms to minimize.
[2024-05-29 14:50:25] [INFO ] Deduced a trap composed of 11 places in 656 ms of which 1 ms to minimize.
[2024-05-29 14:50:26] [INFO ] Deduced a trap composed of 9 places in 653 ms of which 2 ms to minimize.
[2024-05-29 14:50:27] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 1 ms to minimize.
[2024-05-29 14:50:28] [INFO ] Deduced a trap composed of 8 places in 650 ms of which 1 ms to minimize.
[2024-05-29 14:50:28] [INFO ] Deduced a trap composed of 5 places in 657 ms of which 1 ms to minimize.
[2024-05-29 14:50:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 11532 ms
[2024-05-29 14:50:30] [INFO ] Deduced a trap composed of 9 places in 668 ms of which 2 ms to minimize.
[2024-05-29 14:50:31] [INFO ] Deduced a trap composed of 8 places in 638 ms of which 1 ms to minimize.
[2024-05-29 14:50:32] [INFO ] Deduced a trap composed of 5 places in 661 ms of which 1 ms to minimize.
[2024-05-29 14:50:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2361 ms
[2024-05-29 14:50:33] [INFO ] Deduced a trap composed of 5 places in 658 ms of which 2 ms to minimize.
[2024-05-29 14:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 833 ms
[2024-05-29 14:50:34] [INFO ] After 18913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1657 ms.
[2024-05-29 14:50:36] [INFO ] After 24265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p3)), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 232 ms. Reduced automaton from 14 states, 40 edges and 4 AP (stutter insensitive) to 14 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 599 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 586 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Support contains 6 out of 6703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6703/6703 places, 6003/6003 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3805
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4394 place count 4505 transition count 3805
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7790 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7791 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7793 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7995 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8197 place count 2604 transition count 2105
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8389 place count 2508 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8391 place count 2506 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8392 place count 2505 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8392 place count 2505 transition count 2101
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8396 place count 2503 transition count 2101
Applied a total of 8396 rules in 1493 ms. Remains 2503 /6703 variables (removed 4200) and now considering 2101/6003 (removed 3902) transitions.
// Phase 1: matrix 2101 rows 2503 cols
[2024-05-29 14:50:39] [INFO ] Computed 1100 invariants in 5 ms
[2024-05-29 14:50:40] [INFO ] Implicit Places using invariants in 1916 ms returned [2486, 2490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1918 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/6703 places, 2101/6003 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2499 transition count 2099
Applied a total of 4 rules in 163 ms. Remains 2499 /2501 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:50:41] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:50:42] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-29 14:50:42] [INFO ] Invariant cache hit.
[2024-05-29 14:50:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:50:46] [INFO ] Implicit Places using invariants and state equation in 3731 ms returned []
Implicit Place search using SMT with State Equation took 5578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2499/6703 places, 2099/6003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9153 ms. Remains : 2499/6703 places, 2099/6003 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2499 stabilizing places and 2/2099 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p3 (NOT p0))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p3 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2))))]
Knowledge based reduction with 23 factoid took 629 ms. Reduced automaton from 14 states, 40 edges and 4 AP (stutter insensitive) to 14 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 596 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 14:50:48] [INFO ] Invariant cache hit.
[2024-05-29 14:50:49] [INFO ] [Real]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:50:51] [INFO ] After 1440ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2024-05-29 14:50:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:50:51] [INFO ] After 302ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:50:51] [INFO ] After 2979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:50:52] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:50:55] [INFO ] After 2128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:50:56] [INFO ] After 1074ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 14:50:58] [INFO ] After 2922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1068 ms.
[2024-05-29 14:50:59] [INFO ] After 7666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 805 ms.
Support contains 6 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2499 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2498 transition count 2098
Applied a total of 2 rules in 163 ms. Remains 2498 /2499 variables (removed 1) and now considering 2098/2099 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 2498/2499 places, 2098/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 65993 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65993 steps, saw 49202 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2098 rows 2498 cols
[2024-05-29 14:51:03] [INFO ] Computed 1098 invariants in 3 ms
[2024-05-29 14:51:04] [INFO ] [Real]Absence check using 1098 positive place invariants in 228 ms returned sat
[2024-05-29 14:51:06] [INFO ] After 1493ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:10
[2024-05-29 14:51:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:51:06] [INFO ] After 397ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:51:06] [INFO ] After 3172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:51:07] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2024-05-29 14:51:10] [INFO ] After 2119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:51:11] [INFO ] After 1094ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-29 14:51:13] [INFO ] After 2929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2024-05-29 14:51:14] [INFO ] After 7621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 640 ms.
Support contains 6 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2098/2098 transitions.
Applied a total of 0 rules in 84 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2498/2498 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2098/2098 transitions.
Applied a total of 0 rules in 82 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2024-05-29 14:51:15] [INFO ] Invariant cache hit.
[2024-05-29 14:51:17] [INFO ] Implicit Places using invariants in 1897 ms returned []
[2024-05-29 14:51:17] [INFO ] Invariant cache hit.
[2024-05-29 14:51:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:51:20] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 5645 ms to find 0 implicit places.
[2024-05-29 14:51:21] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:51:21] [INFO ] Invariant cache hit.
[2024-05-29 14:51:22] [INFO ] Dead Transitions using invariants and state equation in 1611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7384 ms. Remains : 2498/2498 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 590 place count 2498 transition count 2098
Applied a total of 590 rules in 198 ms. Remains 2498 /2498 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 2098 rows 2498 cols
[2024-05-29 14:51:22] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:51:23] [INFO ] [Real]Absence check using 1098 positive place invariants in 194 ms returned sat
[2024-05-29 14:51:25] [INFO ] After 1414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2024-05-29 14:51:25] [INFO ] After 1542ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:51:25] [INFO ] After 2729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-29 14:51:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:51:29] [INFO ] After 2190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-29 14:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:51:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-29 14:51:31] [INFO ] After 4179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1092 ms.
[2024-05-29 14:51:32] [INFO ] After 6818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p3 (NOT p0))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p3 (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR p1 p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (F (OR p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 23 factoid took 768 ms. Reduced automaton from 14 states, 40 edges and 4 AP (stutter insensitive) to 14 states, 40 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 621 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 597 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 600 ms :[(NOT p3), (AND (NOT p0) p3), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 1366 ms.
Product exploration explored 100000 steps with 0 reset in 1826 ms.
Built C files in :
/tmp/ltsmin14231963740116335275
[2024-05-29 14:51:38] [INFO ] Too many transitions (2099) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:51:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14231963740116335275
Running compilation step : cd /tmp/ltsmin14231963740116335275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14231963740116335275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14231963740116335275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 85 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:51:41] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:51:43] [INFO ] Implicit Places using invariants in 1749 ms returned []
[2024-05-29 14:51:43] [INFO ] Invariant cache hit.
[2024-05-29 14:51:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:51:46] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 5356 ms to find 0 implicit places.
[2024-05-29 14:51:46] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:51:46] [INFO ] Invariant cache hit.
[2024-05-29 14:51:48] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6931 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Built C files in :
/tmp/ltsmin16604358365600648674
[2024-05-29 14:51:48] [INFO ] Too many transitions (2099) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:51:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16604358365600648674
Running compilation step : cd /tmp/ltsmin16604358365600648674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16604358365600648674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16604358365600648674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:51:51] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:51:51] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:51:51] [INFO ] Time to serialize gal into /tmp/LTL588234108384558719.gal : 9 ms
[2024-05-29 14:51:51] [INFO ] Time to serialize properties into /tmp/LTL17506367648154797740.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL588234108384558719.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14716612852350098037.hoa' '-atoms' '/tmp/LTL17506367648154797740.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17506367648154797740.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14716612852350098037.hoa
Detected timeout of ITS tools.
[2024-05-29 14:52:06] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:52:06] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:52:06] [INFO ] Time to serialize gal into /tmp/LTL5610829913933927649.gal : 8 ms
[2024-05-29 14:52:07] [INFO ] Time to serialize properties into /tmp/LTL1868915299477409792.ltl : 408 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5610829913933927649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1868915299477409792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(F(("((p1657==1)&&(p1684==1))")&&(F(G(("(p1553==1)")||(X(X("((p2974==1)&&(p2976==1))")))))))))U(G("(p1160!=1)"))))
Formula 0 simplified : X(GF(!"(p1553==1)" & XX!"((p2974==1)&&(p2976==1))") | G!"((p1657==1)&&(p1684==1))") R F!"(p1160!=1)"
Detected timeout of ITS tools.
[2024-05-29 14:52:22] [INFO ] Flatten gal took : 53 ms
[2024-05-29 14:52:22] [INFO ] Applying decomposition
[2024-05-29 14:52:22] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16428693315808530589.txt' '-o' '/tmp/graph16428693315808530589.bin' '-w' '/tmp/graph16428693315808530589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16428693315808530589.bin' '-l' '-1' '-v' '-w' '/tmp/graph16428693315808530589.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:52:22] [INFO ] Decomposing Gal with order
[2024-05-29 14:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:52:22] [INFO ] Removed a total of 612 redundant transitions.
[2024-05-29 14:52:22] [INFO ] Flatten gal took : 82 ms
[2024-05-29 14:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 18 ms.
[2024-05-29 14:52:23] [INFO ] Time to serialize gal into /tmp/LTL15268863391516462168.gal : 1005 ms
[2024-05-29 14:52:23] [INFO ] Time to serialize properties into /tmp/LTL12321127264839002447.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15268863391516462168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12321127264839002447.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(F(("((i8.i1.i0.u165.p1657==1)&&(i8.i1.i1.u171.p1684==1))")&&(F(G(("(i7.i1.i2.u153.p1553==1)")||(X(X("((i15.i2.i0.u304.p2974==1)&...226
Formula 0 simplified : X(GF(!"(i7.i1.i2.u153.p1553==1)" & XX!"((i15.i2.i0.u304.p2974==1)&&(i15.i2.i2.u305.p2976==1))") | G!"((i8.i1.i0.u165.p1657==1)&&(i8....209
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i1.u1.t1607, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...1268
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7999713381609292702
[2024-05-29 14:52:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7999713381609292702
Running compilation step : cd /tmp/ltsmin7999713381609292702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7999713381609292702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7999713381609292702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-15 finished in 252168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1)))||G(p2))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100B-LTLFireability-00
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6711 transition count 4610
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5310 transition count 4610
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2802 place count 5310 transition count 3817
Deduced a syphon composed of 793 places in 12 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 4388 place count 4517 transition count 3817
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4395 place count 4510 transition count 3810
Iterating global reduction 2 with 7 rules applied. Total rules applied 4402 place count 4510 transition count 3810
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4402 place count 4510 transition count 3804
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4414 place count 4504 transition count 3804
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7810 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7813 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8015 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8217 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8411 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8413 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8414 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8414 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8418 place count 2501 transition count 2100
Applied a total of 8418 rules in 2051 ms. Remains 2501 /6712 variables (removed 4211) and now considering 2100/6012 (removed 3912) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2024-05-29 14:52:43] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:52:45] [INFO ] Implicit Places using invariants in 1836 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1840 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/6712 places, 2100/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 190 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:52:46] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:52:47] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2024-05-29 14:52:47] [INFO ] Invariant cache hit.
[2024-05-29 14:52:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:52:51] [INFO ] Implicit Places using invariants and state equation in 3837 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2497/6712 places, 2098/6012 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 9823 ms. Remains : 2497/6712 places, 2098/6012 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(EQ s1102 1), p0:(EQ s2303 0), p1:(EQ s1741 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1590 ms.
Product exploration explored 100000 steps with 0 reset in 1964 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:52:56] [INFO ] Invariant cache hit.
[2024-05-29 14:52:56] [INFO ] [Real]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:52:57] [INFO ] After 1683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:52:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:52:59] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:52:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:52:59] [INFO ] After 143ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:52:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-29 14:53:00] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-29 14:53:00] [INFO ] After 2459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 97 ms.
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Applied a total of 2 rules in 176 ms. Remains 2496 /2497 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 2496/2497 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 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 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 77425 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77425 steps, saw 54786 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:53:04] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:53:04] [INFO ] [Real]Absence check using 1098 positive place invariants in 187 ms returned sat
[2024-05-29 14:53:05] [INFO ] After 1643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:53:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 218 ms returned sat
[2024-05-29 14:53:07] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:07] [INFO ] After 150ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:53:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2024-05-29 14:53:08] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-29 14:53:08] [INFO ] After 2566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 70 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:53:08] [INFO ] Invariant cache hit.
[2024-05-29 14:53:10] [INFO ] Implicit Places using invariants in 1930 ms returned []
[2024-05-29 14:53:10] [INFO ] Invariant cache hit.
[2024-05-29 14:53:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:14] [INFO ] Implicit Places using invariants and state equation in 3850 ms returned []
Implicit Place search using SMT with State Equation took 5782 ms to find 0 implicit places.
[2024-05-29 14:53:14] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:53:14] [INFO ] Invariant cache hit.
[2024-05-29 14:53:15] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7474 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 216 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:53:16] [INFO ] Computed 1098 invariants in 4 ms
[2024-05-29 14:53:16] [INFO ] [Real]Absence check using 1098 positive place invariants in 219 ms returned sat
[2024-05-29 14:53:17] [INFO ] After 1737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:53:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:53:19] [INFO ] After 1250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:19] [INFO ] After 1497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2024-05-29 14:53:20] [INFO ] After 2286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 2497 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 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 90 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2024-05-29 14:53:20] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:53:22] [INFO ] Implicit Places using invariants in 1900 ms returned []
[2024-05-29 14:53:22] [INFO ] Invariant cache hit.
[2024-05-29 14:53:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:26] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 5830 ms to find 0 implicit places.
[2024-05-29 14:53:26] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:53:26] [INFO ] Invariant cache hit.
[2024-05-29 14:53:28] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7532 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 2606 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:53:31] [INFO ] Invariant cache hit.
[2024-05-29 14:53:31] [INFO ] [Real]Absence check using 1098 positive place invariants in 222 ms returned sat
[2024-05-29 14:53:32] [INFO ] After 1728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:53:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 199 ms returned sat
[2024-05-29 14:53:34] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:34] [INFO ] After 142ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-05-29 14:53:35] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-29 14:53:35] [INFO ] After 2363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Applied a total of 2 rules in 159 ms. Remains 2496 /2497 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 2496/2497 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 88495 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88495 steps, saw 62118 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:53:38] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:53:39] [INFO ] [Real]Absence check using 1098 positive place invariants in 219 ms returned sat
[2024-05-29 14:53:40] [INFO ] After 1738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:53:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:53:42] [INFO ] After 1197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:42] [INFO ] After 142ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:53:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:53:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2024-05-29 14:53:43] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 140 ms.
[2024-05-29 14:53:43] [INFO ] After 2529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:53:43] [INFO ] Invariant cache hit.
[2024-05-29 14:53:45] [INFO ] Implicit Places using invariants in 1901 ms returned []
[2024-05-29 14:53:45] [INFO ] Invariant cache hit.
[2024-05-29 14:53:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:53:49] [INFO ] Implicit Places using invariants and state equation in 4175 ms returned []
Implicit Place search using SMT with State Equation took 6078 ms to find 0 implicit places.
[2024-05-29 14:53:49] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-29 14:53:49] [INFO ] Invariant cache hit.
[2024-05-29 14:53:51] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7966 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2496 transition count 2097
Applied a total of 596 rules in 204 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:53:51] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:53:52] [INFO ] [Real]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:53:53] [INFO ] After 1730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:53:53] [INFO ] [Nat]Absence check using 1098 positive place invariants in 231 ms returned sat
[2024-05-29 14:53:55] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:53:55] [INFO ] After 1532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-29 14:53:55] [INFO ] After 2341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 3444 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1387 ms.
Product exploration explored 100000 steps with 0 reset in 1852 ms.
Built C files in :
/tmp/ltsmin8090846005777321460
[2024-05-29 14:54:02] [INFO ] Too many transitions (2098) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:54:02] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8090846005777321460
Running compilation step : cd /tmp/ltsmin8090846005777321460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8090846005777321460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8090846005777321460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2496 transition count 2097
Applied a total of 2 rules in 171 ms. Remains 2496 /2497 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:54:05] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:54:07] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-29 14:54:07] [INFO ] Invariant cache hit.
[2024-05-29 14:54:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:54:11] [INFO ] Implicit Places using invariants and state equation in 3973 ms returned []
Implicit Place search using SMT with State Equation took 5861 ms to find 0 implicit places.
[2024-05-29 14:54:11] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-29 14:54:11] [INFO ] Invariant cache hit.
[2024-05-29 14:54:13] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2496/2497 places, 2097/2098 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7735 ms. Remains : 2496/2497 places, 2097/2098 transitions.
Built C files in :
/tmp/ltsmin15297845093741161224
[2024-05-29 14:54:13] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:54:13] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15297845093741161224
Running compilation step : cd /tmp/ltsmin15297845093741161224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15297845093741161224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15297845093741161224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:54:16] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:54:16] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:54:16] [INFO ] Time to serialize gal into /tmp/LTL4587225817088551149.gal : 8 ms
[2024-05-29 14:54:16] [INFO ] Time to serialize properties into /tmp/LTL10393942799185595550.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4587225817088551149.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7235453958845329119.hoa' '-atoms' '/tmp/LTL10393942799185595550.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10393942799185595550.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7235453958845329119.hoa
Detected timeout of ITS tools.
[2024-05-29 14:54:31] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:54:31] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:54:31] [INFO ] Time to serialize gal into /tmp/LTL4638691653460949827.gal : 8 ms
[2024-05-29 14:54:35] [INFO ] Time to serialize properties into /tmp/LTL17733354782446254501.ltl : 4015 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4638691653460949827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17733354782446254501.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(p7175==0)"))||(G("(p5443==1)"))))||(G("(p3488==1)")))))
Formula 0 simplified : X(G(F!"(p7175==0)" & F!"(p5443==1)") & F!"(p3488==1)")
Detected timeout of ITS tools.
[2024-05-29 14:54:50] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:54:50] [INFO ] Applying decomposition
[2024-05-29 14:54:50] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7580237810207501591.txt' '-o' '/tmp/graph7580237810207501591.bin' '-w' '/tmp/graph7580237810207501591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7580237810207501591.bin' '-l' '-1' '-v' '-w' '/tmp/graph7580237810207501591.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:54:51] [INFO ] Decomposing Gal with order
[2024-05-29 14:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:54:51] [INFO ] Removed a total of 608 redundant transitions.
[2024-05-29 14:54:51] [INFO ] Flatten gal took : 90 ms
[2024-05-29 14:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 17 ms.
[2024-05-29 14:54:51] [INFO ] Time to serialize gal into /tmp/LTL9407674027853745013.gal : 86 ms
[2024-05-29 14:54:51] [INFO ] Time to serialize properties into /tmp/LTL13013616334005204978.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9407674027853745013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13013616334005204978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(i41.i0.i1.u738.p7175==0)"))||(G("(i31.i0.i1.u559.p5443==1)"))))||(G("(i19.i1.i2.u353.p3488==1)")))))
Formula 0 simplified : X(G(F!"(i41.i0.i1.u738.p7175==0)" & F!"(i31.i0.i1.u559.p5443==1)") & F!"(i19.i1.i2.u353.p3488==1)")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1606, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...5673
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18325054957201411968
[2024-05-29 14:55:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18325054957201411968
Running compilation step : cd /tmp/ltsmin18325054957201411968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18325054957201411968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18325054957201411968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-00 finished in 147712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F((p1 U (p2||G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6712 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6712/6712 places, 6012/6012 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1402 transitions
Trivial Post-agglo rules discarded 1402 transitions
Performed 1402 trivial Post agglomeration. Transition count delta: 1402
Iterating post reduction 0 with 1402 rules applied. Total rules applied 1402 place count 6711 transition count 4609
Reduce places removed 1402 places and 0 transitions.
Iterating post reduction 1 with 1402 rules applied. Total rules applied 2804 place count 5309 transition count 4609
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2804 place count 5309 transition count 3816
Deduced a syphon composed of 793 places in 12 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 4390 place count 4516 transition count 3816
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 4397 place count 4509 transition count 3809
Iterating global reduction 2 with 7 rules applied. Total rules applied 4404 place count 4509 transition count 3809
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4404 place count 4509 transition count 3803
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 4416 place count 4503 transition count 3803
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7816 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7817 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7819 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8021 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8223 place count 2600 transition count 2101
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8417 place count 2503 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8419 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8420 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8420 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8424 place count 2498 transition count 2097
Applied a total of 8424 rules in 1945 ms. Remains 2498 /6712 variables (removed 4214) and now considering 2097/6012 (removed 3915) transitions.
// Phase 1: matrix 2097 rows 2498 cols
[2024-05-29 14:55:11] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:55:13] [INFO ] Implicit Places using invariants in 1922 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1924 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2496/6712 places, 2097/6012 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 169 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:55:13] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:55:15] [INFO ] Implicit Places using invariants in 1884 ms returned []
[2024-05-29 14:55:15] [INFO ] Invariant cache hit.
[2024-05-29 14:55:19] [INFO ] Implicit Places using invariants and state equation in 3857 ms returned []
Implicit Place search using SMT with State Equation took 5743 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2494/6712 places, 2095/6012 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 9781 ms. Remains : 2494/6712 places, 2095/6012 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1347 ms.
Product exploration explored 100000 steps with 0 reset in 1810 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96860 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96860 steps, saw 74026 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:55:26] [INFO ] Invariant cache hit.
[2024-05-29 14:55:26] [INFO ] [Real]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:55:27] [INFO ] After 1692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:55:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:55:29] [INFO ] After 1113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:55:29] [INFO ] After 1241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 14:55:29] [INFO ] After 1859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 81 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96623 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96623 steps, saw 73914 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:55:33] [INFO ] Invariant cache hit.
[2024-05-29 14:55:33] [INFO ] [Real]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:55:34] [INFO ] After 1697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:55:35] [INFO ] [Nat]Absence check using 1098 positive place invariants in 219 ms returned sat
[2024-05-29 14:55:36] [INFO ] After 1117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:55:36] [INFO ] After 1243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:55:36] [INFO ] After 1862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 90 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 81 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:55:36] [INFO ] Invariant cache hit.
[2024-05-29 14:55:38] [INFO ] Implicit Places using invariants in 1857 ms returned []
[2024-05-29 14:55:38] [INFO ] Invariant cache hit.
[2024-05-29 14:55:42] [INFO ] Implicit Places using invariants and state equation in 3834 ms returned []
Implicit Place search using SMT with State Equation took 5691 ms to find 0 implicit places.
[2024-05-29 14:55:42] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:55:42] [INFO ] Invariant cache hit.
[2024-05-29 14:55:44] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7393 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 223 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:55:44] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:55:44] [INFO ] [Real]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:55:46] [INFO ] After 1714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:55:46] [INFO ] [Nat]Absence check using 1098 positive place invariants in 220 ms returned sat
[2024-05-29 14:55:47] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:55:47] [INFO ] After 1299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:55:48] [INFO ] After 1931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 77 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:55:48] [INFO ] Computed 1098 invariants in 8 ms
[2024-05-29 14:55:50] [INFO ] Implicit Places using invariants in 1883 ms returned []
[2024-05-29 14:55:50] [INFO ] Invariant cache hit.
[2024-05-29 14:55:54] [INFO ] Implicit Places using invariants and state equation in 3763 ms returned []
Implicit Place search using SMT with State Equation took 5648 ms to find 0 implicit places.
[2024-05-29 14:55:54] [INFO ] Invariant cache hit.
[2024-05-29 14:55:55] [INFO ] Dead Transitions using invariants and state equation in 1612 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7339 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 95753 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95753 steps, saw 73227 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:55:59] [INFO ] Invariant cache hit.
[2024-05-29 14:55:59] [INFO ] [Real]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:56:00] [INFO ] After 1703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:56:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 227 ms returned sat
[2024-05-29 14:56:02] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:56:02] [INFO ] After 1257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 14:56:02] [INFO ] After 1891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93503 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93503 steps, saw 71432 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:56:06] [INFO ] Invariant cache hit.
[2024-05-29 14:56:06] [INFO ] [Real]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:56:07] [INFO ] After 1670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:56:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:56:09] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:56:09] [INFO ] After 1282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-29 14:56:09] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 83 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 90 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:56:09] [INFO ] Invariant cache hit.
[2024-05-29 14:56:11] [INFO ] Implicit Places using invariants in 1974 ms returned []
[2024-05-29 14:56:11] [INFO ] Invariant cache hit.
[2024-05-29 14:56:15] [INFO ] Implicit Places using invariants and state equation in 3937 ms returned []
Implicit Place search using SMT with State Equation took 5911 ms to find 0 implicit places.
[2024-05-29 14:56:15] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-29 14:56:15] [INFO ] Invariant cache hit.
[2024-05-29 14:56:17] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7635 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2494 transition count 2095
Applied a total of 596 rules in 199 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:56:17] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:56:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:56:19] [INFO ] After 1721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:56:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:56:21] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:56:21] [INFO ] After 1299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 14:56:21] [INFO ] After 1895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 2182 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1367 ms.
Product exploration explored 100000 steps with 0 reset in 1918 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 88 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:56:27] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2095 rows 2494 cols
[2024-05-29 14:56:27] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:56:29] [INFO ] Dead Transitions using invariants and state equation in 1623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1761 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Built C files in :
/tmp/ltsmin15977695047386761102
[2024-05-29 14:56:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15977695047386761102
Running compilation step : cd /tmp/ltsmin15977695047386761102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15977695047386761102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15977695047386761102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 2095/2095 transitions.
Applied a total of 0 rules in 79 ms. Remains 2494 /2494 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2024-05-29 14:56:32] [INFO ] Invariant cache hit.
[2024-05-29 14:56:34] [INFO ] Implicit Places using invariants in 1830 ms returned []
[2024-05-29 14:56:34] [INFO ] Invariant cache hit.
[2024-05-29 14:56:37] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 5614 ms to find 0 implicit places.
[2024-05-29 14:56:37] [INFO ] Invariant cache hit.
[2024-05-29 14:56:39] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7280 ms. Remains : 2494/2494 places, 2095/2095 transitions.
Built C files in :
/tmp/ltsmin8964261290922614006
[2024-05-29 14:56:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8964261290922614006
Running compilation step : cd /tmp/ltsmin8964261290922614006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8964261290922614006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8964261290922614006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:56:43] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:56:43] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:56:43] [INFO ] Time to serialize gal into /tmp/LTL9025332218286669607.gal : 9 ms
[2024-05-29 14:56:43] [INFO ] Time to serialize properties into /tmp/LTL11327942671516965952.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9025332218286669607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7122753864993332545.hoa' '-atoms' '/tmp/LTL11327942671516965952.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11327942671516965952.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7122753864993332545.hoa
Detected timeout of ITS tools.
[2024-05-29 14:56:58] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:56:58] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:56:58] [INFO ] Time to serialize gal into /tmp/LTL4281344129646265857.gal : 8 ms
[2024-05-29 14:56:58] [INFO ] Time to serialize properties into /tmp/LTL12840303154157613100.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4281344129646265857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12840303154157613100.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p403!=1)")))))
Formula 0 simplified : XXF!"(p403!=1)"
Detected timeout of ITS tools.
[2024-05-29 14:57:13] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:57:13] [INFO ] Applying decomposition
[2024-05-29 14:57:13] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1210250341108608990.txt' '-o' '/tmp/graph1210250341108608990.bin' '-w' '/tmp/graph1210250341108608990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1210250341108608990.bin' '-l' '-1' '-v' '-w' '/tmp/graph1210250341108608990.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:57:13] [INFO ] Decomposing Gal with order
[2024-05-29 14:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:57:14] [INFO ] Removed a total of 605 redundant transitions.
[2024-05-29 14:57:14] [INFO ] Flatten gal took : 80 ms
[2024-05-29 14:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 12 ms.
[2024-05-29 14:57:14] [INFO ] Time to serialize gal into /tmp/LTL13123044104451487733.gal : 790 ms
[2024-05-29 14:57:14] [INFO ] Time to serialize properties into /tmp/LTL9290091866668158797.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13123044104451487733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9290091866668158797.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i1.i1.i2.u33.p403!=1)")))))
Formula 0 simplified : XXF!"(i1.i1.i2.u33.p403!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18334980846651579158
[2024-05-29 14:57:29] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18334980846651579158
Running compilation step : cd /tmp/ltsmin18334980846651579158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18334980846651579158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18334980846651579158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLFireability-03 finished in 143482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))&&F(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((F(G((p1||X(X(p2)))))&&p0))) U G(p3)))'
[2024-05-29 14:57:33] [INFO ] Flatten gal took : 125 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10060045938720835470
[2024-05-29 14:57:33] [INFO ] Too many transitions (6012) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:57:33] [INFO ] Applying decomposition
[2024-05-29 14:57:33] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10060045938720835470
Running compilation step : cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:57:33] [INFO ] Flatten gal took : 172 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7871270616282969910.txt' '-o' '/tmp/graph7871270616282969910.bin' '-w' '/tmp/graph7871270616282969910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7871270616282969910.bin' '-l' '-1' '-v' '-w' '/tmp/graph7871270616282969910.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:57:34] [INFO ] Decomposing Gal with order
[2024-05-29 14:57:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:57:36] [INFO ] Removed a total of 985 redundant transitions.
[2024-05-29 14:57:36] [INFO ] Flatten gal took : 212 ms
[2024-05-29 14:57:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 14:57:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13110703024637868064.gal : 33 ms
[2024-05-29 14:57:36] [INFO ] Time to serialize properties into /tmp/LTLFireability14579260169299861288.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13110703024637868064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14579260169299861288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 7 LTL properties
Checking formula 0 : !((X((F((G("(i68.u2213.p7175==0)"))||(G("(i52.u1681.p5443==1)"))))||(G("(i34.u1078.p3488==1)")))))
Formula 0 simplified : X(G(F!"(i68.u2213.p7175==0)" & F!"(i52.u1681.p5443==1)") & F!"(i34.u1078.p3488==1)")
Compilation finished in 24752 ms.
Running link step : cd /tmp/ltsmin10060045938720835470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp3==true)||[](<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp3==true)||[](<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10060045938720835470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp6==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136124 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13491608 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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