About the Execution of ITS-Tools for CANInsertWithFailure-PT-060
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16187.623 | 3600000.00 | 11242495.00 | 3405.60 | FFT?FFFFFT?FFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690800747.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-060, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800747
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678379059985
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 16:24:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 16:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:24:22] [INFO ] Load time of PNML (sax parser for PT used): 521 ms
[2023-03-09 16:24:22] [INFO ] Transformed 7924 places.
[2023-03-09 16:24:22] [INFO ] Transformed 21960 transitions.
[2023-03-09 16:24:22] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 672 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 7924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7923 transition count 21960
Applied a total of 1 rules in 1591 ms. Remains 7923 /7924 variables (removed 1) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:24:26] [INFO ] Computed 62 place invariants in 2228 ms
[2023-03-09 16:24:28] [INFO ] Implicit Places using invariants in 3923 ms returned []
Implicit Place search using SMT only with invariants took 3950 ms to find 0 implicit places.
[2023-03-09 16:24:28] [INFO ] Invariant cache hit.
[2023-03-09 16:24:28] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7923/7924 places, 21960/21960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6187 ms. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 44 out of 7923 places after structural reductions.
[2023-03-09 16:24:29] [INFO ] Flatten gal took : 757 ms
[2023-03-09 16:24:30] [INFO ] Flatten gal took : 580 ms
[2023-03-09 16:24:31] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 705 ms. (steps per millisecond=14 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
[2023-03-09 16:24:32] [INFO ] Invariant cache hit.
[2023-03-09 16:24:35] [INFO ] After 2703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 16:24:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 82 ms returned sat
[2023-03-09 16:24:38] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 150 ms returned sat
[2023-03-09 16:25:00] [INFO ] After 19483ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-09 16:25:00] [INFO ] State equation strengthened by 7140 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 16:25:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:25:00] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 36 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 7923 transition count 21544
Reduce places removed 416 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 417 rules applied. Total rules applied 833 place count 7507 transition count 21543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 834 place count 7506 transition count 21542
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 3523 Post agglomeration using F-continuation condition.Transition count delta: 3523
Deduced a syphon composed of 3523 places in 11 ms
Reduce places removed 3523 places and 0 transitions.
Iterating global reduction 3 with 7046 rules applied. Total rules applied 7882 place count 3982 transition count 18019
Drop transitions removed 3406 transitions
Redundant transition composition rules discarded 3406 transitions
Iterating global reduction 3 with 3406 rules applied. Total rules applied 11288 place count 3982 transition count 14613
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11290 place count 3982 transition count 14611
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11292 place count 3980 transition count 14611
Partial Free-agglomeration rule applied 3644 times.
Drop transitions removed 3644 transitions
Iterating global reduction 4 with 3644 rules applied. Total rules applied 14936 place count 3980 transition count 14611
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 14996 place count 3980 transition count 14611
Applied a total of 14996 rules in 8018 ms. Remains 3980 /7923 variables (removed 3943) and now considering 14611/21960 (removed 7349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8027 ms. Remains : 3980/7923 places, 14611/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 22) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 14611 rows 3980 cols
[2023-03-09 16:25:10] [INFO ] Computed 62 place invariants in 699 ms
[2023-03-09 16:25:11] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 16:25:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 49 ms returned sat
[2023-03-09 16:25:12] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 86 ms returned sat
[2023-03-09 16:25:24] [INFO ] After 10507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 16:25:24] [INFO ] State equation strengthened by 14303 read => feed constraints.
[2023-03-09 16:25:36] [INFO ] After 11829ms SMT Verify possible using 14303 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 16:25:36] [INFO ] After 11832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 16:25:36] [INFO ] After 25121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 1 properties in 459 ms.
Support contains 25 out of 3980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3980/3980 places, 14611/14611 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 3973 transition count 14604
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3973 transition count 14604
Applied a total of 18 rules in 2593 ms. Remains 3973 /3980 variables (removed 7) and now considering 14604/14611 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2593 ms. Remains : 3973/3980 places, 14604/14611 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 14604 rows 3973 cols
[2023-03-09 16:25:40] [INFO ] Computed 62 place invariants in 496 ms
[2023-03-09 16:25:42] [INFO ] [Real]Absence check using 60 positive place invariants in 155 ms returned sat
[2023-03-09 16:25:42] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 59 ms returned sat
[2023-03-09 16:25:42] [INFO ] After 1447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 16:25:43] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2023-03-09 16:25:43] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 57 ms returned sat
[2023-03-09 16:25:53] [INFO ] After 9201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 16:25:53] [INFO ] State equation strengthened by 14378 read => feed constraints.
[2023-03-09 16:26:06] [INFO ] After 12468ms SMT Verify possible using 14378 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-09 16:26:07] [INFO ] After 13875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 16:26:07] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 260 ms.
Support contains 19 out of 3973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3973/3973 places, 14604/14604 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3971 transition count 14602
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3971 transition count 14602
Applied a total of 8 rules in 2345 ms. Remains 3971 /3973 variables (removed 2) and now considering 14602/14604 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2345 ms. Remains : 3971/3973 places, 14602/14604 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 59281 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59281 steps, saw 30641 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14602 rows 3971 cols
[2023-03-09 16:26:14] [INFO ] Computed 62 place invariants in 616 ms
[2023-03-09 16:26:15] [INFO ] [Real]Absence check using 60 positive place invariants in 53 ms returned sat
[2023-03-09 16:26:15] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 63 ms returned sat
[2023-03-09 16:26:15] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 16:26:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2023-03-09 16:26:16] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-09 16:26:26] [INFO ] After 9397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 16:26:26] [INFO ] State equation strengthened by 14386 read => feed constraints.
[2023-03-09 16:26:40] [INFO ] After 13507ms SMT Verify possible using 14386 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-09 16:26:40] [INFO ] After 13820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 16:26:40] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 1 properties in 273 ms.
Support contains 15 out of 3971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3971/3971 places, 14602/14602 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3969 transition count 14600
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 3969 transition count 14599
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 3969 transition count 14599
Applied a total of 7 rules in 3474 ms. Remains 3969 /3971 variables (removed 2) and now considering 14599/14602 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3474 ms. Remains : 3969/3971 places, 14599/14602 transitions.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 242 stabilizing places and 420 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1236 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:26:48] [INFO ] Computed 62 place invariants in 2642 ms
[2023-03-09 16:26:49] [INFO ] Implicit Places using invariants in 3611 ms returned []
Implicit Place search using SMT only with invariants took 3613 ms to find 0 implicit places.
[2023-03-09 16:26:49] [INFO ] Invariant cache hit.
[2023-03-09 16:26:50] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5909 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s6628), p0:(LEQ s5665 s3225), p2:(GT 2 s3418), p1:(GT 2 s7503)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 68 reset in 2016 ms.
Product exploration explored 100000 steps with 67 reset in 1818 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 863 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:26:56] [INFO ] Invariant cache hit.
[2023-03-09 16:26:58] [INFO ] [Real]Absence check using 60 positive place invariants in 117 ms returned sat
[2023-03-09 16:26:58] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 147 ms returned sat
[2023-03-09 16:27:15] [INFO ] After 16792ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 16:27:15] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 16:27:21] [INFO ] After 6331ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:27:21] [INFO ] After 25107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:27:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2023-03-09 16:27:23] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 149 ms returned sat
[2023-03-09 16:27:46] [INFO ] After 22718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 16:27:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:27:46] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 10 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 6089 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6091 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 60009 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 60009 steps, saw 30388 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-09 16:27:57] [INFO ] Computed 62 place invariants in 524 ms
[2023-03-09 16:27:58] [INFO ] [Real]Absence check using 60 positive place invariants in 55 ms returned sat
[2023-03-09 16:27:58] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-09 16:28:04] [INFO ] After 7199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:28:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-09 16:28:05] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-09 16:28:13] [INFO ] After 7731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:28:13] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-09 16:28:20] [INFO ] After 7127ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:28:28] [INFO ] After 14395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1410 ms.
[2023-03-09 16:28:29] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 115 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1022 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1022 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1074 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-09 16:28:31] [INFO ] Invariant cache hit.
[2023-03-09 16:28:37] [INFO ] Implicit Places using invariants in 5880 ms returned []
Implicit Place search using SMT only with invariants took 5882 ms to find 0 implicit places.
[2023-03-09 16:28:37] [INFO ] Invariant cache hit.
[2023-03-09 16:28:43] [INFO ] Dead Transitions using invariants and state equation in 5726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12693 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 821 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:28:47] [INFO ] Computed 62 place invariants in 2275 ms
Could not prove EG (NOT p3)
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1128 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:29:03] [INFO ] Invariant cache hit.
[2023-03-09 16:29:04] [INFO ] Implicit Places using invariants in 783 ms returned []
Implicit Place search using SMT only with invariants took 785 ms to find 0 implicit places.
[2023-03-09 16:29:04] [INFO ] Invariant cache hit.
[2023-03-09 16:29:04] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2784 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (AND p0 (NOT p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1157 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 79607 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 79607 steps, saw 76725 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :2
Running SMT prover for 6 properties.
[2023-03-09 16:29:10] [INFO ] Invariant cache hit.
[2023-03-09 16:29:11] [INFO ] [Real]Absence check using 60 positive place invariants in 119 ms returned sat
[2023-03-09 16:29:12] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 154 ms returned sat
[2023-03-09 16:29:28] [INFO ] After 16237ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-09 16:29:28] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 16:29:35] [INFO ] After 6756ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-09 16:29:35] [INFO ] After 6758ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 16:29:35] [INFO ] After 25183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-09 16:29:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 116 ms returned sat
[2023-03-09 16:29:37] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 150 ms returned sat
[2023-03-09 16:30:00] [INFO ] After 21642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 16:30:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:30:00] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:4
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 8 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11338 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 14996 place count 3964 transition count 14581
Applied a total of 14996 rules in 5964 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14581/21960 (removed 7379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5965 ms. Remains : 3964/7923 places, 14581/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 57227 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57227 steps, saw 30003 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-09 16:30:10] [INFO ] Computed 62 place invariants in 696 ms
[2023-03-09 16:30:11] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2023-03-09 16:30:11] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 93 ms returned sat
[2023-03-09 16:30:17] [INFO ] After 7154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:30:18] [INFO ] [Nat]Absence check using 60 positive place invariants in 44 ms returned sat
[2023-03-09 16:30:18] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 94 ms returned sat
[2023-03-09 16:30:27] [INFO ] After 7766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:30:27] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-09 16:30:33] [INFO ] After 6362ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:30:40] [INFO ] After 13422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2425 ms.
[2023-03-09 16:30:43] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 97 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1033 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1225 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-09 16:30:45] [INFO ] Invariant cache hit.
[2023-03-09 16:30:48] [INFO ] Implicit Places using invariants in 2929 ms returned []
Implicit Place search using SMT only with invariants took 2932 ms to find 0 implicit places.
[2023-03-09 16:30:48] [INFO ] Invariant cache hit.
[2023-03-09 16:30:54] [INFO ] Dead Transitions using invariants and state equation in 6323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10486 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (AND p0 (NOT p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 824 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:30:58] [INFO ] Computed 62 place invariants in 2337 ms
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 207 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 68 reset in 1894 ms.
Product exploration explored 100000 steps with 67 reset in 1798 ms.
Built C files in :
/tmp/ltsmin1842308318954355843
[2023-03-09 16:31:17] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1842308318954355843
Running compilation step : cd /tmp/ltsmin1842308318954355843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1842308318954355843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1842308318954355843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1363 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:31:22] [INFO ] Invariant cache hit.
[2023-03-09 16:31:22] [INFO ] Implicit Places using invariants in 812 ms returned []
Implicit Place search using SMT only with invariants took 815 ms to find 0 implicit places.
[2023-03-09 16:31:22] [INFO ] Invariant cache hit.
[2023-03-09 16:31:23] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2995 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Built C files in :
/tmp/ltsmin14364911419051980100
[2023-03-09 16:31:24] [INFO ] Built C files in 224ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14364911419051980100
Running compilation step : cd /tmp/ltsmin14364911419051980100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14364911419051980100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14364911419051980100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:31:28] [INFO ] Flatten gal took : 483 ms
[2023-03-09 16:31:28] [INFO ] Flatten gal took : 532 ms
[2023-03-09 16:31:28] [INFO ] Time to serialize gal into /tmp/LTL6891928090484910738.gal : 116 ms
[2023-03-09 16:31:28] [INFO ] Time to serialize properties into /tmp/LTL10409453390543444805.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6891928090484910738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10872783181754684612.hoa' '-atoms' '/tmp/LTL10409453390543444805.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10409453390543444805.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10872783181754684612.hoa
Detected timeout of ITS tools.
[2023-03-09 16:31:44] [INFO ] Flatten gal took : 521 ms
[2023-03-09 16:31:45] [INFO ] Flatten gal took : 436 ms
[2023-03-09 16:31:45] [INFO ] Time to serialize gal into /tmp/LTL11347622701309420289.gal : 73 ms
[2023-03-09 16:31:45] [INFO ] Time to serialize properties into /tmp/LTL5256102332663349600.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11347622701309420289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5256102332663349600.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(Node40requestsent52<=Node20requestsent11)")&&(G(F((G("(Node21GiveAnswer49<2)"))||(("(Node56requestsent26<2)")&&(X("(Node21GiveA...202
Formula 0 simplified : (!"(Node40requestsent52<=Node20requestsent11)" | G(F!"(Node21GiveAnswer49<2)" & FG(!"(Node56requestsent26<2)" | X!"(Node21GiveAnswer...192
Detected timeout of ITS tools.
[2023-03-09 16:32:00] [INFO ] Flatten gal took : 477 ms
[2023-03-09 16:32:00] [INFO ] Applying decomposition
[2023-03-09 16:32:01] [INFO ] Flatten gal took : 609 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9154063157228150670.txt' '-o' '/tmp/graph9154063157228150670.bin' '-w' '/tmp/graph9154063157228150670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9154063157228150670.bin' '-l' '-1' '-v' '-w' '/tmp/graph9154063157228150670.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:32:02] [INFO ] Decomposing Gal with order
[2023-03-09 16:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:32:05] [INFO ] Removed a total of 10826 redundant transitions.
[2023-03-09 16:32:05] [INFO ] Flatten gal took : 1758 ms
[2023-03-09 16:32:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6994 labels/synchronizations in 1174 ms.
[2023-03-09 16:32:08] [INFO ] Time to serialize gal into /tmp/LTL11329616144525245197.gal : 106 ms
[2023-03-09 16:32:08] [INFO ] Time to serialize properties into /tmp/LTL13229465449429507906.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11329616144525245197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13229465449429507906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(gu240.Node40requestsent52<=gu240.Node20requestsent11)")&&(G(F((G("(gi0.gi1.gi19.gu198.Node21GiveAnswer49<2)"))||(("(gi0.gi1.gi1...288
Formula 0 simplified : (!"(gu240.Node40requestsent52<=gu240.Node20requestsent11)" | G(F!"(gi0.gi1.gi19.gu198.Node21GiveAnswer49<2)" & FG(!"(gi0.gi1.gi19.gu...278
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11820663880336938317
[2023-03-09 16:32:24] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820663880336938317
Running compilation step : cd /tmp/ltsmin11820663880336938317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11820663880336938317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11820663880336938317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 342446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1504 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:32:28] [INFO ] Invariant cache hit.
[2023-03-09 16:32:29] [INFO ] Implicit Places using invariants in 935 ms returned []
Implicit Place search using SMT only with invariants took 938 ms to find 0 implicit places.
[2023-03-09 16:32:29] [INFO ] Invariant cache hit.
[2023-03-09 16:32:30] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3241 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4446 s654)], 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 9248 steps with 5 reset in 209 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-04 finished in 3715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&(X(p1) U ((p0&&X(p1))||X(G(p1)))))))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1122 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:32:32] [INFO ] Invariant cache hit.
[2023-03-09 16:32:33] [INFO ] Implicit Places using invariants in 998 ms returned []
Implicit Place search using SMT only with invariants took 1000 ms to find 0 implicit places.
[2023-03-09 16:32:33] [INFO ] Invariant cache hit.
[2023-03-09 16:32:33] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2972 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(GT s2431 s2340), p1:(LEQ 3 s6099)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1192 steps with 0 reset in 34 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-06 finished in 3385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1299 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:32:35] [INFO ] Invariant cache hit.
[2023-03-09 16:32:39] [INFO ] Implicit Places using invariants in 4072 ms returned []
Implicit Place search using SMT only with invariants took 4075 ms to find 0 implicit places.
[2023-03-09 16:32:39] [INFO ] Invariant cache hit.
[2023-03-09 16:32:40] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6241 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (LEQ 2 s2721) (LEQ s7360 s1693))], 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]]
Stuttering criterion allowed to conclude after 1603 steps with 0 reset in 43 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-08 finished in 6550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1164 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:32:42] [INFO ] Invariant cache hit.
[2023-03-09 16:32:42] [INFO ] Implicit Places using invariants in 894 ms returned []
Implicit Place search using SMT only with invariants took 896 ms to find 0 implicit places.
[2023-03-09 16:32:42] [INFO ] Invariant cache hit.
[2023-03-09 16:32:43] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2882 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 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:(LEQ s1841 s4069), p0:(LEQ 1 s5539)], 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 67 reset in 1939 ms.
Product exploration explored 100000 steps with 68 reset in 1859 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 16:32:48] [INFO ] Invariant cache hit.
[2023-03-09 16:32:49] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:32:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 119 ms returned sat
[2023-03-09 16:32:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 155 ms returned sat
[2023-03-09 16:33:06] [INFO ] After 16156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:33:06] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-09 16:33:14] [INFO ] After 7538ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-09 16:33:14] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 10 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11343 place count 3963 transition count 14577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11344 place count 3962 transition count 14577
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 3 with 3658 rules applied. Total rules applied 15002 place count 3962 transition count 14577
Applied a total of 15002 rules in 5628 ms. Remains 3962 /7923 variables (removed 3961) and now considering 14577/21960 (removed 7383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5629 ms. Remains : 3962/7923 places, 14577/21960 transitions.
Finished random walk after 4000 steps, including 14 resets, run visited all 1 properties in 74 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1328 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:33:21] [INFO ] Invariant cache hit.
[2023-03-09 16:33:22] [INFO ] Implicit Places using invariants in 796 ms returned []
Implicit Place search using SMT only with invariants took 798 ms to find 0 implicit places.
[2023-03-09 16:33:22] [INFO ] Invariant cache hit.
[2023-03-09 16:33:23] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2992 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 338 ms. (steps per millisecond=29 ) 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
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
Finished probabilistic random walk after 76182 steps, run visited all 2 properties in 1685 ms. (steps per millisecond=45 )
Probabilistic random walk after 76182 steps, saw 73910 distinct states, run finished after 1686 ms. (steps per millisecond=45 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 69 reset in 1875 ms.
Product exploration explored 100000 steps with 70 reset in 1821 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 7923 transition count 21960
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 300 place count 7923 transition count 21960
Deduced a syphon composed of 360 places in 9 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 360 place count 7923 transition count 21960
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 480 place count 7803 transition count 21840
Deduced a syphon composed of 240 places in 7 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 600 place count 7803 transition count 21840
Performed 3600 Post agglomeration using F-continuation condition.Transition count delta: -6960
Deduced a syphon composed of 3840 places in 10 ms
Iterating global reduction 1 with 3600 rules applied. Total rules applied 4200 place count 7803 transition count 28800
Discarding 240 places :
Symmetric choice reduction at 1 with 240 rule applications. Total rules 4440 place count 7563 transition count 28560
Deduced a syphon composed of 3600 places in 6 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 4680 place count 7563 transition count 28560
Deduced a syphon composed of 3600 places in 5 ms
Applied a total of 4680 rules in 7636 ms. Remains 7563 /7923 variables (removed 360) and now considering 28560/21960 (removed -6600) transitions.
[2023-03-09 16:33:38] [INFO ] Flow matrix only has 25138 transitions (discarded 3422 similar events)
// Phase 1: matrix 25138 rows 7563 cols
[2023-03-09 16:33:41] [INFO ] Computed 62 place invariants in 2980 ms
[2023-03-09 16:33:57] [INFO ] Dead Transitions using invariants and state equation in 19097 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7563/7923 places, 28560/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26738 ms. Remains : 7563/7923 places, 28560/21960 transitions.
Built C files in :
/tmp/ltsmin8583870704447631989
[2023-03-09 16:33:57] [INFO ] Built C files in 211ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8583870704447631989
Running compilation step : cd /tmp/ltsmin8583870704447631989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8583870704447631989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8583870704447631989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1625 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:34:04] [INFO ] Computed 62 place invariants in 2249 ms
[2023-03-09 16:34:06] [INFO ] Implicit Places using invariants in 3655 ms returned []
Implicit Place search using SMT only with invariants took 3656 ms to find 0 implicit places.
[2023-03-09 16:34:06] [INFO ] Invariant cache hit.
[2023-03-09 16:34:06] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6087 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Built C files in :
/tmp/ltsmin447241285169121063
[2023-03-09 16:34:07] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin447241285169121063
Running compilation step : cd /tmp/ltsmin447241285169121063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin447241285169121063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin447241285169121063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:34:11] [INFO ] Flatten gal took : 901 ms
[2023-03-09 16:34:12] [INFO ] Flatten gal took : 615 ms
[2023-03-09 16:34:12] [INFO ] Time to serialize gal into /tmp/LTL2941896768771773221.gal : 90 ms
[2023-03-09 16:34:12] [INFO ] Time to serialize properties into /tmp/LTL13823111667165854476.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2941896768771773221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14011519457640205486.hoa' '-atoms' '/tmp/LTL13823111667165854476.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13823111667165854476.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14011519457640205486.hoa
Detected timeout of ITS tools.
[2023-03-09 16:34:27] [INFO ] Flatten gal took : 383 ms
[2023-03-09 16:34:28] [INFO ] Flatten gal took : 448 ms
[2023-03-09 16:34:28] [INFO ] Time to serialize gal into /tmp/LTL14736060553785874499.gal : 73 ms
[2023-03-09 16:34:28] [INFO ] Time to serialize properties into /tmp/LTL17808876512412907217.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14736060553785874499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17808876512412907217.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node39requestsent48>=1)")||(G("(Node8requestsent28<=Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(Node39requestsent48>=1)" & F!"(Node8requestsent28<=Node27requestsent20)")
Detected timeout of ITS tools.
[2023-03-09 16:34:43] [INFO ] Flatten gal took : 587 ms
[2023-03-09 16:34:43] [INFO ] Applying decomposition
[2023-03-09 16:34:44] [INFO ] Flatten gal took : 451 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16506347153504157146.txt' '-o' '/tmp/graph16506347153504157146.bin' '-w' '/tmp/graph16506347153504157146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16506347153504157146.bin' '-l' '-1' '-v' '-w' '/tmp/graph16506347153504157146.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:34:45] [INFO ] Decomposing Gal with order
[2023-03-09 16:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:34:47] [INFO ] Removed a total of 10836 redundant transitions.
[2023-03-09 16:34:47] [INFO ] Flatten gal took : 1196 ms
[2023-03-09 16:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 6956 labels/synchronizations in 854 ms.
[2023-03-09 16:34:50] [INFO ] Time to serialize gal into /tmp/LTL10762151966049023935.gal : 88 ms
[2023-03-09 16:34:50] [INFO ] Time to serialize properties into /tmp/LTL11189297468304909850.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10762151966049023935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11189297468304909850.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi0.gi0.gi59.gu158.Node39requestsent48>=1)")||(G("(gu240.Node8requestsent28<=gu240.Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(gi0.gi0.gi59.gu158.Node39requestsent48>=1)" & F!"(gu240.Node8requestsent28<=gu240.Node27requestsent20)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6026219152533269170
[2023-03-09 16:35:05] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6026219152533269170
Running compilation step : cd /tmp/ltsmin6026219152533269170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6026219152533269170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6026219152533269170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 147723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 6 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1265 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:35:09] [INFO ] Invariant cache hit.
[2023-03-09 16:35:10] [INFO ] Implicit Places using invariants in 925 ms returned []
Implicit Place search using SMT only with invariants took 930 ms to find 0 implicit places.
[2023-03-09 16:35:10] [INFO ] Invariant cache hit.
[2023-03-09 16:35:11] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3175 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 2 s2690), p0:(LEQ s5391 s707), p2:(AND (OR (LEQ 2 s2690) (LEQ s1310 s975)) (LEQ 2 s1549))], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1308 steps with 0 reset in 29 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-11 finished in 3532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1364 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:35:13] [INFO ] Invariant cache hit.
[2023-03-09 16:35:14] [INFO ] Implicit Places using invariants in 905 ms returned []
Implicit Place search using SMT only with invariants took 906 ms to find 0 implicit places.
[2023-03-09 16:35:14] [INFO ] Invariant cache hit.
[2023-03-09 16:35:15] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3214 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s981)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-12 finished in 3427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||((p1&&F(p2)) U G(p0))))))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1366 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2023-03-09 16:35:16] [INFO ] Invariant cache hit.
[2023-03-09 16:35:17] [INFO ] Implicit Places using invariants in 1060 ms returned []
Implicit Place search using SMT only with invariants took 1062 ms to find 0 implicit places.
[2023-03-09 16:35:18] [INFO ] Invariant cache hit.
[2023-03-09 16:35:19] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3453 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s6855)], 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][false, false]]
Stuttering criterion allowed to conclude after 1486 steps with 0 reset in 47 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-13 finished in 3691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3537 Post agglomeration using F-continuation condition.Transition count delta: 3537
Deduced a syphon composed of 3537 places in 9 ms
Reduce places removed 3537 places and 0 transitions.
Iterating global reduction 2 with 7074 rules applied. Total rules applied 7912 place count 3967 transition count 18004
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11332 place count 3967 transition count 14584
Applied a total of 11332 rules in 4966 ms. Remains 3967 /7923 variables (removed 3956) and now considering 14584/21960 (removed 7376) transitions.
// Phase 1: matrix 14584 rows 3967 cols
[2023-03-09 16:35:25] [INFO ] Computed 62 place invariants in 1088 ms
[2023-03-09 16:35:26] [INFO ] Implicit Places using invariants in 2187 ms returned []
Implicit Place search using SMT only with invariants took 2189 ms to find 0 implicit places.
[2023-03-09 16:35:26] [INFO ] Invariant cache hit.
[2023-03-09 16:35:34] [INFO ] Dead Transitions using invariants and state equation in 8091 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3967/7923 places, 14584/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15246 ms. Remains : 3967/7923 places, 14584/21960 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2495 s2847), p0:(LEQ s342 s1812)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 325 reset in 1643 ms.
Stack based approach found an accepted trace after 11041 steps with 35 reset with depth 233 and stack size 233 in 187 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-14 finished in 17204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&(p1||X(G(p1))))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1401 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2023-03-09 16:35:40] [INFO ] Computed 62 place invariants in 2230 ms
[2023-03-09 16:35:40] [INFO ] Implicit Places using invariants in 3137 ms returned []
Implicit Place search using SMT only with invariants took 3147 ms to find 0 implicit places.
[2023-03-09 16:35:41] [INFO ] Invariant cache hit.
[2023-03-09 16:35:42] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5565 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s1356 s4806), p1:(LEQ 1 s3897)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-060-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-15 finished in 5972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(F(((p1&&X(p2))||G(p2))))) U p3))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-03
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 13 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 4437 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2023-03-09 16:35:48] [INFO ] Computed 62 place invariants in 1095 ms
[2023-03-09 16:35:49] [INFO ] Implicit Places using invariants in 2187 ms returned []
Implicit Place search using SMT only with invariants took 2188 ms to find 0 implicit places.
[2023-03-09 16:35:49] [INFO ] Invariant cache hit.
[2023-03-09 16:35:56] [INFO ] Dead Transitions using invariants and state equation in 7464 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14090 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s3306), p0:(LEQ s2815 s1574), p2:(GT 2 s1672), p1:(GT 2 s3751)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 329 reset in 1841 ms.
Product exploration explored 100000 steps with 330 reset in 1878 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1282 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 16:36:02] [INFO ] Invariant cache hit.
[2023-03-09 16:36:03] [INFO ] [Real]Absence check using 60 positive place invariants in 31 ms returned sat
[2023-03-09 16:36:03] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-09 16:36:09] [INFO ] After 6048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:36:09] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2023-03-09 16:36:09] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 84 ms returned sat
[2023-03-09 16:36:16] [INFO ] After 6508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:36:16] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2023-03-09 16:36:28] [INFO ] After 11181ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:36:33] [INFO ] After 17019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-09 16:36:34] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 107 ms.
Support contains 5 out of 3965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3965 transition count 14581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3964 transition count 14581
Partial Free-agglomeration rule applied 3658 times.
Drop transitions removed 3658 transitions
Iterating global reduction 1 with 3658 rules applied. Total rules applied 3660 place count 3964 transition count 14581
Applied a total of 3660 rules in 3473 ms. Remains 3964 /3965 variables (removed 1) and now considering 14581/14582 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3474 ms. Remains : 3964/3965 places, 14581/14582 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 55350 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55350 steps, saw 29719 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14581 rows 3964 cols
[2023-03-09 16:36:41] [INFO ] Computed 62 place invariants in 710 ms
[2023-03-09 16:36:42] [INFO ] [Real]Absence check using 60 positive place invariants in 69 ms returned sat
[2023-03-09 16:36:43] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 74 ms returned sat
[2023-03-09 16:36:49] [INFO ] After 7633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:36:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 67 ms returned sat
[2023-03-09 16:36:50] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 72 ms returned sat
[2023-03-09 16:36:59] [INFO ] After 8238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:36:59] [INFO ] State equation strengthened by 14393 read => feed constraints.
[2023-03-09 16:37:06] [INFO ] After 7396ms SMT Verify possible using 14393 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 16:37:13] [INFO ] After 14566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 748 ms.
[2023-03-09 16:37:14] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 5 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1240 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1240 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14581/14581 transitions.
Applied a total of 0 rules in 1058 ms. Remains 3964 /3964 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2023-03-09 16:37:17] [INFO ] Invariant cache hit.
[2023-03-09 16:37:19] [INFO ] Implicit Places using invariants in 2818 ms returned []
Implicit Place search using SMT only with invariants took 2819 ms to find 0 implicit places.
[2023-03-09 16:37:19] [INFO ] Invariant cache hit.
[2023-03-09 16:37:27] [INFO ] Dead Transitions using invariants and state equation in 7772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11656 ms. Remains : 3964/3964 places, 14581/14581 transitions.
Graph (trivial) has 14202 edges and 3964 vertex of which 3716 / 3964 are part of one of the 2 SCC in 13 ms
Free SCC test removed 3714 places
Drop transitions removed 10668 transitions
Ensure Unique test removed 3652 transitions
Reduce isomorphic transitions removed 14320 transitions.
Graph (complete) has 623 edges and 250 vertex of which 69 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 59 output transitions
Drop transitions removed 59 transitions
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 69 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 68 transition count 80
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 183 place count 10 transition count 22
Iterating global reduction 2 with 58 rules applied. Total rules applied 241 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 8 transition count 17
Applied a total of 247 rules in 95 ms. Remains 8 /3964 variables (removed 3956) and now considering 17/14581 (removed 14564) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 8 cols
[2023-03-09 16:37:27] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-09 16:37:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 16:37:27] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 16:37:27] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 16:37:27] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 18 factoid took 1241 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 14582 rows 3965 cols
[2023-03-09 16:37:30] [INFO ] Computed 62 place invariants in 1114 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) p0 p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p2 p1)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p2 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 18 factoid took 440 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-03 finished in 116850 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLCardinality-10
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 13 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 4945 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2023-03-09 16:37:45] [INFO ] Computed 62 place invariants in 1114 ms
[2023-03-09 16:37:46] [INFO ] Implicit Places using invariants in 2313 ms returned []
Implicit Place search using SMT only with invariants took 2314 ms to find 0 implicit places.
[2023-03-09 16:37:46] [INFO ] Invariant cache hit.
[2023-03-09 16:37:54] [INFO ] Dead Transitions using invariants and state equation in 7414 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14676 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLCardinality-10 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:(LEQ s870 s2003), p0:(LEQ 1 s2750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 334 reset in 1644 ms.
Product exploration explored 100000 steps with 333 reset in 1661 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2265 steps, including 7 resets, run visited all 2 properties in 100 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 820 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-09 16:37:59] [INFO ] Invariant cache hit.
[2023-03-09 16:38:00] [INFO ] Implicit Places using invariants in 1004 ms returned []
Implicit Place search using SMT only with invariants took 1006 ms to find 0 implicit places.
[2023-03-09 16:38:00] [INFO ] Invariant cache hit.
[2023-03-09 16:38:06] [INFO ] Dead Transitions using invariants and state equation in 6409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8241 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 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
Interrupted probabilistic random walk after 61960 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61960 steps, saw 33636 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 16:38:10] [INFO ] Invariant cache hit.
[2023-03-09 16:38:10] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 16:38:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 41 ms returned sat
[2023-03-09 16:38:11] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 59 ms returned sat
[2023-03-09 16:38:17] [INFO ] After 5968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 16:38:17] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2023-03-09 16:38:23] [INFO ] After 6174ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 16:38:25] [INFO ] After 7658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1118 ms.
[2023-03-09 16:38:26] [INFO ] After 15630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 8 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 333 reset in 1959 ms.
Product exploration explored 100000 steps with 334 reset in 1715 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 1006 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-09 16:38:32] [INFO ] Invariant cache hit.
[2023-03-09 16:38:38] [INFO ] Dead Transitions using invariants and state equation in 6101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7109 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin8707385392188612599
[2023-03-09 16:38:38] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8707385392188612599
Running compilation step : cd /tmp/ltsmin8707385392188612599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8707385392188612599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8707385392188612599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 898 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2023-03-09 16:38:42] [INFO ] Invariant cache hit.
[2023-03-09 16:38:43] [INFO ] Implicit Places using invariants in 1139 ms returned []
Implicit Place search using SMT only with invariants took 1152 ms to find 0 implicit places.
[2023-03-09 16:38:43] [INFO ] Invariant cache hit.
[2023-03-09 16:38:51] [INFO ] Dead Transitions using invariants and state equation in 7841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9895 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin12607801969460909042
[2023-03-09 16:38:51] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12607801969460909042
Running compilation step : cd /tmp/ltsmin12607801969460909042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12607801969460909042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12607801969460909042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:38:55] [INFO ] Flatten gal took : 362 ms
[2023-03-09 16:38:55] [INFO ] Flatten gal took : 333 ms
[2023-03-09 16:38:55] [INFO ] Time to serialize gal into /tmp/LTL6077551790902438662.gal : 60 ms
[2023-03-09 16:38:55] [INFO ] Time to serialize properties into /tmp/LTL4811350477980882169.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6077551790902438662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17758512005187799891.hoa' '-atoms' '/tmp/LTL4811350477980882169.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4811350477980882169.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17758512005187799891.hoa
Detected timeout of ITS tools.
[2023-03-09 16:39:11] [INFO ] Flatten gal took : 363 ms
[2023-03-09 16:39:11] [INFO ] Flatten gal took : 360 ms
[2023-03-09 16:39:11] [INFO ] Time to serialize gal into /tmp/LTL11560486153694435499.gal : 59 ms
[2023-03-09 16:39:11] [INFO ] Time to serialize properties into /tmp/LTL12087901507002115938.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11560486153694435499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12087901507002115938.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node39requestsent48>=1)")||(G("(Node8requestsent28<=Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(Node39requestsent48>=1)" & F!"(Node8requestsent28<=Node27requestsent20)")
Detected timeout of ITS tools.
[2023-03-09 16:39:27] [INFO ] Flatten gal took : 394 ms
[2023-03-09 16:39:27] [INFO ] Applying decomposition
[2023-03-09 16:39:27] [INFO ] Flatten gal took : 388 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11966640969515172365.txt' '-o' '/tmp/graph11966640969515172365.bin' '-w' '/tmp/graph11966640969515172365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11966640969515172365.bin' '-l' '-1' '-v' '-w' '/tmp/graph11966640969515172365.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:39:28] [INFO ] Decomposing Gal with order
[2023-03-09 16:39:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:39:29] [INFO ] Removed a total of 10812 redundant transitions.
[2023-03-09 16:39:29] [INFO ] Flatten gal took : 1016 ms
[2023-03-09 16:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 1114 ms.
[2023-03-09 16:39:31] [INFO ] Time to serialize gal into /tmp/LTL15550531507279406768.gal : 48 ms
[2023-03-09 16:39:31] [INFO ] Time to serialize properties into /tmp/LTL2117707279726460658.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15550531507279406768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2117707279726460658.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi0.gu40.Node39requestsent48>=1)")||(G("(gu61.Node8requestsent28<=gu61.Node27requestsent20)"))))))
Formula 0 simplified : XG(!"(gi0.gu40.Node39requestsent48>=1)" & F!"(gu61.Node8requestsent28<=gu61.Node27requestsent20)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15516304327036546359
[2023-03-09 16:39:46] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15516304327036546359
Running compilation step : cd /tmp/ltsmin15516304327036546359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15516304327036546359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15516304327036546359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLCardinality-10 finished in 130473 ms.
[2023-03-09 16:39:50] [INFO ] Flatten gal took : 605 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16931937212441808934
[2023-03-09 16:39:50] [INFO ] Too many transitions (21960) to apply POR reductions. Disabling POR matrices.
[2023-03-09 16:39:50] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16931937212441808934
Running compilation step : cd /tmp/ltsmin16931937212441808934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 16:39:50] [INFO ] Applying decomposition
[2023-03-09 16:39:51] [INFO ] Flatten gal took : 481 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12348390557981569507.txt' '-o' '/tmp/graph12348390557981569507.bin' '-w' '/tmp/graph12348390557981569507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12348390557981569507.bin' '-l' '-1' '-v' '-w' '/tmp/graph12348390557981569507.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:39:52] [INFO ] Decomposing Gal with order
[2023-03-09 16:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:39:54] [INFO ] Removed a total of 10832 redundant transitions.
[2023-03-09 16:39:54] [INFO ] Flatten gal took : 1384 ms
[2023-03-09 16:39:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6952 labels/synchronizations in 830 ms.
[2023-03-09 16:39:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality15975708569982151122.gal : 88 ms
[2023-03-09 16:39:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality10036460556776430332.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15975708569982151122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10036460556776430332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !(((("(gu240.Node40requestsent52<=gu240.Node20requestsent11)")&&(G(F((("(gi0.gi7.gu226.Node56requestsent26<2)")&&(X("(gi0.gi7.gu198.No...268
Formula 0 simplified : (!"(gu240.Node40requestsent52<=gu240.Node20requestsent11)" | G(F!"(gi0.gi7.gu198.Node21GiveAnswer49<2)" & FG(!"(gi0.gi7.gu226.Node56...258
Compilation finished in 241663 ms.
Running link step : cd /tmp/ltsmin16931937212441808934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 165 ms.
Running LTSmin : cd /tmp/ltsmin16931937212441808934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&[](<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true)))))) U (LTLAPp3==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 17:05:10] [INFO ] Flatten gal took : 1655 ms
[2023-03-09 17:05:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality2390184386401595426.gal : 305 ms
[2023-03-09 17:05:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality4703675853346209967.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2390184386401595426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4703675853346209967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !(((("(Node40requestsent52<=Node20requestsent11)")&&(G(F((("(Node56requestsent26<2)")&&(X("(Node21GiveAnswer49<2)")))||(G("(Node21Give...202
Formula 0 simplified : (!"(Node40requestsent52<=Node20requestsent11)" | G(F!"(Node21GiveAnswer49<2)" & FG(!"(Node56requestsent26<2)" | X!"(Node21GiveAnswer...192
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16931937212441808934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&[](<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true)))))) U (LTLAPp3==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16931937212441808934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp4==true)||[]((LTLAPp5==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6515156 kB
After kill :
MemTotal: 16393340 kB
MemFree: 14942264 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-060"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-060, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690800747"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;