About the Execution of 2023-gold for ShieldIIPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14351.136 | 3600000.00 | 9539870.00 | 6810.30 | ?FFF?FF?TFF????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788500108.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 ShieldIIPs-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-171683788500108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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.7M 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 ShieldIIPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716949010331
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=ShieldIIPs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 02:16:52] [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 02:16:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:16:52] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-29 02:16:52] [INFO ] Transformed 6003 places.
[2024-05-29 02:16:52] [INFO ] Transformed 5903 transitions.
[2024-05-29 02:16:52] [INFO ] Found NUPN structural information;
[2024-05-29 02:16:52] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 584 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 688 places :
Symmetric choice reduction at 0 with 688 rule applications. Total rules 688 place count 5315 transition count 5215
Iterating global reduction 0 with 688 rules applied. Total rules applied 1376 place count 5315 transition count 5215
Applied a total of 1376 rules in 1395 ms. Remains 5315 /6003 variables (removed 688) and now considering 5215/5903 (removed 688) transitions.
// Phase 1: matrix 5215 rows 5315 cols
[2024-05-29 02:16:54] [INFO ] Computed 901 invariants in 68 ms
[2024-05-29 02:16:56] [INFO ] Implicit Places using invariants in 2258 ms returned []
[2024-05-29 02:16:56] [INFO ] Invariant cache hit.
[2024-05-29 02:16:58] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2024-05-29 02:16:58] [INFO ] Invariant cache hit.
[2024-05-29 02:17:02] [INFO ] Dead Transitions using invariants and state equation in 3941 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5315/6003 places, 5215/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9602 ms. Remains : 5315/6003 places, 5215/5903 transitions.
Support contains 47 out of 5315 places after structural reductions.
[2024-05-29 02:17:03] [INFO ] Flatten gal took : 329 ms
[2024-05-29 02:17:03] [INFO ] Flatten gal took : 186 ms
[2024-05-29 02:17:04] [INFO ] Input system was already deterministic with 5215 transitions.
Support contains 46 out of 5315 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-29 02:17:04] [INFO ] Invariant cache hit.
[2024-05-29 02:17:07] [INFO ] After 2031ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:19
[2024-05-29 02:17:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 635 ms returned sat
[2024-05-29 02:17:18] [INFO ] After 7242ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2024-05-29 02:17:20] [INFO ] Deduced a trap composed of 26 places in 1942 ms of which 13 ms to minimize.
[2024-05-29 02:17:22] [INFO ] Deduced a trap composed of 18 places in 1882 ms of which 4 ms to minimize.
[2024-05-29 02:17:24] [INFO ] Deduced a trap composed of 17 places in 1865 ms of which 4 ms to minimize.
[2024-05-29 02:17:26] [INFO ] Deduced a trap composed of 23 places in 1861 ms of which 5 ms to minimize.
[2024-05-29 02:17:28] [INFO ] Deduced a trap composed of 29 places in 1884 ms of which 8 ms to minimize.
[2024-05-29 02:17:30] [INFO ] Deduced a trap composed of 15 places in 1987 ms of which 3 ms to minimize.
[2024-05-29 02:17:32] [INFO ] Deduced a trap composed of 21 places in 1773 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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 02:17:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:17:32] [INFO ] After 25821ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:19
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 4780 ms.
Support contains 32 out of 5315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Drop transitions removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 495 rules applied. Total rules applied 495 place count 5315 transition count 4720
Reduce places removed 495 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 496 rules applied. Total rules applied 991 place count 4820 transition count 4719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 992 place count 4819 transition count 4719
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 992 place count 4819 transition count 4219
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 1992 place count 4319 transition count 4219
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1998 place count 4313 transition count 4213
Iterating global reduction 3 with 6 rules applied. Total rules applied 2004 place count 4313 transition count 4213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2004 place count 4313 transition count 4210
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2010 place count 4310 transition count 4210
Performed 1790 Post agglomeration using F-continuation condition.Transition count delta: 1790
Deduced a syphon composed of 1790 places in 16 ms
Reduce places removed 1790 places and 0 transitions.
Iterating global reduction 3 with 3580 rules applied. Total rules applied 5590 place count 2520 transition count 2420
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 686 times.
Drop transitions removed 686 transitions
Iterating global reduction 3 with 686 rules applied. Total rules applied 6276 place count 2520 transition count 2420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6277 place count 2519 transition count 2419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6278 place count 2518 transition count 2419
Applied a total of 6278 rules in 1993 ms. Remains 2518 /5315 variables (removed 2797) and now considering 2419/5215 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1994 ms. Remains : 2518/5315 places, 2419/5215 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2419 rows 2518 cols
[2024-05-29 02:17:41] [INFO ] Computed 900 invariants in 82 ms
[2024-05-29 02:17:42] [INFO ] [Real]Absence check using 891 positive place invariants in 190 ms returned sat
[2024-05-29 02:17:42] [INFO ] [Real]Absence check using 891 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-29 02:17:42] [INFO ] After 1054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 02:17:43] [INFO ] [Nat]Absence check using 891 positive place invariants in 186 ms returned sat
[2024-05-29 02:17:43] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-29 02:17:46] [INFO ] After 2486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 02:17:46] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-29 02:17:47] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 02:17:47] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:17:47] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:17:47] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:17:47] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:17:48] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:17:48] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:17:48] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2024-05-29 02:17:48] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:17:49] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:17:50] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:17:51] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4890 ms
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-29 02:17:52] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:17:53] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 4 ms to minimize.
[2024-05-29 02:17:53] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:17:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 818 ms
[2024-05-29 02:17:53] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:17:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1094 ms
[2024-05-29 02:17:54] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-29 02:17:55] [INFO ] After 11185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1037 ms.
[2024-05-29 02:17:56] [INFO ] After 13553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1022 ms.
Support contains 25 out of 2518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2518/2518 places, 2419/2419 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2518 transition count 2417
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2516 transition count 2417
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 2512 transition count 2413
Applied a total of 12 rules in 185 ms. Remains 2512 /2518 variables (removed 6) and now considering 2413/2419 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 2512/2518 places, 2413/2419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 141337 steps, run timeout after 6002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 141337 steps, saw 139374 distinct states, run finished after 6003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2413 rows 2512 cols
[2024-05-29 02:18:05] [INFO ] Computed 900 invariants in 60 ms
[2024-05-29 02:18:06] [INFO ] [Real]Absence check using 891 positive place invariants in 177 ms returned sat
[2024-05-29 02:18:06] [INFO ] [Real]Absence check using 891 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-29 02:18:08] [INFO ] After 2460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 02:18:09] [INFO ] [Nat]Absence check using 891 positive place invariants in 176 ms returned sat
[2024-05-29 02:18:09] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-29 02:18:11] [INFO ] After 2215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 02:18:12] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 2 ms to minimize.
[2024-05-29 02:18:12] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2024-05-29 02:18:12] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2024-05-29 02:18:13] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 0 ms to minimize.
[2024-05-29 02:18:13] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 0 ms to minimize.
[2024-05-29 02:18:13] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-29 02:18:14] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 1 ms to minimize.
[2024-05-29 02:18:14] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 1 ms to minimize.
[2024-05-29 02:18:14] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 1 ms to minimize.
[2024-05-29 02:18:15] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 1 ms to minimize.
[2024-05-29 02:18:15] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 1 ms to minimize.
[2024-05-29 02:18:16] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 11 ms to minimize.
[2024-05-29 02:18:16] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-29 02:18:16] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 12 ms to minimize.
[2024-05-29 02:18:17] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2024-05-29 02:18:17] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2024-05-29 02:18:18] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2024-05-29 02:18:18] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2024-05-29 02:18:18] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2024-05-29 02:18:19] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 1 ms to minimize.
[2024-05-29 02:18:19] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2024-05-29 02:18:19] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 3 ms to minimize.
[2024-05-29 02:18:20] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 2 ms to minimize.
[2024-05-29 02:18:20] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2024-05-29 02:18:20] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 1 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 5 ms to minimize.
[2024-05-29 02:18:21] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 0 ms to minimize.
[2024-05-29 02:18:22] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 1 ms to minimize.
[2024-05-29 02:18:23] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 1 ms to minimize.
[2024-05-29 02:18:23] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11455 ms
[2024-05-29 02:18:23] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2024-05-29 02:18:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1437 ms
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 1 ms to minimize.
[2024-05-29 02:18:25] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 0 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2024-05-29 02:18:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1837 ms
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 1 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 0 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 1 ms to minimize.
[2024-05-29 02:18:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1133 ms
[2024-05-29 02:18:28] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 0 ms to minimize.
[2024-05-29 02:18:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-05-29 02:18:28] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2024-05-29 02:18:29] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2024-05-29 02:18:29] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2024-05-29 02:18:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1111 ms
[2024-05-29 02:18:30] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 0 ms to minimize.
[2024-05-29 02:18:30] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 1 ms to minimize.
[2024-05-29 02:18:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 712 ms
[2024-05-29 02:18:30] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 1 ms to minimize.
[2024-05-29 02:18:31] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2024-05-29 02:18:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 674 ms
[2024-05-29 02:18:31] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2024-05-29 02:18:31] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-29 02:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2024-05-29 02:18:32] [INFO ] After 22596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 998 ms.
[2024-05-29 02:18:33] [INFO ] After 24919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 783 ms.
Support contains 25 out of 2512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2413/2413 transitions.
Applied a total of 0 rules in 90 ms. Remains 2512 /2512 variables (removed 0) and now considering 2413/2413 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2512/2512 places, 2413/2413 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2413/2413 transitions.
Applied a total of 0 rules in 85 ms. Remains 2512 /2512 variables (removed 0) and now considering 2413/2413 (removed 0) transitions.
[2024-05-29 02:18:34] [INFO ] Invariant cache hit.
[2024-05-29 02:18:36] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2024-05-29 02:18:36] [INFO ] Invariant cache hit.
[2024-05-29 02:18:40] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 6217 ms to find 0 implicit places.
[2024-05-29 02:18:40] [INFO ] Redundant transitions in 451 ms returned []
[2024-05-29 02:18:40] [INFO ] Invariant cache hit.
[2024-05-29 02:18:42] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8546 ms. Remains : 2512/2512 places, 2413/2413 transitions.
Applied a total of 0 rules in 83 ms. Remains 2512 /2512 variables (removed 0) and now considering 2413/2413 (removed 0) transitions.
Running SMT prover for 12 properties.
[2024-05-29 02:18:42] [INFO ] Invariant cache hit.
[2024-05-29 02:18:43] [INFO ] [Real]Absence check using 891 positive place invariants in 178 ms returned sat
[2024-05-29 02:18:43] [INFO ] [Real]Absence check using 891 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-29 02:18:43] [INFO ] After 1184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 02:18:44] [INFO ] [Nat]Absence check using 891 positive place invariants in 174 ms returned sat
[2024-05-29 02:18:44] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-29 02:18:47] [INFO ] After 2195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 02:18:47] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-29 02:18:47] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2024-05-29 02:18:48] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 02:18:48] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2024-05-29 02:18:48] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2024-05-29 02:18:49] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2024-05-29 02:18:49] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2024-05-29 02:18:49] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2024-05-29 02:18:49] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 1 ms to minimize.
[2024-05-29 02:18:50] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 0 ms to minimize.
[2024-05-29 02:18:50] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2024-05-29 02:18:50] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
[2024-05-29 02:18:51] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2024-05-29 02:18:51] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 0 ms to minimize.
[2024-05-29 02:18:51] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2024-05-29 02:18:52] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2024-05-29 02:18:52] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2024-05-29 02:18:52] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2024-05-29 02:18:53] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2024-05-29 02:18:53] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 0 ms to minimize.
[2024-05-29 02:18:53] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 1 ms to minimize.
[2024-05-29 02:18:53] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-29 02:18:54] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2024-05-29 02:18:54] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-05-29 02:18:54] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 02:18:54] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2024-05-29 02:18:54] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2024-05-29 02:18:55] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2024-05-29 02:18:55] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:18:55] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2024-05-29 02:18:55] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 1 ms to minimize.
[2024-05-29 02:18:55] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 8646 ms
[2024-05-29 02:18:56] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2024-05-29 02:18:56] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:18:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1379 ms
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:18:58] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2024-05-29 02:18:59] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-29 02:18:59] [INFO ] After 14401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 951 ms.
[2024-05-29 02:19:00] [INFO ] After 16669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 1204 stabilizing places and 1204 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' '!(F((p0&&X(p1))))'
Support contains 3 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5303 transition count 5203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5303 transition count 5203
Applied a total of 24 rules in 935 ms. Remains 5303 /5315 variables (removed 12) and now considering 5203/5215 (removed 12) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:19:01] [INFO ] Computed 901 invariants in 34 ms
[2024-05-29 02:19:04] [INFO ] Implicit Places using invariants in 2152 ms returned []
[2024-05-29 02:19:04] [INFO ] Invariant cache hit.
[2024-05-29 02:19:06] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 4247 ms to find 0 implicit places.
[2024-05-29 02:19:06] [INFO ] Invariant cache hit.
[2024-05-29 02:19:10] [INFO ] Dead Transitions using invariants and state equation in 4205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5315 places, 5203/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9394 ms. Remains : 5303/5315 places, 5203/5215 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 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3809 0) (EQ s3825 0)), p1:(EQ s4243 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 193 reset in 869 ms.
Product exploration explored 100000 steps with 193 reset in 800 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/5303 stabilizing places and 1200/5203 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) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:19:12] [INFO ] Invariant cache hit.
[2024-05-29 02:19:13] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:19:14] [INFO ] [Nat]Absence check using 901 positive place invariants in 558 ms returned sat
[2024-05-29 02:19:19] [INFO ] After 4301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:19:21] [INFO ] Deduced a trap composed of 35 places in 2051 ms of which 3 ms to minimize.
[2024-05-29 02:19:23] [INFO ] Deduced a trap composed of 31 places in 2075 ms of which 3 ms to minimize.
[2024-05-29 02:19:25] [INFO ] Deduced a trap composed of 18 places in 2027 ms of which 3 ms to minimize.
[2024-05-29 02:19:28] [INFO ] Deduced a trap composed of 21 places in 2064 ms of which 3 ms to minimize.
[2024-05-29 02:19:30] [INFO ] Deduced a trap composed of 14 places in 1997 ms of which 5 ms to minimize.
[2024-05-29 02:19:32] [INFO ] Deduced a trap composed of 11 places in 2054 ms of which 3 ms to minimize.
[2024-05-29 02:19:34] [INFO ] Deduced a trap composed of 18 places in 2158 ms of which 3 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 21 places in 2164 ms of which 4 ms to minimize.
[2024-05-29 02:19:39] [INFO ] Deduced a trap composed of 15 places in 2099 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 02:19:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:19:39] [INFO ] After 25841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 339 ms.
Support contains 3 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4803 transition count 4703
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4803 transition count 4203
Deduced a syphon composed of 500 places in 25 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4303 transition count 4203
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 13 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6294 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6295 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6296 place count 2503 transition count 2404
Applied a total of 6296 rules in 1093 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Finished random walk after 1722 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 02:19:41] [INFO ] Invariant cache hit.
[2024-05-29 02:19:50] [INFO ] [Real]Absence check using 901 positive place invariants in 4497 ms returned sat
[2024-05-29 02:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:19:56] [INFO ] [Real]Absence check using state equation in 5406 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 438 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
[2024-05-29 02:19:56] [INFO ] Invariant cache hit.
[2024-05-29 02:19:58] [INFO ] Implicit Places using invariants in 2137 ms returned []
[2024-05-29 02:19:58] [INFO ] Invariant cache hit.
[2024-05-29 02:20:01] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 4158 ms to find 0 implicit places.
[2024-05-29 02:20:01] [INFO ] Invariant cache hit.
[2024-05-29 02:20:04] [INFO ] Dead Transitions using invariants and state equation in 3989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8588 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/5303 stabilizing places and 1200/5203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:20:05] [INFO ] Invariant cache hit.
[2024-05-29 02:20:06] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:20:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 577 ms returned sat
[2024-05-29 02:20:12] [INFO ] After 4399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:20:14] [INFO ] Deduced a trap composed of 23 places in 2125 ms of which 4 ms to minimize.
[2024-05-29 02:20:16] [INFO ] Deduced a trap composed of 18 places in 2093 ms of which 3 ms to minimize.
[2024-05-29 02:20:19] [INFO ] Deduced a trap composed of 18 places in 2106 ms of which 3 ms to minimize.
[2024-05-29 02:20:21] [INFO ] Deduced a trap composed of 28 places in 2097 ms of which 3 ms to minimize.
[2024-05-29 02:20:23] [INFO ] Deduced a trap composed of 11 places in 2104 ms of which 3 ms to minimize.
[2024-05-29 02:20:25] [INFO ] Deduced a trap composed of 18 places in 2067 ms of which 3 ms to minimize.
[2024-05-29 02:20:28] [INFO ] Deduced a trap composed of 21 places in 2025 ms of which 3 ms to minimize.
[2024-05-29 02:20:30] [INFO ] Deduced a trap composed of 18 places in 2094 ms of which 4 ms to minimize.
[2024-05-29 02:20:32] [INFO ] Deduced a trap composed of 23 places in 2113 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 02:20:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:20:32] [INFO ] After 26190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 304 ms.
Support contains 3 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4803 transition count 4703
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4803 transition count 4203
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4303 transition count 4203
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 12 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6294 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6295 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6296 place count 2503 transition count 2404
Applied a total of 6296 rules in 1001 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1003 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Finished random walk after 1502 steps, including 0 resets, run visited all 2 properties in 41 ms. (steps per millisecond=36 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 02:20:34] [INFO ] Invariant cache hit.
[2024-05-29 02:20:44] [INFO ] [Real]Absence check using 901 positive place invariants in 4568 ms returned sat
[2024-05-29 02:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:20:49] [INFO ] [Real]Absence check using state equation in 5398 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 193 reset in 674 ms.
Product exploration explored 100000 steps with 198 reset in 749 ms.
Built C files in :
/tmp/ltsmin8029091954600716719
[2024-05-29 02:20:51] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8029091954600716719
Running compilation step : cd /tmp/ltsmin8029091954600716719;'/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/ltsmin8029091954600716719;'/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/ltsmin8029091954600716719;'/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 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 453 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
[2024-05-29 02:20:54] [INFO ] Invariant cache hit.
[2024-05-29 02:20:56] [INFO ] Implicit Places using invariants in 2066 ms returned []
[2024-05-29 02:20:56] [INFO ] Invariant cache hit.
[2024-05-29 02:20:58] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 4104 ms to find 0 implicit places.
[2024-05-29 02:20:58] [INFO ] Invariant cache hit.
[2024-05-29 02:21:02] [INFO ] Dead Transitions using invariants and state equation in 3991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8552 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin10371774418382466687
[2024-05-29 02:21:03] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10371774418382466687
Running compilation step : cd /tmp/ltsmin10371774418382466687;'/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/ltsmin10371774418382466687;'/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/ltsmin10371774418382466687;'/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 02:21:06] [INFO ] Flatten gal took : 166 ms
[2024-05-29 02:21:06] [INFO ] Flatten gal took : 156 ms
[2024-05-29 02:21:06] [INFO ] Time to serialize gal into /tmp/LTL552951998858758451.gal : 38 ms
[2024-05-29 02:21:06] [INFO ] Time to serialize properties into /tmp/LTL9420241053156011331.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/LTL552951998858758451.gal' '-t' 'CGAL' '-hoa' '/tmp/aut278186871972905487.hoa' '-atoms' '/tmp/LTL9420241053156011331.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...315
Loading property file /tmp/LTL9420241053156011331.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut278186871972905487.hoa
Detected timeout of ITS tools.
[2024-05-29 02:21:22] [INFO ] Flatten gal took : 153 ms
[2024-05-29 02:21:22] [INFO ] Flatten gal took : 151 ms
[2024-05-29 02:21:22] [INFO ] Time to serialize gal into /tmp/LTL5744607800155196089.gal : 25 ms
[2024-05-29 02:21:22] [INFO ] Time to serialize properties into /tmp/LTL13966405022321806797.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/LTL5744607800155196089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13966405022321806797.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((X("(p4798==1)"))&&("((p4306==0)||(p4323==0))"))))
Formula 0 simplified : G(!"((p4306==0)||(p4323==0))" | X!"(p4798==1)")
Detected timeout of ITS tools.
[2024-05-29 02:21:37] [INFO ] Flatten gal took : 127 ms
[2024-05-29 02:21:37] [INFO ] Applying decomposition
[2024-05-29 02:21:37] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5687542560813751819.txt' '-o' '/tmp/graph5687542560813751819.bin' '-w' '/tmp/graph5687542560813751819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5687542560813751819.bin' '-l' '-1' '-v' '-w' '/tmp/graph5687542560813751819.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:21:37] [INFO ] Decomposing Gal with order
[2024-05-29 02:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:21:39] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:21:39] [INFO ] Flatten gal took : 383 ms
[2024-05-29 02:21:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2024-05-29 02:21:39] [INFO ] Time to serialize gal into /tmp/LTL10683387020161349959.gal : 60 ms
[2024-05-29 02:21:39] [INFO ] Time to serialize properties into /tmp/LTL9815366241807333092.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/LTL10683387020161349959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9815366241807333092.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 : !((F((X("(i49.u1604.p4798==1)"))&&("((i44.i1.i3.u1440.p4306==0)||(i44.i1.i4.u1446.p4323==0))"))))
Formula 0 simplified : G(!"((i44.i1.i3.u1440.p4306==0)||(i44.i1.i4.u1446.p4323==0))" | X!"(i49.u1604.p4798==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11049291531042563476
[2024-05-29 02:21:55] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11049291531042563476
Running compilation step : cd /tmp/ltsmin11049291531042563476;'/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/ltsmin11049291531042563476;'/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/ltsmin11049291531042563476;'/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 ShieldIIPs-PT-100B-LTLFireability-00 finished in 177174 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(X(X(p0)))&&p1) U !p2)))'
Support contains 3 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5305 transition count 5205
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5305 transition count 5205
Applied a total of 20 rules in 991 ms. Remains 5305 /5315 variables (removed 10) and now considering 5205/5215 (removed 10) transitions.
// Phase 1: matrix 5205 rows 5305 cols
[2024-05-29 02:21:59] [INFO ] Computed 901 invariants in 46 ms
[2024-05-29 02:22:00] [INFO ] Implicit Places using invariants in 1894 ms returned []
[2024-05-29 02:22:00] [INFO ] Invariant cache hit.
[2024-05-29 02:22:02] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 3945 ms to find 0 implicit places.
[2024-05-29 02:22:02] [INFO ] Invariant cache hit.
[2024-05-29 02:22:07] [INFO ] Dead Transitions using invariants and state equation in 4049 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5305/5315 places, 5205/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8987 ms. Remains : 5305/5315 places, 5205/5215 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, p0, (NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s4242 1), p2:(AND (EQ s2223 1) (EQ s2638 1)), p1:(EQ s2223 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-01 finished in 9285 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 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5314 transition count 4714
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1000 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2002 place count 4313 transition count 4213
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2015 place count 4300 transition count 4200
Iterating global reduction 2 with 13 rules applied. Total rules applied 2028 place count 4300 transition count 4200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2028 place count 4300 transition count 4197
Deduced a syphon composed of 3 places in 32 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2034 place count 4297 transition count 4197
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 12 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5620 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2501 transition count 2402
Applied a total of 5623 rules in 1322 ms. Remains 2501 /5315 variables (removed 2814) and now considering 2402/5215 (removed 2813) transitions.
// Phase 1: matrix 2402 rows 2501 cols
[2024-05-29 02:22:08] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:22:10] [INFO ] Implicit Places using invariants in 1652 ms returned []
[2024-05-29 02:22:10] [INFO ] Invariant cache hit.
[2024-05-29 02:22:14] [INFO ] Implicit Places using invariants and state equation in 3790 ms returned []
Implicit Place search using SMT with State Equation took 5451 ms to find 0 implicit places.
[2024-05-29 02:22:14] [INFO ] Redundant transitions in 347 ms returned [2401]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:22:14] [INFO ] Computed 900 invariants in 5 ms
[2024-05-29 02:22:16] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/5315 places, 2401/5215 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8779 ms. Remains : 2501/5315 places, 2401/5215 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-04 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 s928 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 56 reset in 1731 ms.
Product exploration explored 100000 steps with 69 reset in 2097 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/2501 stabilizing places and 2/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 186 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 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 263 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:22:20] [INFO ] Invariant cache hit.
[2024-05-29 02:22:22] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2024-05-29 02:22:22] [INFO ] Invariant cache hit.
[2024-05-29 02:22:26] [INFO ] Implicit Places using invariants and state equation in 3571 ms returned []
Implicit Place search using SMT with State Equation took 5170 ms to find 0 implicit places.
[2024-05-29 02:22:26] [INFO ] Redundant transitions in 313 ms returned []
[2024-05-29 02:22:26] [INFO ] Invariant cache hit.
[2024-05-29 02:22:28] [INFO ] Dead Transitions using invariants and state equation in 1689 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7270 ms. Remains : 2501/2501 places, 2401/2401 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/2501 stabilizing places and 2/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 160 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 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 46 reset in 1662 ms.
Product exploration explored 100000 steps with 76 reset in 2101 ms.
Built C files in :
/tmp/ltsmin4986211713635962250
[2024-05-29 02:22:32] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:22:32] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4986211713635962250
Running compilation step : cd /tmp/ltsmin4986211713635962250;'/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/ltsmin4986211713635962250;'/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/ltsmin4986211713635962250;'/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 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 82 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-29 02:22:35] [INFO ] Invariant cache hit.
[2024-05-29 02:22:37] [INFO ] Implicit Places using invariants in 1776 ms returned []
[2024-05-29 02:22:37] [INFO ] Invariant cache hit.
[2024-05-29 02:22:41] [INFO ] Implicit Places using invariants and state equation in 3546 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
[2024-05-29 02:22:41] [INFO ] Redundant transitions in 316 ms returned []
[2024-05-29 02:22:41] [INFO ] Invariant cache hit.
[2024-05-29 02:22:43] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7645 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin6283938309515622839
[2024-05-29 02:22:43] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:22:43] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6283938309515622839
Running compilation step : cd /tmp/ltsmin6283938309515622839;'/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/ltsmin6283938309515622839;'/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/ltsmin6283938309515622839;'/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 02:22:46] [INFO ] Flatten gal took : 96 ms
[2024-05-29 02:22:46] [INFO ] Flatten gal took : 160 ms
[2024-05-29 02:22:46] [INFO ] Time to serialize gal into /tmp/LTL16647740105587945793.gal : 28 ms
[2024-05-29 02:22:46] [INFO ] Time to serialize properties into /tmp/LTL15596762098358130505.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/LTL16647740105587945793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4859089969278162079.hoa' '-atoms' '/tmp/LTL15596762098358130505.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/LTL15596762098358130505.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4859089969278162079.hoa
Detected timeout of ITS tools.
[2024-05-29 02:23:02] [INFO ] Flatten gal took : 75 ms
[2024-05-29 02:23:02] [INFO ] Flatten gal took : 76 ms
[2024-05-29 02:23:02] [INFO ] Time to serialize gal into /tmp/LTL17236385000474535329.gal : 12 ms
[2024-05-29 02:23:02] [INFO ] Time to serialize properties into /tmp/LTL1498310024146712055.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/LTL17236385000474535329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1498310024146712055.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 : !((G(F("(p2289!=1)"))))
Formula 0 simplified : FG!"(p2289!=1)"
Detected timeout of ITS tools.
[2024-05-29 02:23:17] [INFO ] Flatten gal took : 82 ms
[2024-05-29 02:23:17] [INFO ] Applying decomposition
[2024-05-29 02:23:17] [INFO ] Flatten gal took : 118 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/graph4546452445808952218.txt' '-o' '/tmp/graph4546452445808952218.bin' '-w' '/tmp/graph4546452445808952218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4546452445808952218.bin' '-l' '-1' '-v' '-w' '/tmp/graph4546452445808952218.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:23:17] [INFO ] Decomposing Gal with order
[2024-05-29 02:23:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:23:18] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:23:18] [INFO ] Flatten gal took : 167 ms
[2024-05-29 02:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1536 labels/synchronizations in 71 ms.
[2024-05-29 02:23:18] [INFO ] Time to serialize gal into /tmp/LTL1698906273721272320.gal : 23 ms
[2024-05-29 02:23:18] [INFO ] Time to serialize properties into /tmp/LTL10083376391682588403.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/LTL1698906273721272320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10083376391682588403.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("(i17.u334.p2289!=1)"))))
Formula 0 simplified : FG!"(i17.u334.p2289!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2138047615591664607
[2024-05-29 02:23:33] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2138047615591664607
Running compilation step : cd /tmp/ltsmin2138047615591664607;'/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/ltsmin2138047615591664607;'/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/ltsmin2138047615591664607;'/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 ShieldIIPs-PT-100B-LTLFireability-04 finished in 89197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4815 transition count 4214
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2013 place count 4301 transition count 4201
Iterating global reduction 2 with 13 rules applied. Total rules applied 2026 place count 4301 transition count 4201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2026 place count 4301 transition count 4198
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2032 place count 4298 transition count 4198
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2501 transition count 2402
Applied a total of 5623 rules in 1244 ms. Remains 2501 /5315 variables (removed 2814) and now considering 2402/5215 (removed 2813) transitions.
// Phase 1: matrix 2402 rows 2501 cols
[2024-05-29 02:23:37] [INFO ] Computed 900 invariants in 9 ms
[2024-05-29 02:23:39] [INFO ] Implicit Places using invariants in 1559 ms returned []
[2024-05-29 02:23:39] [INFO ] Invariant cache hit.
[2024-05-29 02:23:42] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2024-05-29 02:23:43] [INFO ] Redundant transitions in 314 ms returned [2401]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:23:43] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:23:45] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/5315 places, 2401/5215 transitions.
Applied a total of 0 rules in 101 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8562 ms. Remains : 2501/5315 places, 2401/5215 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s933 1) (EQ s949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5052 steps with 0 reset in 85 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-05 finished in 8743 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 U p1))))'
Support contains 2 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4815 transition count 4214
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4302 transition count 4202
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4302 transition count 4202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2024 place count 4302 transition count 4200
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2028 place count 4300 transition count 4200
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5616 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5618 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5619 place count 2503 transition count 2404
Applied a total of 5619 rules in 1249 ms. Remains 2503 /5315 variables (removed 2812) and now considering 2404/5215 (removed 2811) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:23:46] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 02:23:48] [INFO ] Implicit Places using invariants in 1585 ms returned []
[2024-05-29 02:23:48] [INFO ] Invariant cache hit.
[2024-05-29 02:23:51] [INFO ] Implicit Places using invariants and state equation in 3533 ms returned []
Implicit Place search using SMT with State Equation took 5124 ms to find 0 implicit places.
[2024-05-29 02:23:51] [INFO ] Redundant transitions in 320 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:23:51] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:23:53] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5315 places, 2403/5215 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8471 ms. Remains : 2503/5315 places, 2403/5215 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1570 1), p0:(EQ s678 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5185 steps with 0 reset in 114 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-06 finished in 8703 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)))||F(p1)))'
Support contains 4 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5304 transition count 5204
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5304 transition count 5204
Applied a total of 22 rules in 866 ms. Remains 5304 /5315 variables (removed 11) and now considering 5204/5215 (removed 11) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2024-05-29 02:23:54] [INFO ] Computed 901 invariants in 25 ms
[2024-05-29 02:23:56] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2024-05-29 02:23:56] [INFO ] Invariant cache hit.
[2024-05-29 02:23:58] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 4067 ms to find 0 implicit places.
[2024-05-29 02:23:58] [INFO ] Invariant cache hit.
[2024-05-29 02:24:02] [INFO ] Dead Transitions using invariants and state equation in 4076 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5315 places, 5204/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9016 ms. Remains : 5304/5315 places, 5204/5215 transitions.
Stuttering acceptance computed with spot in 165 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 : ShieldIIPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (AND (EQ s2531 0) (EQ s1279 1)) (EQ s1195 1)), p0:(EQ s3115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33 reset in 1062 ms.
Product exploration explored 100000 steps with 32 reset in 1310 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/5304 stabilizing places and 1200/5204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 6535 steps, including 1 resets, run visited all 1 properties in 82 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2024-05-29 02:24:06] [INFO ] Invariant cache hit.
[2024-05-29 02:24:15] [INFO ] [Real]Absence check using 901 positive place invariants in 3747 ms returned sat
[2024-05-29 02:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:24:21] [INFO ] [Real]Absence check using state equation in 6213 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 5304 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 : 5304/5304 places, 5204/5204 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 11 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5588 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5590 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5591 place count 2506 transition count 2407
Applied a total of 5591 rules in 888 ms. Remains 2506 /5304 variables (removed 2798) and now considering 2407/5204 (removed 2797) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:24:22] [INFO ] Computed 900 invariants in 14 ms
[2024-05-29 02:24:23] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2024-05-29 02:24:23] [INFO ] Invariant cache hit.
[2024-05-29 02:24:27] [INFO ] Implicit Places using invariants and state equation in 3517 ms returned []
Implicit Place search using SMT with State Equation took 5188 ms to find 0 implicit places.
[2024-05-29 02:24:27] [INFO ] Redundant transitions in 317 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2024-05-29 02:24:27] [INFO ] Computed 900 invariants in 5 ms
[2024-05-29 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/5304 places, 2406/5204 transitions.
Applied a total of 0 rules in 79 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8134 ms. Remains : 2506/5304 places, 2406/5204 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/2506 stabilizing places and 6/2406 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2024-05-29 02:24:29] [INFO ] Invariant cache hit.
[2024-05-29 02:24:34] [INFO ] [Real]Absence check using 900 positive place invariants in 1343 ms returned sat
[2024-05-29 02:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:24:44] [INFO ] [Real]Absence check using state equation in 10690 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 29114 reset in 2661 ms.
Product exploration explored 100000 steps with 29077 reset in 2732 ms.
Built C files in :
/tmp/ltsmin16371984256031622632
[2024-05-29 02:24:50] [INFO ] Too many transitions (2406) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:24:50] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16371984256031622632
Running compilation step : cd /tmp/ltsmin16371984256031622632;'/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/ltsmin16371984256031622632;'/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/ltsmin16371984256031622632;'/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 2506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2505 transition count 2405
Applied a total of 2 rules in 140 ms. Remains 2505 /2506 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
// Phase 1: matrix 2405 rows 2505 cols
[2024-05-29 02:24:53] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:24:55] [INFO ] Implicit Places using invariants in 1622 ms returned []
[2024-05-29 02:24:55] [INFO ] Invariant cache hit.
[2024-05-29 02:24:59] [INFO ] Implicit Places using invariants and state equation in 3831 ms returned []
Implicit Place search using SMT with State Equation took 5456 ms to find 0 implicit places.
[2024-05-29 02:24:59] [INFO ] Redundant transitions in 309 ms returned []
[2024-05-29 02:24:59] [INFO ] Invariant cache hit.
[2024-05-29 02:25:01] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2505/2506 places, 2405/2406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7582 ms. Remains : 2505/2506 places, 2405/2406 transitions.
Built C files in :
/tmp/ltsmin1433297668304357531
[2024-05-29 02:25:01] [INFO ] Too many transitions (2405) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:25:01] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1433297668304357531
Running compilation step : cd /tmp/ltsmin1433297668304357531;'/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/ltsmin1433297668304357531;'/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/ltsmin1433297668304357531;'/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 02:25:04] [INFO ] Flatten gal took : 75 ms
[2024-05-29 02:25:04] [INFO ] Flatten gal took : 90 ms
[2024-05-29 02:25:04] [INFO ] Time to serialize gal into /tmp/LTL4779540203325204488.gal : 16 ms
[2024-05-29 02:25:04] [INFO ] Time to serialize properties into /tmp/LTL4797045880640893294.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/LTL4779540203325204488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16641502475637208246.hoa' '-atoms' '/tmp/LTL4797045880640893294.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/LTL4797045880640893294.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16641502475637208246.hoa
Detected timeout of ITS tools.
[2024-05-29 02:25:19] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:25:19] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:25:19] [INFO ] Time to serialize gal into /tmp/LTL6768837064851448365.gal : 11 ms
[2024-05-29 02:25:19] [INFO ] Time to serialize properties into /tmp/LTL9615247732949770401.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/LTL6768837064851448365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9615247732949770401.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(X(G("(p3518==1)"))))||(F("(((p2855==0)&&(p1435==1))||(p1342==1))"))))
Formula 0 simplified : XXF!"(p3518==1)" & G!"(((p2855==0)&&(p1435==1))||(p1342==1))"
Detected timeout of ITS tools.
[2024-05-29 02:25:34] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:25:34] [INFO ] Applying decomposition
[2024-05-29 02:25:34] [INFO ] Flatten gal took : 74 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/graph7992542225673844860.txt' '-o' '/tmp/graph7992542225673844860.bin' '-w' '/tmp/graph7992542225673844860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7992542225673844860.bin' '-l' '-1' '-v' '-w' '/tmp/graph7992542225673844860.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:25:35] [INFO ] Decomposing Gal with order
[2024-05-29 02:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:25:35] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:25:35] [INFO ] Flatten gal took : 109 ms
[2024-05-29 02:25:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1542 labels/synchronizations in 50 ms.
[2024-05-29 02:25:35] [INFO ] Time to serialize gal into /tmp/LTL18064946741010785871.gal : 52 ms
[2024-05-29 02:25:35] [INFO ] Time to serialize properties into /tmp/LTL13157331182972913454.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/LTL18064946741010785871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13157331182972913454.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(X(G("(i26.i0.i1.u523.p3518==1)"))))||(F("(((i21.i0.i1.u422.p2855==0)&&(i10.u205.p1435==1))||(i9.u196.p1342==1))"))))
Formula 0 simplified : XXF!"(i26.i0.i1.u523.p3518==1)" & G!"(((i21.i0.i1.u422.p2855==0)&&(i10.u205.p1435==1))||(i9.u196.p1342==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin219941873118823713
[2024-05-29 02:25:50] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin219941873118823713
Running compilation step : cd /tmp/ltsmin219941873118823713;'/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/ltsmin219941873118823713;'/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/ltsmin219941873118823713;'/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 ShieldIIPs-PT-100B-LTLFireability-07 finished in 119604 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(p1)||p0))))'
Support contains 3 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5303 transition count 5203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5303 transition count 5203
Applied a total of 24 rules in 855 ms. Remains 5303 /5315 variables (removed 12) and now considering 5203/5215 (removed 12) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:25:54] [INFO ] Computed 901 invariants in 29 ms
[2024-05-29 02:25:56] [INFO ] Implicit Places using invariants in 1940 ms returned []
[2024-05-29 02:25:56] [INFO ] Invariant cache hit.
[2024-05-29 02:25:58] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 3972 ms to find 0 implicit places.
[2024-05-29 02:25:58] [INFO ] Invariant cache hit.
[2024-05-29 02:26:02] [INFO ] Dead Transitions using invariants and state equation in 3782 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5315 places, 5203/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8624 ms. Remains : 5303/5315 places, 5203/5215 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s1703 0), p0:(OR (EQ s366 0) (EQ s2992 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3149 ms.
Product exploration explored 100000 steps with 50000 reset in 3159 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-08 finished in 15257 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((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5303 transition count 5203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5303 transition count 5203
Applied a total of 24 rules in 850 ms. Remains 5303 /5315 variables (removed 12) and now considering 5203/5215 (removed 12) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:26:09] [INFO ] Computed 901 invariants in 22 ms
[2024-05-29 02:26:11] [INFO ] Implicit Places using invariants in 1974 ms returned []
[2024-05-29 02:26:11] [INFO ] Invariant cache hit.
[2024-05-29 02:26:13] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 3791 ms to find 0 implicit places.
[2024-05-29 02:26:13] [INFO ] Invariant cache hit.
[2024-05-29 02:26:17] [INFO ] Dead Transitions using invariants and state equation in 3733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5315 places, 5203/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8382 ms. Remains : 5303/5315 places, 5203/5215 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2768 1) (EQ s254 1)), p1:(AND (EQ s2199 1) (EQ s2201 1)), p2:(EQ s2768 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]]
Stuttering criterion allowed to conclude after 12484 steps with 0 reset in 202 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 8799 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((G(p2)&&p1))))))'
Support contains 6 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5302 transition count 5202
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5302 transition count 5202
Applied a total of 26 rules in 863 ms. Remains 5302 /5315 variables (removed 13) and now considering 5202/5215 (removed 13) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2024-05-29 02:26:18] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 02:26:20] [INFO ] Implicit Places using invariants in 2069 ms returned []
[2024-05-29 02:26:20] [INFO ] Invariant cache hit.
[2024-05-29 02:26:22] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 4115 ms to find 0 implicit places.
[2024-05-29 02:26:22] [INFO ] Invariant cache hit.
[2024-05-29 02:26:26] [INFO ] Dead Transitions using invariants and state equation in 4127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5315 places, 5202/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9117 ms. Remains : 5302/5315 places, 5202/5215 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s649 1) (EQ s693 1)) (AND (EQ s3639 0) (OR (EQ s2570 0) (EQ s2586 0) (EQ s2597 0)))), p1:(AND (EQ s2570 1) (EQ s2586 1) (EQ s2597 1)), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 9306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5314 transition count 4714
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4814 transition count 4714
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4814 transition count 4214
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2013 place count 4301 transition count 4201
Iterating global reduction 2 with 13 rules applied. Total rules applied 2026 place count 4301 transition count 4201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2026 place count 4301 transition count 4198
Deduced a syphon composed of 3 places in 19 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2032 place count 4298 transition count 4198
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 12 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5622 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5624 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5625 place count 2500 transition count 2401
Applied a total of 5625 rules in 1191 ms. Remains 2500 /5315 variables (removed 2815) and now considering 2401/5215 (removed 2814) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:26:28] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:26:29] [INFO ] Implicit Places using invariants in 1596 ms returned []
[2024-05-29 02:26:29] [INFO ] Invariant cache hit.
[2024-05-29 02:26:33] [INFO ] Implicit Places using invariants and state equation in 3475 ms returned []
Implicit Place search using SMT with State Equation took 5072 ms to find 0 implicit places.
[2024-05-29 02:26:33] [INFO ] Redundant transitions in 301 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:26:33] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:26:35] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5315 places, 2400/5215 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8416 ms. Remains : 2500/5315 places, 2400/5215 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1328 1) (EQ s1344 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 45 reset in 1575 ms.
Product exploration explored 100000 steps with 45 reset in 2036 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2190 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 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 75 ms :[(NOT p0), (NOT p0)]
[2024-05-29 02:26:39] [INFO ] Invariant cache hit.
[2024-05-29 02:26:43] [INFO ] [Real]Absence check using 900 positive place invariants in 965 ms returned sat
[2024-05-29 02:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:26:54] [INFO ] [Real]Absence check using state equation in 11421 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:26:54] [INFO ] Invariant cache hit.
[2024-05-29 02:26:56] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2024-05-29 02:26:56] [INFO ] Invariant cache hit.
[2024-05-29 02:27:00] [INFO ] Implicit Places using invariants and state equation in 3821 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2024-05-29 02:27:00] [INFO ] Redundant transitions in 311 ms returned []
[2024-05-29 02:27:00] [INFO ] Invariant cache hit.
[2024-05-29 02:27:02] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7665 ms. Remains : 2500/2500 places, 2400/2400 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2244 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-29 02:27:02] [INFO ] Invariant cache hit.
[2024-05-29 02:27:06] [INFO ] [Real]Absence check using 900 positive place invariants in 1020 ms returned sat
[2024-05-29 02:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:27:17] [INFO ] [Real]Absence check using state equation in 11187 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45 reset in 1523 ms.
Product exploration explored 100000 steps with 45 reset in 1970 ms.
Built C files in :
/tmp/ltsmin4910283343139139207
[2024-05-29 02:27:21] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:27:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4910283343139139207
Running compilation step : cd /tmp/ltsmin4910283343139139207;'/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/ltsmin4910283343139139207;'/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/ltsmin4910283343139139207;'/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 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:27:24] [INFO ] Invariant cache hit.
[2024-05-29 02:27:26] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2024-05-29 02:27:26] [INFO ] Invariant cache hit.
[2024-05-29 02:27:29] [INFO ] Implicit Places using invariants and state equation in 3705 ms returned []
Implicit Place search using SMT with State Equation took 5294 ms to find 0 implicit places.
[2024-05-29 02:27:30] [INFO ] Redundant transitions in 298 ms returned []
[2024-05-29 02:27:30] [INFO ] Invariant cache hit.
[2024-05-29 02:27:32] [INFO ] Dead Transitions using invariants and state equation in 1782 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7462 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin6951026920110522914
[2024-05-29 02:27:32] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:27:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6951026920110522914
Running compilation step : cd /tmp/ltsmin6951026920110522914;'/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/ltsmin6951026920110522914;'/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/ltsmin6951026920110522914;'/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 02:27:35] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:27:35] [INFO ] Flatten gal took : 87 ms
[2024-05-29 02:27:35] [INFO ] Time to serialize gal into /tmp/LTL546633054155795445.gal : 18 ms
[2024-05-29 02:27:35] [INFO ] Time to serialize properties into /tmp/LTL3568153271060613797.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/LTL546633054155795445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5719080739643272868.hoa' '-atoms' '/tmp/LTL3568153271060613797.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/LTL3568153271060613797.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5719080739643272868.hoa
Detected timeout of ITS tools.
[2024-05-29 02:27:50] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:27:50] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:27:50] [INFO ] Time to serialize gal into /tmp/LTL6457010857199296075.gal : 10 ms
[2024-05-29 02:27:50] [INFO ] Time to serialize properties into /tmp/LTL11997760136685015486.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/LTL6457010857199296075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11997760136685015486.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 : !((G(F("((p3240==1)&&(p3267==1))"))))
Formula 0 simplified : FG!"((p3240==1)&&(p3267==1))"
Detected timeout of ITS tools.
[2024-05-29 02:28:05] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:28:05] [INFO ] Applying decomposition
[2024-05-29 02:28:05] [INFO ] Flatten gal took : 84 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/graph3103972479555544887.txt' '-o' '/tmp/graph3103972479555544887.bin' '-w' '/tmp/graph3103972479555544887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3103972479555544887.bin' '-l' '-1' '-v' '-w' '/tmp/graph3103972479555544887.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:28:06] [INFO ] Decomposing Gal with order
[2024-05-29 02:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:28:06] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:28:06] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1552 labels/synchronizations in 26 ms.
[2024-05-29 02:28:06] [INFO ] Time to serialize gal into /tmp/LTL9818321439127286893.gal : 482 ms
[2024-05-29 02:28:06] [INFO ] Time to serialize properties into /tmp/LTL15853749891869629761.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/LTL9818321439127286893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15853749891869629761.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("((i24.i0.i0.u478.p3240==1)&&(i24.i0.i0.u484.p3267==1))"))))
Formula 0 simplified : FG!"((i24.i0.i0.u478.p3240==1)&&(i24.i0.i0.u484.p3267==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13405364365539530422
[2024-05-29 02:28:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13405364365539530422
Running compilation step : cd /tmp/ltsmin13405364365539530422;'/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/ltsmin13405364365539530422;'/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/ltsmin13405364365539530422;'/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 ShieldIIPs-PT-100B-LTLFireability-11 finished in 118027 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 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Support contains 2 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 998 place count 4815 transition count 4215
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1998 place count 4315 transition count 4215
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2011 place count 4302 transition count 4202
Iterating global reduction 2 with 13 rules applied. Total rules applied 2024 place count 4302 transition count 4202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2024 place count 4302 transition count 4199
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2030 place count 4299 transition count 4199
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 15 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5616 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5618 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5619 place count 2503 transition count 2404
Applied a total of 5619 rules in 1302 ms. Remains 2503 /5315 variables (removed 2812) and now considering 2404/5215 (removed 2811) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:28:26] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 02:28:27] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2024-05-29 02:28:27] [INFO ] Invariant cache hit.
[2024-05-29 02:28:31] [INFO ] Implicit Places using invariants and state equation in 3729 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2024-05-29 02:28:31] [INFO ] Redundant transitions in 311 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:28:32] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:28:33] [INFO ] Dead Transitions using invariants and state equation in 1725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5315 places, 2403/5215 transitions.
Applied a total of 0 rules in 86 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8821 ms. Remains : 2503/5315 places, 2403/5215 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2230 0), p1:(NEQ s2230 1), p0:(NEQ s349 1), p3:(EQ s349 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 503 reset in 1636 ms.
Product exploration explored 100000 steps with 286 reset in 2098 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 854 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 02:28:39] [INFO ] Invariant cache hit.
[2024-05-29 02:28:40] [INFO ] [Real]Absence check using 900 positive place invariants in 180 ms returned sat
[2024-05-29 02:28:40] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 02:28:41] [INFO ] [Nat]Absence check using 900 positive place invariants in 181 ms returned sat
[2024-05-29 02:28:41] [INFO ] After 587ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 15 factoid took 1209 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 95 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:28:42] [INFO ] Invariant cache hit.
[2024-05-29 02:28:44] [INFO ] Implicit Places using invariants in 1543 ms returned []
[2024-05-29 02:28:44] [INFO ] Invariant cache hit.
[2024-05-29 02:28:47] [INFO ] Implicit Places using invariants and state equation in 3668 ms returned []
Implicit Place search using SMT with State Equation took 5213 ms to find 0 implicit places.
[2024-05-29 02:28:48] [INFO ] Redundant transitions in 322 ms returned []
[2024-05-29 02:28:48] [INFO ] Invariant cache hit.
[2024-05-29 02:28:49] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7415 ms. Remains : 2503/2503 places, 2403/2403 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p3)]
Finished random walk after 3338 steps, including 1 resets, run visited all 3 properties in 58 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p3)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p3)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p3)]
Product exploration explored 100000 steps with 114 reset in 1674 ms.
Product exploration explored 100000 steps with 112 reset in 2093 ms.
Built C files in :
/tmp/ltsmin13361269239325819004
[2024-05-29 02:28:55] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:28:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13361269239325819004
Running compilation step : cd /tmp/ltsmin13361269239325819004;'/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/ltsmin13361269239325819004;'/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/ltsmin13361269239325819004;'/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 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:28:58] [INFO ] Invariant cache hit.
[2024-05-29 02:28:59] [INFO ] Implicit Places using invariants in 1666 ms returned []
[2024-05-29 02:28:59] [INFO ] Invariant cache hit.
[2024-05-29 02:29:03] [INFO ] Implicit Places using invariants and state equation in 3440 ms returned []
Implicit Place search using SMT with State Equation took 5108 ms to find 0 implicit places.
[2024-05-29 02:29:03] [INFO ] Redundant transitions in 315 ms returned []
[2024-05-29 02:29:03] [INFO ] Invariant cache hit.
[2024-05-29 02:29:05] [INFO ] Dead Transitions using invariants and state equation in 1780 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7291 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin619834329315481852
[2024-05-29 02:29:05] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:29:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin619834329315481852
Running compilation step : cd /tmp/ltsmin619834329315481852;'/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/ltsmin619834329315481852;'/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/ltsmin619834329315481852;'/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 02:29:08] [INFO ] Flatten gal took : 92 ms
[2024-05-29 02:29:08] [INFO ] Flatten gal took : 72 ms
[2024-05-29 02:29:08] [INFO ] Time to serialize gal into /tmp/LTL16464299156432799088.gal : 10 ms
[2024-05-29 02:29:08] [INFO ] Time to serialize properties into /tmp/LTL1672563555000996175.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/LTL16464299156432799088.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17899818336646777629.hoa' '-atoms' '/tmp/LTL1672563555000996175.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/LTL1672563555000996175.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17899818336646777629.hoa
Detected timeout of ITS tools.
[2024-05-29 02:29:23] [INFO ] Flatten gal took : 68 ms
[2024-05-29 02:29:24] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:29:24] [INFO ] Time to serialize gal into /tmp/LTL2107641431459240382.gal : 11 ms
[2024-05-29 02:29:24] [INFO ] Time to serialize properties into /tmp/LTL6807855217582663873.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/LTL2107641431459240382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6807855217582663873.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((("(p916!=1)")U((G("(p916!=1)"))||(("(p916!=1)")&&(G("(p5361!=1)")))))||((F("(p5361==0)"))&&(F("(p916==0)")))))))
Formula 0 simplified : FG((G!"(p5361==0)" | G!"(p916==0)") & (F!"(p5361!=1)" U !"(p916!=1)"))
Detected timeout of ITS tools.
[2024-05-29 02:29:39] [INFO ] Flatten gal took : 78 ms
[2024-05-29 02:29:39] [INFO ] Applying decomposition
[2024-05-29 02:29:39] [INFO ] Flatten gal took : 76 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/graph7707900038560432470.txt' '-o' '/tmp/graph7707900038560432470.bin' '-w' '/tmp/graph7707900038560432470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7707900038560432470.bin' '-l' '-1' '-v' '-w' '/tmp/graph7707900038560432470.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:29:39] [INFO ] Decomposing Gal with order
[2024-05-29 02:29:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:29:39] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:29:39] [INFO ] Flatten gal took : 126 ms
[2024-05-29 02:29:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1538 labels/synchronizations in 25 ms.
[2024-05-29 02:29:39] [INFO ] Time to serialize gal into /tmp/LTL13005060182736034861.gal : 24 ms
[2024-05-29 02:29:39] [INFO ] Time to serialize properties into /tmp/LTL14420808731359163929.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/LTL13005060182736034861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14420808731359163929.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((("(i5.i1.i1.u125.p916!=1)")U((G("(i5.i1.i1.u125.p916!=1)"))||(("(i5.i1.i1.u125.p916!=1)")&&(G("(i40.i0.i0.u803.p5361!=1)")))))...227
Formula 0 simplified : FG((G!"(i40.i0.i0.u803.p5361==0)" | G!"(i5.i1.i1.u125.p916==0)") & (F!"(i40.i0.i0.u803.p5361!=1)" U !"(i5.i1.i1.u125.p916!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9781900735763003851
[2024-05-29 02:29:55] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9781900735763003851
Running compilation step : cd /tmp/ltsmin9781900735763003851;'/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/ltsmin9781900735763003851;'/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/ltsmin9781900735763003851;'/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 ShieldIIPs-PT-100B-LTLFireability-12 finished in 93064 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(X(G(F(X(G((X(!p0) U p1)))))))))'
Support contains 4 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5303 transition count 5203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5303 transition count 5203
Applied a total of 24 rules in 914 ms. Remains 5303 /5315 variables (removed 12) and now considering 5203/5215 (removed 12) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:29:58] [INFO ] Computed 901 invariants in 23 ms
[2024-05-29 02:30:00] [INFO ] Implicit Places using invariants in 1898 ms returned []
[2024-05-29 02:30:00] [INFO ] Invariant cache hit.
[2024-05-29 02:30:02] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2024-05-29 02:30:02] [INFO ] Invariant cache hit.
[2024-05-29 02:30:06] [INFO ] Dead Transitions using invariants and state equation in 3770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5315 places, 5203/5215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8587 ms. Remains : 5303/5315 places, 5203/5215 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s3677 1), p0:(AND (EQ s2203 1) (EQ s2211 1) (EQ s2232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 11 reset in 1574 ms.
Product exploration explored 100000 steps with 12 reset in 1864 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 189593 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189593 steps, saw 186631 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:30:13] [INFO ] Invariant cache hit.
[2024-05-29 02:30:15] [INFO ] [Real]Absence check using 901 positive place invariants in 606 ms returned sat
[2024-05-29 02:30:20] [INFO ] After 4756ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 02:30:22] [INFO ] Deduced a trap composed of 23 places in 1799 ms of which 3 ms to minimize.
[2024-05-29 02:30:24] [INFO ] Deduced a trap composed of 15 places in 1827 ms of which 3 ms to minimize.
[2024-05-29 02:30:26] [INFO ] Deduced a trap composed of 14 places in 1856 ms of which 3 ms to minimize.
[2024-05-29 02:30:28] [INFO ] Deduced a trap composed of 19 places in 1881 ms of which 4 ms to minimize.
[2024-05-29 02:30:30] [INFO ] Deduced a trap composed of 23 places in 1859 ms of which 3 ms to minimize.
[2024-05-29 02:30:32] [INFO ] Deduced a trap composed of 24 places in 1760 ms of which 3 ms to minimize.
[2024-05-29 02:30:34] [INFO ] Deduced a trap composed of 27 places in 1742 ms of which 2 ms to minimize.
[2024-05-29 02:30:35] [INFO ] Deduced a trap composed of 23 places in 1731 ms of which 3 ms to minimize.
[2024-05-29 02:30:37] [INFO ] Deduced a trap composed of 20 places in 1720 ms of which 3 ms to minimize.
[2024-05-29 02:30:39] [INFO ] Deduced a trap composed of 20 places in 1772 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: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 02:30:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:30:39] [INFO ] After 26079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 150 ms.
Support contains 4 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4201
Deduced a syphon composed of 501 places in 26 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4301 transition count 4201
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 12 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 5602 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1032 ms. Remains 2500 /5303 variables (removed 2803) and now considering 2401/5203 (removed 2802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 2500/5303 places, 2401/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:30:41] [INFO ] Computed 900 invariants in 35 ms
[2024-05-29 02:30:41] [INFO ] [Real]Absence check using 897 positive place invariants in 186 ms returned sat
[2024-05-29 02:30:41] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:30:43] [INFO ] After 1880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:30:43] [INFO ] [Nat]Absence check using 897 positive place invariants in 186 ms returned sat
[2024-05-29 02:30:43] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:30:45] [INFO ] After 1420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:30:45] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 02:30:45] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-29 02:30:46] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2024-05-29 02:30:46] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2024-05-29 02:30:46] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:30:46] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2024-05-29 02:30:46] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2024-05-29 02:30:47] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:30:47] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:30:47] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-05-29 02:30:47] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 02:30:47] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:30:48] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:30:48] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2024-05-29 02:30:48] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2024-05-29 02:30:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3173 ms
[2024-05-29 02:30:48] [INFO ] After 4656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 02:30:48] [INFO ] After 5258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 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 2400
Applied a total of 2 rules in 141 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 2499/2500 places, 2400/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 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 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134699 steps, run timeout after 3013 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134699 steps, saw 133563 distinct states, run finished after 3014 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:30:52] [INFO ] Computed 900 invariants in 23 ms
[2024-05-29 02:30:52] [INFO ] [Real]Absence check using 897 positive place invariants in 178 ms returned sat
[2024-05-29 02:30:52] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:30:53] [INFO ] After 1802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:30:54] [INFO ] [Nat]Absence check using 897 positive place invariants in 175 ms returned sat
[2024-05-29 02:30:54] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:30:55] [INFO ] After 1295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:30:55] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2024-05-29 02:30:56] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2024-05-29 02:30:56] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:30:56] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:30:56] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-29 02:30:56] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:30:57] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:30:57] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 1 ms to minimize.
[2024-05-29 02:30:57] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:30:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1983 ms
[2024-05-29 02:30:57] [INFO ] After 3339ms 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 02:30:57] [INFO ] After 3911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:30:58] [INFO ] Invariant cache hit.
[2024-05-29 02:31:00] [INFO ] Implicit Places using invariants in 2145 ms returned []
[2024-05-29 02:31:00] [INFO ] Invariant cache hit.
[2024-05-29 02:31:04] [INFO ] Implicit Places using invariants and state equation in 4593 ms returned []
Implicit Place search using SMT with State Equation took 6739 ms to find 0 implicit places.
[2024-05-29 02:31:04] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-29 02:31:04] [INFO ] Invariant cache hit.
[2024-05-29 02:31:06] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8609 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 78 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:31:06] [INFO ] Invariant cache hit.
[2024-05-29 02:31:07] [INFO ] [Real]Absence check using 897 positive place invariants in 186 ms returned sat
[2024-05-29 02:31:07] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:31:08] [INFO ] After 1967ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:31:09] [INFO ] [Nat]Absence check using 897 positive place invariants in 181 ms returned sat
[2024-05-29 02:31:09] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:31:10] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:31:10] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 02:31:11] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:31:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2251 ms
[2024-05-29 02:31:12] [INFO ] After 3734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-29 02:31:12] [INFO ] After 4340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 453 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:31:13] [INFO ] Computed 901 invariants in 29 ms
[2024-05-29 02:31:15] [INFO ] Implicit Places using invariants in 2032 ms returned []
[2024-05-29 02:31:15] [INFO ] Invariant cache hit.
[2024-05-29 02:31:17] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 4138 ms to find 0 implicit places.
[2024-05-29 02:31:17] [INFO ] Invariant cache hit.
[2024-05-29 02:31:21] [INFO ] Dead Transitions using invariants and state equation in 4112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8705 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
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 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 170600 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170600 steps, saw 168043 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:31:25] [INFO ] Invariant cache hit.
[2024-05-29 02:31:27] [INFO ] [Real]Absence check using 901 positive place invariants in 602 ms returned sat
[2024-05-29 02:31:31] [INFO ] After 4768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-29 02:31:33] [INFO ] Deduced a trap composed of 23 places in 1788 ms of which 2 ms to minimize.
[2024-05-29 02:31:35] [INFO ] Deduced a trap composed of 15 places in 1826 ms of which 3 ms to minimize.
[2024-05-29 02:31:37] [INFO ] Deduced a trap composed of 14 places in 1829 ms of which 3 ms to minimize.
[2024-05-29 02:31:39] [INFO ] Deduced a trap composed of 19 places in 1802 ms of which 3 ms to minimize.
[2024-05-29 02:31:41] [INFO ] Deduced a trap composed of 23 places in 1780 ms of which 3 ms to minimize.
[2024-05-29 02:31:43] [INFO ] Deduced a trap composed of 24 places in 1793 ms of which 3 ms to minimize.
[2024-05-29 02:31:45] [INFO ] Deduced a trap composed of 27 places in 1839 ms of which 3 ms to minimize.
[2024-05-29 02:31:47] [INFO ] Deduced a trap composed of 23 places in 1828 ms of which 3 ms to minimize.
[2024-05-29 02:31:49] [INFO ] Deduced a trap composed of 20 places in 1762 ms of which 3 ms to minimize.
[2024-05-29 02:31:51] [INFO ] Deduced a trap composed of 20 places in 1749 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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: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 02:31:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:31:51] [INFO ] After 26179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 190 ms.
Support contains 4 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4201
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4301 transition count 4201
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 12 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 5602 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1006 ms. Remains 2500 /5303 variables (removed 2803) and now considering 2401/5203 (removed 2802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 2500/5303 places, 2401/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:31:53] [INFO ] Computed 900 invariants in 20 ms
[2024-05-29 02:31:53] [INFO ] [Real]Absence check using 897 positive place invariants in 173 ms returned sat
[2024-05-29 02:31:53] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-29 02:31:55] [INFO ] After 1689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:31:55] [INFO ] [Nat]Absence check using 897 positive place invariants in 174 ms returned sat
[2024-05-29 02:31:55] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-29 02:31:57] [INFO ] After 1343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:31:57] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 02:31:57] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-29 02:31:57] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2024-05-29 02:31:58] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2024-05-29 02:31:58] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2024-05-29 02:31:58] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2024-05-29 02:31:58] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2024-05-29 02:31:58] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:31:59] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2024-05-29 02:32:00] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-29 02:32:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3169 ms
[2024-05-29 02:32:00] [INFO ] After 4574ms 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 02:32:00] [INFO ] After 5179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 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 2400
Applied a total of 2 rules in 140 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 2499/2500 places, 2400/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 128664 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128664 steps, saw 127566 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:32:03] [INFO ] Computed 900 invariants in 26 ms
[2024-05-29 02:32:04] [INFO ] [Real]Absence check using 897 positive place invariants in 174 ms returned sat
[2024-05-29 02:32:04] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:32:05] [INFO ] After 1789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:32:06] [INFO ] [Nat]Absence check using 897 positive place invariants in 181 ms returned sat
[2024-05-29 02:32:06] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-29 02:32:07] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:32:07] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2024-05-29 02:32:07] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:32:08] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2024-05-29 02:32:08] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:32:08] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-05-29 02:32:08] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:32:08] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 02:32:09] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:32:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:32:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1865 ms
[2024-05-29 02:32:09] [INFO ] After 3236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 02:32:09] [INFO ] After 3825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 88 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 80 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:32:09] [INFO ] Invariant cache hit.
[2024-05-29 02:32:11] [INFO ] Implicit Places using invariants in 1971 ms returned []
[2024-05-29 02:32:11] [INFO ] Invariant cache hit.
[2024-05-29 02:32:16] [INFO ] Implicit Places using invariants and state equation in 4535 ms returned []
Implicit Place search using SMT with State Equation took 6522 ms to find 0 implicit places.
[2024-05-29 02:32:16] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-29 02:32:16] [INFO ] Invariant cache hit.
[2024-05-29 02:32:17] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8401 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:32:18] [INFO ] Invariant cache hit.
[2024-05-29 02:32:18] [INFO ] [Real]Absence check using 897 positive place invariants in 179 ms returned sat
[2024-05-29 02:32:18] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:32:19] [INFO ] After 1814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:32:20] [INFO ] [Nat]Absence check using 897 positive place invariants in 182 ms returned sat
[2024-05-29 02:32:20] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:32:21] [INFO ] After 1368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:32:21] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 02:32:22] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:32:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2052 ms
[2024-05-29 02:32:23] [INFO ] After 3479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 02:32:23] [INFO ] After 4069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11 reset in 1653 ms.
Product exploration explored 100000 steps with 12 reset in 1997 ms.
Built C files in :
/tmp/ltsmin10326472923963238730
[2024-05-29 02:32:28] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10326472923963238730
Running compilation step : cd /tmp/ltsmin10326472923963238730;'/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/ltsmin10326472923963238730;'/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/ltsmin10326472923963238730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 440 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:32:31] [INFO ] Computed 901 invariants in 27 ms
[2024-05-29 02:32:33] [INFO ] Implicit Places using invariants in 1987 ms returned []
[2024-05-29 02:32:33] [INFO ] Invariant cache hit.
[2024-05-29 02:32:35] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 3868 ms to find 0 implicit places.
[2024-05-29 02:32:35] [INFO ] Invariant cache hit.
[2024-05-29 02:32:39] [INFO ] Dead Transitions using invariants and state equation in 3785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8093 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin5308026536348099104
[2024-05-29 02:32:39] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5308026536348099104
Running compilation step : cd /tmp/ltsmin5308026536348099104;'/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/ltsmin5308026536348099104;'/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/ltsmin5308026536348099104;'/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 02:32:42] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:32:42] [INFO ] Flatten gal took : 125 ms
[2024-05-29 02:32:42] [INFO ] Time to serialize gal into /tmp/LTL6438250858247812840.gal : 21 ms
[2024-05-29 02:32:42] [INFO ] Time to serialize properties into /tmp/LTL593443794338055841.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/LTL6438250858247812840.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2849711324240568332.hoa' '-atoms' '/tmp/LTL593443794338055841.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/LTL593443794338055841.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2849711324240568332.hoa
Detected timeout of ITS tools.
[2024-05-29 02:32:58] [INFO ] Flatten gal took : 118 ms
[2024-05-29 02:32:58] [INFO ] Flatten gal took : 119 ms
[2024-05-29 02:32:58] [INFO ] Time to serialize gal into /tmp/LTL8630403312064701328.gal : 20 ms
[2024-05-29 02:32:58] [INFO ] Time to serialize properties into /tmp/LTL7075477438905713553.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/LTL8630403312064701328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7075477438905713553.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(X(G(F(X(G((X(!("(((p2483==1)&&(p2491==1))&&(p2518==1))")))U("(p4156!=1)"))))))))))
Formula 0 simplified : GF(!"(p4156!=1)" & X(!"(p4156!=1)" W "(((p2483==1)&&(p2491==1))&&(p2518==1))"))
Detected timeout of ITS tools.
[2024-05-29 02:33:13] [INFO ] Flatten gal took : 143 ms
[2024-05-29 02:33:13] [INFO ] Applying decomposition
[2024-05-29 02:33:13] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14413548693322521957.txt' '-o' '/tmp/graph14413548693322521957.bin' '-w' '/tmp/graph14413548693322521957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14413548693322521957.bin' '-l' '-1' '-v' '-w' '/tmp/graph14413548693322521957.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:33:13] [INFO ] Decomposing Gal with order
[2024-05-29 02:33:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:33:15] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:33:15] [INFO ] Flatten gal took : 221 ms
[2024-05-29 02:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-29 02:33:15] [INFO ] Time to serialize gal into /tmp/LTL17217717397761737954.gal : 90 ms
[2024-05-29 02:33:15] [INFO ] Time to serialize properties into /tmp/LTL6754098761008351561.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/LTL17217717397761737954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6754098761008351561.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(X(G(F(X(G((X(!("(((i25.i1.i4.u835.p2483==1)&&(i25.i1.i4.u838.p2491==1))&&(i25.i1.i4.u845.p2518==1))")))U("(i42.i0.i4.u1390.p415...171
Formula 0 simplified : GF(!"(i42.i0.i4.u1390.p4156!=1)" & X(!"(i42.i0.i4.u1390.p4156!=1)" W "(((i25.i1.i4.u835.p2483==1)&&(i25.i1.i4.u838.p2491==1))&&(i25....179
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14376850338971415906
[2024-05-29 02:33:30] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14376850338971415906
Running compilation step : cd /tmp/ltsmin14376850338971415906;'/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/ltsmin14376850338971415906;'/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/ltsmin14376850338971415906;'/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 ShieldIIPs-PT-100B-LTLFireability-13 finished in 215507 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)||(p0&&F(G(p1))))))'
Support contains 7 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4815 transition count 4214
Deduced a syphon composed of 501 places in 43 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 2013 place count 4301 transition count 4201
Iterating global reduction 2 with 13 rules applied. Total rules applied 2026 place count 4301 transition count 4201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2026 place count 4301 transition count 4198
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2032 place count 4298 transition count 4198
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 12 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5622 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5624 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5625 place count 2500 transition count 2401
Applied a total of 5625 rules in 1323 ms. Remains 2500 /5315 variables (removed 2815) and now considering 2401/5215 (removed 2814) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:33:34] [INFO ] Computed 900 invariants in 9 ms
[2024-05-29 02:33:36] [INFO ] Implicit Places using invariants in 1552 ms returned []
[2024-05-29 02:33:36] [INFO ] Invariant cache hit.
[2024-05-29 02:33:39] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 4923 ms to find 0 implicit places.
[2024-05-29 02:33:40] [INFO ] Redundant transitions in 321 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:33:40] [INFO ] Computed 900 invariants in 5 ms
[2024-05-29 02:33:41] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5315 places, 2400/5215 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8303 ms. Remains : 2500/5315 places, 2400/5215 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s2080 1), p1:(AND (EQ s385 1) (EQ s390 1) (EQ s401 1) (EQ s585 1) (EQ s590 1) (EQ s601 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 19 reset in 1834 ms.
Product exploration explored 100000 steps with 19 reset in 2207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 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 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:33:46] [INFO ] Invariant cache hit.
[2024-05-29 02:33:47] [INFO ] [Real]Absence check using 900 positive place invariants in 176 ms returned sat
[2024-05-29 02:33:48] [INFO ] After 1915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:33:49] [INFO ] [Nat]Absence check using 900 positive place invariants in 196 ms returned sat
[2024-05-29 02:33:50] [INFO ] After 1496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:33:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:33:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 02:33:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2024-05-29 02:33:51] [INFO ] After 2019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2024-05-29 02:33:51] [INFO ] After 2832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 160 ms.
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 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 2500 transition count 2400
Applied a total of 594 rules in 177 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 100491 steps, run timeout after 3005 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100491 steps, saw 99586 distinct states, run finished after 3008 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:33:55] [INFO ] Computed 900 invariants in 20 ms
[2024-05-29 02:33:56] [INFO ] [Real]Absence check using 900 positive place invariants in 175 ms returned sat
[2024-05-29 02:33:57] [INFO ] After 1877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:33:57] [INFO ] [Nat]Absence check using 900 positive place invariants in 178 ms returned sat
[2024-05-29 02:33:59] [INFO ] After 1560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:33:59] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2024-05-29 02:33:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 02:34:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 02:34:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1407 ms
[2024-05-29 02:34:01] [INFO ] After 3177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-29 02:34:01] [INFO ] After 3944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 183 ms.
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 89 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:34:01] [INFO ] Invariant cache hit.
[2024-05-29 02:34:03] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2024-05-29 02:34:03] [INFO ] Invariant cache hit.
[2024-05-29 02:34:08] [INFO ] Implicit Places using invariants and state equation in 4523 ms returned []
Implicit Place search using SMT with State Equation took 6685 ms to find 0 implicit places.
[2024-05-29 02:34:08] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-29 02:34:08] [INFO ] Invariant cache hit.
[2024-05-29 02:34:10] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8604 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:34:10] [INFO ] Invariant cache hit.
[2024-05-29 02:34:10] [INFO ] [Real]Absence check using 900 positive place invariants in 173 ms returned sat
[2024-05-29 02:34:12] [INFO ] After 1853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 182 ms returned sat
[2024-05-29 02:34:14] [INFO ] After 1463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:34:14] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:34:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 02:34:14] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 02:34:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 449 ms
[2024-05-29 02:34:14] [INFO ] After 2117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-29 02:34:15] [INFO ] After 2892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 178 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 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:34:15] [INFO ] Computed 900 invariants in 11 ms
[2024-05-29 02:34:17] [INFO ] Implicit Places using invariants in 1574 ms returned []
[2024-05-29 02:34:17] [INFO ] Invariant cache hit.
[2024-05-29 02:34:20] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 5177 ms to find 0 implicit places.
[2024-05-29 02:34:20] [INFO ] Redundant transitions in 296 ms returned []
[2024-05-29 02:34:20] [INFO ] Invariant cache hit.
[2024-05-29 02:34:22] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7348 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 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 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 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 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:34:23] [INFO ] Invariant cache hit.
[2024-05-29 02:34:23] [INFO ] [Real]Absence check using 900 positive place invariants in 180 ms returned sat
[2024-05-29 02:34:25] [INFO ] After 1849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:25] [INFO ] [Nat]Absence check using 900 positive place invariants in 187 ms returned sat
[2024-05-29 02:34:27] [INFO ] After 1458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:34:27] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 02:34:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 02:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-05-29 02:34:28] [INFO ] After 2099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-29 02:34:28] [INFO ] After 2876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 157 ms.
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 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 2500 transition count 2400
Applied a total of 594 rules in 162 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97675 steps, run timeout after 3035 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97675 steps, saw 96781 distinct states, run finished after 3035 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:34:32] [INFO ] Computed 900 invariants in 20 ms
[2024-05-29 02:34:32] [INFO ] [Real]Absence check using 900 positive place invariants in 164 ms returned sat
[2024-05-29 02:34:34] [INFO ] After 1862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:34] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2024-05-29 02:34:36] [INFO ] After 1524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2024-05-29 02:34:36] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 02:34:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1420 ms
[2024-05-29 02:34:37] [INFO ] After 3150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2024-05-29 02:34:37] [INFO ] After 3899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 119 ms.
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:34:38] [INFO ] Invariant cache hit.
[2024-05-29 02:34:40] [INFO ] Implicit Places using invariants in 2102 ms returned []
[2024-05-29 02:34:40] [INFO ] Invariant cache hit.
[2024-05-29 02:34:44] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 6507 ms to find 0 implicit places.
[2024-05-29 02:34:44] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-29 02:34:44] [INFO ] Invariant cache hit.
[2024-05-29 02:34:46] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8400 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:34:46] [INFO ] Invariant cache hit.
[2024-05-29 02:34:47] [INFO ] [Real]Absence check using 900 positive place invariants in 184 ms returned sat
[2024-05-29 02:34:48] [INFO ] After 1799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:34:48] [INFO ] [Nat]Absence check using 900 positive place invariants in 177 ms returned sat
[2024-05-29 02:34:50] [INFO ] After 1398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:34:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2024-05-29 02:34:50] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:34:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 02:34:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2024-05-29 02:34:51] [INFO ] After 2078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-29 02:34:51] [INFO ] After 2812ms 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) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 147 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 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19 reset in 1841 ms.
Product exploration explored 100000 steps with 19 reset in 2333 ms.
Built C files in :
/tmp/ltsmin11966288360235128290
[2024-05-29 02:34:55] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:34:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11966288360235128290
Running compilation step : cd /tmp/ltsmin11966288360235128290;'/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/ltsmin11966288360235128290;'/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/ltsmin11966288360235128290;'/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 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2024-05-29 02:34:58] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:35:00] [INFO ] Implicit Places using invariants in 1520 ms returned []
[2024-05-29 02:35:00] [INFO ] Invariant cache hit.
[2024-05-29 02:35:03] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 5045 ms to find 0 implicit places.
[2024-05-29 02:35:04] [INFO ] Redundant transitions in 278 ms returned []
[2024-05-29 02:35:04] [INFO ] Invariant cache hit.
[2024-05-29 02:35:05] [INFO ] Dead Transitions using invariants and state equation in 1674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7097 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin9935731316344839537
[2024-05-29 02:35:05] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:35:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9935731316344839537
Running compilation step : cd /tmp/ltsmin9935731316344839537;'/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/ltsmin9935731316344839537;'/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/ltsmin9935731316344839537;'/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 02:35:09] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:35:09] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:35:09] [INFO ] Time to serialize gal into /tmp/LTL16651461488899089621.gal : 46 ms
[2024-05-29 02:35:09] [INFO ] Time to serialize properties into /tmp/LTL8714408322215254422.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/LTL16651461488899089621.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7731705809825337251.hoa' '-atoms' '/tmp/LTL8714408322215254422.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/LTL8714408322215254422.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7731705809825337251.hoa
Detected timeout of ITS tools.
[2024-05-29 02:35:24] [INFO ] Flatten gal took : 67 ms
[2024-05-29 02:35:24] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:35:24] [INFO ] Time to serialize gal into /tmp/LTL3856542908093855014.gal : 11 ms
[2024-05-29 02:35:24] [INFO ] Time to serialize properties into /tmp/LTL13252791586474588310.ltl : 61 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/LTL3856542908093855014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13252791586474588310.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("(p5012!=1)"))||(("(p5012!=1)")&&(F(G("((((p1008==1)&&(p1016==1))&&((p1043==1)&&(p1480==1)))&&((p1488==1)&&(p1515==1)))"))))))...156
Formula 0 simplified : G(F!"(p5012!=1)" & (!"(p5012!=1)" | GF!"((((p1008==1)&&(p1016==1))&&((p1043==1)&&(p1480==1)))&&((p1488==1)&&(p1515==1)))"))
Detected timeout of ITS tools.
[2024-05-29 02:35:39] [INFO ] Flatten gal took : 88 ms
[2024-05-29 02:35:39] [INFO ] Applying decomposition
[2024-05-29 02:35:39] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18205109114457307701.txt' '-o' '/tmp/graph18205109114457307701.bin' '-w' '/tmp/graph18205109114457307701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18205109114457307701.bin' '-l' '-1' '-v' '-w' '/tmp/graph18205109114457307701.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:35:40] [INFO ] Decomposing Gal with order
[2024-05-29 02:35:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:35:40] [INFO ] Removed a total of 1595 redundant transitions.
[2024-05-29 02:35:40] [INFO ] Flatten gal took : 102 ms
[2024-05-29 02:35:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1516 labels/synchronizations in 18 ms.
[2024-05-29 02:35:40] [INFO ] Time to serialize gal into /tmp/LTL11149587912382099066.gal : 18 ms
[2024-05-29 02:35:40] [INFO ] Time to serialize properties into /tmp/LTL3718689439065001245.ltl : 60 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/LTL11149587912382099066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3718689439065001245.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 : !((F((G("(i36.i0.i2.u749.p5012!=1)"))||(("(i36.i0.i2.u749.p5012!=1)")&&(F(G("((((i7.i0.i0.u139.p1008==1)&&(i7.i0.i0.u141.p1016==1))&&(...273
Formula 0 simplified : G(F!"(i36.i0.i2.u749.p5012!=1)" & (!"(i36.i0.i2.u749.p5012!=1)" | GF!"((((i7.i0.i0.u139.p1008==1)&&(i7.i0.i0.u141.p1016==1))&&((i7.i...263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9049982085818297510
[2024-05-29 02:35:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9049982085818297510
Running compilation step : cd /tmp/ltsmin9049982085818297510;'/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/ltsmin9049982085818297510;'/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/ltsmin9049982085818297510;'/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 ShieldIIPs-PT-100B-LTLFireability-14 finished in 145100 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)||G(p1)))'
Support contains 2 out of 5315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4815 transition count 4214
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2011 place count 4303 transition count 4203
Iterating global reduction 2 with 11 rules applied. Total rules applied 2022 place count 4303 transition count 4203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2022 place count 4303 transition count 4202
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2024 place count 4302 transition count 4202
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 12 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5616 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5618 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5619 place count 2503 transition count 2404
Applied a total of 5619 rules in 1345 ms. Remains 2503 /5315 variables (removed 2812) and now considering 2404/5215 (removed 2811) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:35:59] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:36:01] [INFO ] Implicit Places using invariants in 1620 ms returned []
[2024-05-29 02:36:01] [INFO ] Invariant cache hit.
[2024-05-29 02:36:05] [INFO ] Implicit Places using invariants and state equation in 3438 ms returned []
Implicit Place search using SMT with State Equation took 5097 ms to find 0 implicit places.
[2024-05-29 02:36:05] [INFO ] Redundant transitions in 284 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:36:05] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:36:07] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5315 places, 2403/5215 transitions.
Applied a total of 0 rules in 80 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8562 ms. Remains : 2503/5315 places, 2403/5215 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1693 1), p1:(EQ s2489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27043 reset in 2239 ms.
Product exploration explored 100000 steps with 27407 reset in 2549 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 370 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 321 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 02:36:12] [INFO ] Invariant cache hit.
[2024-05-29 02:36:16] [INFO ] [Real]Absence check using 900 positive place invariants in 955 ms returned sat
[2024-05-29 02:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:36:27] [INFO ] [Real]Absence check using state equation in 11483 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2503 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 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:36:28] [INFO ] Invariant cache hit.
[2024-05-29 02:36:29] [INFO ] Implicit Places using invariants in 1569 ms returned []
[2024-05-29 02:36:29] [INFO ] Invariant cache hit.
[2024-05-29 02:36:33] [INFO ] Implicit Places using invariants and state equation in 3393 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
[2024-05-29 02:36:33] [INFO ] Redundant transitions in 284 ms returned []
[2024-05-29 02:36:33] [INFO ] Invariant cache hit.
[2024-05-29 02:36:35] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7066 ms. Remains : 2503/2503 places, 2403/2403 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-29 02:36:35] [INFO ] Invariant cache hit.
[2024-05-29 02:36:38] [INFO ] [Real]Absence check using 900 positive place invariants in 972 ms returned sat
[2024-05-29 02:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:36:50] [INFO ] [Real]Absence check using state equation in 11606 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27187 reset in 2209 ms.
Product exploration explored 100000 steps with 27414 reset in 2599 ms.
Built C files in :
/tmp/ltsmin3240886066986598526
[2024-05-29 02:36:55] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:36:55] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3240886066986598526
Running compilation step : cd /tmp/ltsmin3240886066986598526;'/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/ltsmin3240886066986598526;'/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/ltsmin3240886066986598526;'/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 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 144 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-29 02:36:58] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:37:00] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2024-05-29 02:37:00] [INFO ] Invariant cache hit.
[2024-05-29 02:37:03] [INFO ] Implicit Places using invariants and state equation in 3558 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2024-05-29 02:37:04] [INFO ] Redundant transitions in 273 ms returned []
[2024-05-29 02:37:04] [INFO ] Invariant cache hit.
[2024-05-29 02:37:05] [INFO ] Dead Transitions using invariants and state equation in 1737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7285 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Built C files in :
/tmp/ltsmin18302643950092607519
[2024-05-29 02:37:05] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:37:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18302643950092607519
Running compilation step : cd /tmp/ltsmin18302643950092607519;'/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/ltsmin18302643950092607519;'/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/ltsmin18302643950092607519;'/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 02:37:08] [INFO ] Flatten gal took : 72 ms
[2024-05-29 02:37:09] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:37:09] [INFO ] Time to serialize gal into /tmp/LTL13569006142541261073.gal : 10 ms
[2024-05-29 02:37:09] [INFO ] Time to serialize properties into /tmp/LTL11179870737342571058.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/LTL13569006142541261073.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4715040342759429709.hoa' '-atoms' '/tmp/LTL11179870737342571058.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/LTL11179870737342571058.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4715040342759429709.hoa
Detected timeout of ITS tools.
[2024-05-29 02:37:24] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:37:24] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:37:24] [INFO ] Time to serialize gal into /tmp/LTL3640644693027443430.gal : 10 ms
[2024-05-29 02:37:24] [INFO ] Time to serialize properties into /tmp/LTL3222539083324229127.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/LTL3640644693027443430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3222539083324229127.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 : !(((F("(p4089==1)"))||(G("(p5970==1)"))))
Formula 0 simplified : G!"(p4089==1)" & F!"(p5970==1)"
Detected timeout of ITS tools.
[2024-05-29 02:37:39] [INFO ] Flatten gal took : 72 ms
[2024-05-29 02:37:39] [INFO ] Applying decomposition
[2024-05-29 02:37:39] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1641043466477001177.txt' '-o' '/tmp/graph1641043466477001177.bin' '-w' '/tmp/graph1641043466477001177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1641043466477001177.bin' '-l' '-1' '-v' '-w' '/tmp/graph1641043466477001177.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:37:39] [INFO ] Decomposing Gal with order
[2024-05-29 02:37:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:37:40] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:37:40] [INFO ] Flatten gal took : 98 ms
[2024-05-29 02:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1522 labels/synchronizations in 17 ms.
[2024-05-29 02:37:40] [INFO ] Time to serialize gal into /tmp/LTL16645929649406219987.gal : 23 ms
[2024-05-29 02:37:40] [INFO ] Time to serialize properties into /tmp/LTL9239821652528607398.ltl : 5 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/LTL16645929649406219987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9239821652528607398.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 : !(((F("(i31.i1.i0.u610.p4089==1)"))||(G("(i47.i1.i1.u897.p5970==1)"))))
Formula 0 simplified : G!"(i31.i1.i0.u610.p4089==1)" & F!"(i47.i1.i1.u897.p5970==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8165527140979779535
[2024-05-29 02:37:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8165527140979779535
Running compilation step : cd /tmp/ltsmin8165527140979779535;'/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/ltsmin8165527140979779535;'/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/ltsmin8165527140979779535;'/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 ShieldIIPs-PT-100B-LTLFireability-15 finished in 119613 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&&X(p1))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100B-LTLFireability-00
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4815 transition count 4715
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 998 place count 4815 transition count 4215
Deduced a syphon composed of 500 places in 28 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1998 place count 4315 transition count 4215
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2010 place count 4303 transition count 4203
Iterating global reduction 2 with 12 rules applied. Total rules applied 2022 place count 4303 transition count 4203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2022 place count 4303 transition count 4200
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2028 place count 4300 transition count 4200
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 18 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5616 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5618 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5619 place count 2503 transition count 2404
Applied a total of 5619 rules in 1374 ms. Remains 2503 /5315 variables (removed 2812) and now considering 2404/5215 (removed 2811) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:37:59] [INFO ] Computed 900 invariants in 13 ms
[2024-05-29 02:38:01] [INFO ] Implicit Places using invariants in 1560 ms returned []
[2024-05-29 02:38:01] [INFO ] Invariant cache hit.
[2024-05-29 02:38:04] [INFO ] Implicit Places using invariants and state equation in 3556 ms returned []
Implicit Place search using SMT with State Equation took 5133 ms to find 0 implicit places.
[2024-05-29 02:38:04] [INFO ] Invariant cache hit.
[2024-05-29 02:38:06] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2503/5315 places, 2404/5215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8220 ms. Remains : 2503/5315 places, 2404/5215 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1781 0) (EQ s1793 0)), p1:(EQ s1995 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23979 reset in 2075 ms.
Product exploration explored 100000 steps with 23863 reset in 2462 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/2503 stabilizing places and 2/2404 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) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1285 steps, including 0 resets, run visited all 3 properties in 43 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 02:38:12] [INFO ] Invariant cache hit.
[2024-05-29 02:38:15] [INFO ] [Real]Absence check using 900 positive place invariants in 947 ms returned sat
[2024-05-29 02:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:38:27] [INFO ] [Real]Absence check using state equation in 11527 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2024-05-29 02:38:27] [INFO ] Invariant cache hit.
[2024-05-29 02:38:28] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2024-05-29 02:38:28] [INFO ] Invariant cache hit.
[2024-05-29 02:38:32] [INFO ] Implicit Places using invariants and state equation in 3267 ms returned []
Implicit Place search using SMT with State Equation took 4853 ms to find 0 implicit places.
[2024-05-29 02:38:32] [INFO ] Invariant cache hit.
[2024-05-29 02:38:33] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6605 ms. Remains : 2503/2503 places, 2404/2404 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/2503 stabilizing places and 2/2404 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1351 steps, including 0 resets, run visited all 3 properties in 29 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-29 02:38:34] [INFO ] Invariant cache hit.
[2024-05-29 02:38:37] [INFO ] [Real]Absence check using 900 positive place invariants in 943 ms returned sat
[2024-05-29 02:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:38:49] [INFO ] [Real]Absence check using state equation in 11551 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 23966 reset in 2090 ms.
Product exploration explored 100000 steps with 24053 reset in 2448 ms.
Built C files in :
/tmp/ltsmin5103078802220663026
[2024-05-29 02:38:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5103078802220663026
Running compilation step : cd /tmp/ltsmin5103078802220663026;'/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/ltsmin5103078802220663026;'/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/ltsmin5103078802220663026;'/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 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2024-05-29 02:38:57] [INFO ] Invariant cache hit.
[2024-05-29 02:38:58] [INFO ] Implicit Places using invariants in 1548 ms returned []
[2024-05-29 02:38:58] [INFO ] Invariant cache hit.
[2024-05-29 02:39:02] [INFO ] Implicit Places using invariants and state equation in 3444 ms returned []
Implicit Place search using SMT with State Equation took 5006 ms to find 0 implicit places.
[2024-05-29 02:39:02] [INFO ] Invariant cache hit.
[2024-05-29 02:39:04] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6793 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Built C files in :
/tmp/ltsmin3165714259737506831
[2024-05-29 02:39:04] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3165714259737506831
Running compilation step : cd /tmp/ltsmin3165714259737506831;'/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/ltsmin3165714259737506831;'/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/ltsmin3165714259737506831;'/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 02:39:07] [INFO ] Flatten gal took : 68 ms
[2024-05-29 02:39:07] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:39:07] [INFO ] Time to serialize gal into /tmp/LTL18024062181675377645.gal : 10 ms
[2024-05-29 02:39:07] [INFO ] Time to serialize properties into /tmp/LTL4437274772150698804.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/LTL18024062181675377645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8128323264574581242.hoa' '-atoms' '/tmp/LTL4437274772150698804.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/LTL4437274772150698804.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8128323264574581242.hoa
Detected timeout of ITS tools.
[2024-05-29 02:39:22] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:39:22] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:39:22] [INFO ] Time to serialize gal into /tmp/LTL10585895154283930613.gal : 10 ms
[2024-05-29 02:39:22] [INFO ] Time to serialize properties into /tmp/LTL2823602782758204663.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/LTL10585895154283930613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2823602782758204663.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((X("(p4798==1)"))&&("((p4306==0)||(p4323==0))"))))
Formula 0 simplified : G(!"((p4306==0)||(p4323==0))" | X!"(p4798==1)")
Detected timeout of ITS tools.
[2024-05-29 02:39:37] [INFO ] Flatten gal took : 68 ms
[2024-05-29 02:39:37] [INFO ] Applying decomposition
[2024-05-29 02:39:37] [INFO ] Flatten gal took : 68 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/graph8035634721294365127.txt' '-o' '/tmp/graph8035634721294365127.bin' '-w' '/tmp/graph8035634721294365127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8035634721294365127.bin' '-l' '-1' '-v' '-w' '/tmp/graph8035634721294365127.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:39:38] [INFO ] Decomposing Gal with order
[2024-05-29 02:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:39:38] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 02:39:38] [INFO ] Flatten gal took : 98 ms
[2024-05-29 02:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1552 labels/synchronizations in 16 ms.
[2024-05-29 02:39:38] [INFO ] Time to serialize gal into /tmp/LTL1751449468144780706.gal : 17 ms
[2024-05-29 02:39:38] [INFO ] Time to serialize properties into /tmp/LTL10103756367723818577.ltl : 21 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/LTL1751449468144780706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10103756367723818577.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 : !((F((X("(i36.u720.p4798==1)"))&&("((i32.u641.p4306==0)||(i32.u646.p4323==0))"))))
Formula 0 simplified : G(!"((i32.u641.p4306==0)||(i32.u646.p4323==0))" | X!"(i36.u720.p4798==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16936797738438199936
[2024-05-29 02:39:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16936797738438199936
Running compilation step : cd /tmp/ltsmin16936797738438199936;'/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/ltsmin16936797738438199936;'/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/ltsmin16936797738438199936;'/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 ShieldIIPs-PT-100B-LTLFireability-00 finished in 118222 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)))'
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)))||F(p1)))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100B-LTLFireability-07
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5314 transition count 4715
Reduce places removed 499 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 500 rules applied. Total rules applied 999 place count 4815 transition count 4714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1000 place count 4814 transition count 4714
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1000 place count 4814 transition count 4214
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2011 place count 4303 transition count 4203
Iterating global reduction 3 with 11 rules applied. Total rules applied 2022 place count 4303 transition count 4203
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2022 place count 4303 transition count 4200
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2028 place count 4300 transition count 4200
Performed 1791 Post agglomeration using F-continuation condition.Transition count delta: 1791
Deduced a syphon composed of 1791 places in 14 ms
Reduce places removed 1791 places and 0 transitions.
Iterating global reduction 3 with 3582 rules applied. Total rules applied 5610 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5612 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5613 place count 2506 transition count 2407
Applied a total of 5613 rules in 1236 ms. Remains 2506 /5315 variables (removed 2809) and now considering 2407/5215 (removed 2808) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:39:57] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:39:59] [INFO ] Implicit Places using invariants in 1636 ms returned []
[2024-05-29 02:39:59] [INFO ] Invariant cache hit.
[2024-05-29 02:40:02] [INFO ] Implicit Places using invariants and state equation in 3254 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
[2024-05-29 02:40:02] [INFO ] Invariant cache hit.
[2024-05-29 02:40:04] [INFO ] Dead Transitions using invariants and state equation in 1538 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2506/5315 places, 2407/5215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7690 ms. Remains : 2506/5315 places, 2407/5215 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (AND (EQ s1174 0) (EQ s570 1)) (EQ s528 1)), p0:(EQ s1456 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29152 reset in 2449 ms.
Product exploration explored 100000 steps with 29108 reset in 2747 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/2506 stabilizing places and 6/2407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
[2024-05-29 02:40:10] [INFO ] Invariant cache hit.
[2024-05-29 02:40:14] [INFO ] [Real]Absence check using 900 positive place invariants in 1134 ms returned sat
[2024-05-29 02:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:40:25] [INFO ] [Real]Absence check using state equation in 11170 ms returned unknown
Could not prove EG (NOT p1)
Support contains 3 out of 2506 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 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 75 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2024-05-29 02:40:25] [INFO ] Invariant cache hit.
[2024-05-29 02:40:26] [INFO ] Implicit Places using invariants in 1565 ms returned []
[2024-05-29 02:40:26] [INFO ] Invariant cache hit.
[2024-05-29 02:40:30] [INFO ] Implicit Places using invariants and state equation in 3393 ms returned []
Implicit Place search using SMT with State Equation took 4989 ms to find 0 implicit places.
[2024-05-29 02:40:30] [INFO ] Redundant transitions in 278 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2024-05-29 02:40:30] [INFO ] Computed 900 invariants in 6 ms
[2024-05-29 02:40:32] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/2506 places, 2406/2407 transitions.
Applied a total of 0 rules in 86 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7123 ms. Remains : 2506/2506 places, 2406/2407 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/2506 stabilizing places and 6/2406 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2024-05-29 02:40:32] [INFO ] Invariant cache hit.
[2024-05-29 02:40:36] [INFO ] [Real]Absence check using 900 positive place invariants in 938 ms returned sat
[2024-05-29 02:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:40:47] [INFO ] [Real]Absence check using state equation in 11342 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 28989 reset in 2465 ms.
Product exploration explored 100000 steps with 28952 reset in 2753 ms.
Built C files in :
/tmp/ltsmin8880484293500606456
[2024-05-29 02:40:53] [INFO ] Too many transitions (2406) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:40:53] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8880484293500606456
Running compilation step : cd /tmp/ltsmin8880484293500606456;'/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/ltsmin8880484293500606456;'/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/ltsmin8880484293500606456;'/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 2506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2505 transition count 2405
Applied a total of 2 rules in 148 ms. Remains 2505 /2506 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
// Phase 1: matrix 2405 rows 2505 cols
[2024-05-29 02:40:56] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:40:57] [INFO ] Implicit Places using invariants in 1554 ms returned []
[2024-05-29 02:40:57] [INFO ] Invariant cache hit.
[2024-05-29 02:41:01] [INFO ] Implicit Places using invariants and state equation in 3506 ms returned []
Implicit Place search using SMT with State Equation took 5073 ms to find 0 implicit places.
[2024-05-29 02:41:01] [INFO ] Redundant transitions in 288 ms returned []
[2024-05-29 02:41:01] [INFO ] Invariant cache hit.
[2024-05-29 02:41:03] [INFO ] Dead Transitions using invariants and state equation in 1623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2505/2506 places, 2405/2406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7150 ms. Remains : 2505/2506 places, 2405/2406 transitions.
Built C files in :
/tmp/ltsmin2627885262957948458
[2024-05-29 02:41:03] [INFO ] Too many transitions (2405) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:41:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2627885262957948458
Running compilation step : cd /tmp/ltsmin2627885262957948458;'/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/ltsmin2627885262957948458;'/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/ltsmin2627885262957948458;'/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 02:41:06] [INFO ] Flatten gal took : 72 ms
[2024-05-29 02:41:06] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:41:06] [INFO ] Time to serialize gal into /tmp/LTL3805132586106993914.gal : 23 ms
[2024-05-29 02:41:06] [INFO ] Time to serialize properties into /tmp/LTL16665410531377431981.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/LTL3805132586106993914.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8083539265752701879.hoa' '-atoms' '/tmp/LTL16665410531377431981.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/LTL16665410531377431981.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8083539265752701879.hoa
Detected timeout of ITS tools.
[2024-05-29 02:41:21] [INFO ] Flatten gal took : 74 ms
[2024-05-29 02:41:21] [INFO ] Flatten gal took : 76 ms
[2024-05-29 02:41:21] [INFO ] Time to serialize gal into /tmp/LTL12544738309678623464.gal : 12 ms
[2024-05-29 02:41:21] [INFO ] Time to serialize properties into /tmp/LTL5279636608886784332.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/LTL12544738309678623464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5279636608886784332.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("(p3518==1)"))))||(F("(((p2855==0)&&(p1435==1))||(p1342==1))"))))
Formula 0 simplified : XXF!"(p3518==1)" & G!"(((p2855==0)&&(p1435==1))||(p1342==1))"
Detected timeout of ITS tools.
[2024-05-29 02:41:37] [INFO ] Flatten gal took : 75 ms
[2024-05-29 02:41:37] [INFO ] Applying decomposition
[2024-05-29 02:41:37] [INFO ] Flatten gal took : 75 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/graph5272689955727154772.txt' '-o' '/tmp/graph5272689955727154772.bin' '-w' '/tmp/graph5272689955727154772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5272689955727154772.bin' '-l' '-1' '-v' '-w' '/tmp/graph5272689955727154772.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:41:37] [INFO ] Decomposing Gal with order
[2024-05-29 02:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:41:37] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:41:37] [INFO ] Flatten gal took : 103 ms
[2024-05-29 02:41:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1524 labels/synchronizations in 25 ms.
[2024-05-29 02:41:37] [INFO ] Time to serialize gal into /tmp/LTL4637866644749186232.gal : 19 ms
[2024-05-29 02:41:37] [INFO ] Time to serialize properties into /tmp/LTL17144776560980138236.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/LTL4637866644749186232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17144776560980138236.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("(i26.i1.i2.u523.p3518==1)"))))||(F("(((i21.u422.p2855==0)&&(i10.u205.p1435==1))||(i9.u196.p1342==1))"))))
Formula 0 simplified : XXF!"(i26.i1.i2.u523.p3518==1)" & G!"(((i21.u422.p2855==0)&&(i10.u205.p1435==1))||(i9.u196.p1342==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9528130762195385708
[2024-05-29 02:41:52] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9528130762195385708
Running compilation step : cd /tmp/ltsmin9528130762195385708;'/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/ltsmin9528130762195385708;'/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/ltsmin9528130762195385708;'/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 ShieldIIPs-PT-100B-LTLFireability-07 finished in 119187 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)))'
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 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
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(X(G(F(X(G((X(!p0) U p1)))))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100B-LTLFireability-13
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 5315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5315/5315 places, 5215/5215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5314 transition count 4714
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1000 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 26 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2002 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2014 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2026 place count 4301 transition count 4201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2026 place count 4301 transition count 4198
Deduced a syphon composed of 3 places in 17 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2032 place count 4298 transition count 4198
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 11 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5622 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5624 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5625 place count 2500 transition count 2401
Applied a total of 5625 rules in 1197 ms. Remains 2500 /5315 variables (removed 2815) and now considering 2401/5215 (removed 2814) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:41:57] [INFO ] Computed 900 invariants in 10 ms
[2024-05-29 02:41:58] [INFO ] Implicit Places using invariants in 1623 ms returned []
[2024-05-29 02:41:58] [INFO ] Invariant cache hit.
[2024-05-29 02:42:02] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
[2024-05-29 02:42:02] [INFO ] Invariant cache hit.
[2024-05-29 02:42:04] [INFO ] Dead Transitions using invariants and state equation in 1768 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/5315 places, 2401/5215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7946 ms. Remains : 2500/5315 places, 2401/5215 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s1721 1), p0:(AND (EQ s1010 1) (EQ s1015 1) (EQ s1026 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 31 reset in 1717 ms.
Product exploration explored 100000 steps with 32 reset in 2032 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 p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:42:08] [INFO ] Invariant cache hit.
[2024-05-29 02:42:08] [INFO ] [Real]Absence check using 900 positive place invariants in 168 ms returned sat
[2024-05-29 02:42:10] [INFO ] After 1761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:42:10] [INFO ] [Nat]Absence check using 900 positive place invariants in 183 ms returned sat
[2024-05-29 02:42:11] [INFO ] After 1335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:42:12] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-05-29 02:42:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:42:12] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:42:12] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 02:42:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:42:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 808 ms
[2024-05-29 02:42:12] [INFO ] After 2209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-29 02:42:12] [INFO ] After 2828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 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 2400
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 598 place count 2499 transition count 2400
Applied a total of 598 rules in 215 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 2499/2500 places, 2400/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 136383 steps, run timeout after 3003 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136383 steps, saw 135237 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:42:16] [INFO ] Computed 900 invariants in 18 ms
[2024-05-29 02:42:16] [INFO ] [Real]Absence check using 900 positive place invariants in 179 ms returned sat
[2024-05-29 02:42:18] [INFO ] After 1808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:42:18] [INFO ] [Nat]Absence check using 900 positive place invariants in 169 ms returned sat
[2024-05-29 02:42:20] [INFO ] After 1340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:42:20] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:42:20] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 02:42:20] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 02:42:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1753 ms
[2024-05-29 02:42:22] [INFO ] After 3150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-29 02:42:22] [INFO ] After 3789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:42:22] [INFO ] Invariant cache hit.
[2024-05-29 02:42:24] [INFO ] Implicit Places using invariants in 1957 ms returned []
[2024-05-29 02:42:24] [INFO ] Invariant cache hit.
[2024-05-29 02:42:28] [INFO ] Implicit Places using invariants and state equation in 4062 ms returned []
Implicit Place search using SMT with State Equation took 6041 ms to find 0 implicit places.
[2024-05-29 02:42:28] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-29 02:42:28] [INFO ] Invariant cache hit.
[2024-05-29 02:42:30] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7960 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:42:30] [INFO ] Invariant cache hit.
[2024-05-29 02:42:30] [INFO ] [Real]Absence check using 900 positive place invariants in 167 ms returned sat
[2024-05-29 02:42:32] [INFO ] After 1792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:42:32] [INFO ] [Nat]Absence check using 900 positive place invariants in 165 ms returned sat
[2024-05-29 02:42:33] [INFO ] After 1426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:42:34] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2024-05-29 02:42:34] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2024-05-29 02:42:34] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2024-05-29 02:42:34] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-29 02:42:35] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 02:42:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1218 ms
[2024-05-29 02:42:35] [INFO ] After 2701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 02:42:35] [INFO ] After 3295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 66 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:42:35] [INFO ] Computed 900 invariants in 6 ms
[2024-05-29 02:42:37] [INFO ] Implicit Places using invariants in 1549 ms returned []
[2024-05-29 02:42:37] [INFO ] Invariant cache hit.
[2024-05-29 02:42:40] [INFO ] Implicit Places using invariants and state equation in 3476 ms returned []
Implicit Place search using SMT with State Equation took 5071 ms to find 0 implicit places.
[2024-05-29 02:42:40] [INFO ] Invariant cache hit.
[2024-05-29 02:42:42] [INFO ] Dead Transitions using invariants and state equation in 1692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6834 ms. Remains : 2500/2500 places, 2401/2401 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 p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-29 02:42:42] [INFO ] Invariant cache hit.
[2024-05-29 02:42:43] [INFO ] [Real]Absence check using 900 positive place invariants in 192 ms returned sat
[2024-05-29 02:42:44] [INFO ] After 1906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:42:45] [INFO ] [Nat]Absence check using 900 positive place invariants in 171 ms returned sat
[2024-05-29 02:42:46] [INFO ] After 1265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:42:46] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:42:46] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:42:47] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2024-05-29 02:42:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:42:47] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-29 02:42:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 802 ms
[2024-05-29 02:42:47] [INFO ] After 2130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 02:42:47] [INFO ] After 2702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 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 2400
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 598 place count 2499 transition count 2400
Applied a total of 598 rules in 280 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 2499/2500 places, 2400/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) 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 132408 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132408 steps, saw 131286 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2024-05-29 02:42:51] [INFO ] Computed 900 invariants in 21 ms
[2024-05-29 02:42:51] [INFO ] [Real]Absence check using 900 positive place invariants in 193 ms returned sat
[2024-05-29 02:42:53] [INFO ] After 1975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:42:53] [INFO ] [Nat]Absence check using 900 positive place invariants in 194 ms returned sat
[2024-05-29 02:42:55] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:42:55] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:42:55] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 02:42:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 02:42:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 02:42:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1731 ms
[2024-05-29 02:42:57] [INFO ] After 3375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 02:42:57] [INFO ] After 4021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 73 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-29 02:42:57] [INFO ] Invariant cache hit.
[2024-05-29 02:42:59] [INFO ] Implicit Places using invariants in 2162 ms returned []
[2024-05-29 02:42:59] [INFO ] Invariant cache hit.
[2024-05-29 02:43:04] [INFO ] Implicit Places using invariants and state equation in 4686 ms returned []
Implicit Place search using SMT with State Equation took 6853 ms to find 0 implicit places.
[2024-05-29 02:43:04] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-29 02:43:04] [INFO ] Invariant cache hit.
[2024-05-29 02:43:06] [INFO ] Dead Transitions using invariants and state equation in 1699 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8728 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 74 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:43:06] [INFO ] Invariant cache hit.
[2024-05-29 02:43:06] [INFO ] [Real]Absence check using 900 positive place invariants in 176 ms returned sat
[2024-05-29 02:43:08] [INFO ] After 1818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:43:08] [INFO ] [Nat]Absence check using 900 positive place invariants in 182 ms returned sat
[2024-05-29 02:43:10] [INFO ] After 1462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:43:10] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2024-05-29 02:43:10] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:43:10] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:43:10] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:43:10] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:43:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 949 ms
[2024-05-29 02:43:11] [INFO ] After 2467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 02:43:11] [INFO ] After 3088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 27 reset in 1716 ms.
Product exploration explored 100000 steps with 36 reset in 2118 ms.
Built C files in :
/tmp/ltsmin2794412941912192523
[2024-05-29 02:43:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2794412941912192523
Running compilation step : cd /tmp/ltsmin2794412941912192523;'/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/ltsmin2794412941912192523;'/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/ltsmin2794412941912192523;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-29 02:43:18] [INFO ] Computed 900 invariants in 11 ms
[2024-05-29 02:43:20] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2024-05-29 02:43:20] [INFO ] Invariant cache hit.
[2024-05-29 02:43:23] [INFO ] Implicit Places using invariants and state equation in 3557 ms returned []
Implicit Place search using SMT with State Equation took 5257 ms to find 0 implicit places.
[2024-05-29 02:43:23] [INFO ] Invariant cache hit.
[2024-05-29 02:43:25] [INFO ] Dead Transitions using invariants and state equation in 1754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7090 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin5554365324681629969
[2024-05-29 02:43:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5554365324681629969
Running compilation step : cd /tmp/ltsmin5554365324681629969;'/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/ltsmin5554365324681629969;'/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/ltsmin5554365324681629969;'/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 02:43:28] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:43:28] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:43:28] [INFO ] Time to serialize gal into /tmp/LTL11247887297261683535.gal : 12 ms
[2024-05-29 02:43:28] [INFO ] Time to serialize properties into /tmp/LTL10837501124288190511.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/LTL11247887297261683535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8791492056219704304.hoa' '-atoms' '/tmp/LTL10837501124288190511.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/LTL10837501124288190511.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8791492056219704304.hoa
Detected timeout of ITS tools.
[2024-05-29 02:43:44] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:43:44] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:43:44] [INFO ] Time to serialize gal into /tmp/LTL6857513641644181719.gal : 11 ms
[2024-05-29 02:43:44] [INFO ] Time to serialize properties into /tmp/LTL16588490246332748028.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/LTL6857513641644181719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16588490246332748028.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 : !((G(F(X(G(F(X(G((X(!("(((p2483==1)&&(p2491==1))&&(p2518==1))")))U("(p4156!=1)"))))))))))
Formula 0 simplified : GF(!"(p4156!=1)" & X(!"(p4156!=1)" W "(((p2483==1)&&(p2491==1))&&(p2518==1))"))
Detected timeout of ITS tools.
[2024-05-29 02:43:59] [INFO ] Flatten gal took : 78 ms
[2024-05-29 02:43:59] [INFO ] Applying decomposition
[2024-05-29 02:43:59] [INFO ] Flatten gal took : 77 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/graph1427593733529715565.txt' '-o' '/tmp/graph1427593733529715565.bin' '-w' '/tmp/graph1427593733529715565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1427593733529715565.bin' '-l' '-1' '-v' '-w' '/tmp/graph1427593733529715565.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:43:59] [INFO ] Decomposing Gal with order
[2024-05-29 02:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:43:59] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:43:59] [INFO ] Flatten gal took : 116 ms
[2024-05-29 02:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 20 ms.
[2024-05-29 02:43:59] [INFO ] Time to serialize gal into /tmp/LTL140642963823957130.gal : 21 ms
[2024-05-29 02:43:59] [INFO ] Time to serialize properties into /tmp/LTL5802931870035917858.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/LTL140642963823957130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5802931870035917858.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 : !((G(F(X(G(F(X(G((X(!("(((i18.i1.i1.u364.p2483==1)&&(i18.i1.i1.u366.p2491==1))&&(i18.i1.i1.u369.p2518==1))")))U("(i31.u620.p4156!=1)")...164
Formula 0 simplified : GF(!"(i31.u620.p4156!=1)" & X(!"(i31.u620.p4156!=1)" W "(((i18.i1.i1.u364.p2483==1)&&(i18.i1.i1.u366.p2491==1))&&(i18.i1.i1.u369.p25...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17739440214340079156
[2024-05-29 02:44:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17739440214340079156
Running compilation step : cd /tmp/ltsmin17739440214340079156;'/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/ltsmin17739440214340079156;'/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/ltsmin17739440214340079156;'/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 ShieldIIPs-PT-100B-LTLFireability-13 finished in 142113 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)||(p0&&F(G(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2024-05-29 02:44:18] [INFO ] Flatten gal took : 145 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17275665904900979937
[2024-05-29 02:44:18] [INFO ] Too many transitions (5215) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:44:18] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17275665904900979937
Running compilation step : cd /tmp/ltsmin17275665904900979937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '90' '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 02:44:18] [INFO ] Applying decomposition
[2024-05-29 02:44:18] [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/graph15424228590150102932.txt' '-o' '/tmp/graph15424228590150102932.bin' '-w' '/tmp/graph15424228590150102932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15424228590150102932.bin' '-l' '-1' '-v' '-w' '/tmp/graph15424228590150102932.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:44:18] [INFO ] Decomposing Gal with order
[2024-05-29 02:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:44:20] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:44:20] [INFO ] Flatten gal took : 199 ms
[2024-05-29 02:44:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-29 02:44:20] [INFO ] Time to serialize gal into /tmp/LTLFireability1535845233488652375.gal : 40 ms
[2024-05-29 02:44:20] [INFO ] Time to serialize properties into /tmp/LTLFireability10286818228309110726.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/LTLFireability1535845233488652375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10286818228309110726.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...277
Read 8 LTL properties
Checking formula 0 : !((F(("((i45.u1443.p4306==0)||(i45.u1449.p4323==0))")&&(X("(i51.u1606.p4798==1)")))))
Formula 0 simplified : G(!"((i45.u1443.p4306==0)||(i45.u1449.p4323==0))" | X!"(i51.u1606.p4798==1)")
Compilation finished in 19442 ms.
Running link step : cd /tmp/ltsmin17275665904900979937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin17275665904900979937;'/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' '<>(((LTLAPp0==true)&&X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin17275665904900979937;'/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' '<>(((LTLAPp0==true)&&X((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17275665904900979937;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin17275665904900979937;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17275665904900979937;'/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([]((LTLAPp3==true))))||<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin17275665904900979937;'/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([]((LTLAPp3==true))))||<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17275665904900979937;'/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' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 03:13:30] [INFO ] Applying decomposition
[2024-05-29 03:13:30] [INFO ] Flatten gal took : 328 ms
[2024-05-29 03:13:30] [INFO ] Decomposing Gal with order
[2024-05-29 03:13:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:13:37] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 03:13:37] [INFO ] Flatten gal took : 528 ms
[2024-05-29 03:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 286 ms.
[2024-05-29 03:13:41] [INFO ] Time to serialize gal into /tmp/LTLFireability8872993635627450547.gal : 249 ms
[2024-05-29 03:13:41] [INFO ] Time to serialize properties into /tmp/LTLFireability13068855362323992306.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/LTLFireability8872993635627450547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13068855362323992306.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...277
Read 8 LTL properties
Checking formula 0 : !((F(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1317.p4306==0)||...367
Formula 0 simplified : G(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1317.p4306==0)||(...361
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin17275665904900979937;'/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' '[](<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17275665904900979937;'/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' '[](<>((((LTLAPp6==true) U ([]((LTLAPp6==true))||((LTLAPp6==true)&&[]((LTLAPp7==true)))))||(<>((LTLAPp8==true))&&<>((LTLAPp9==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11823076 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16027036 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="ShieldIIPs-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 ShieldIIPs-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-171683788500108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-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 '
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 ;