About the Execution of 2023-gold for CANConstruction-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.228 | 3515056.00 | 4010914.00 | 41532.90 | FT?FFFFFTFF?FFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:42 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 CANConstruction-PT-100-LTLFireability-00
FORMULA_NAME CANConstruction-PT-100-LTLFireability-01
FORMULA_NAME CANConstruction-PT-100-LTLFireability-02
FORMULA_NAME CANConstruction-PT-100-LTLFireability-03
FORMULA_NAME CANConstruction-PT-100-LTLFireability-04
FORMULA_NAME CANConstruction-PT-100-LTLFireability-05
FORMULA_NAME CANConstruction-PT-100-LTLFireability-06
FORMULA_NAME CANConstruction-PT-100-LTLFireability-07
FORMULA_NAME CANConstruction-PT-100-LTLFireability-08
FORMULA_NAME CANConstruction-PT-100-LTLFireability-09
FORMULA_NAME CANConstruction-PT-100-LTLFireability-10
FORMULA_NAME CANConstruction-PT-100-LTLFireability-11
FORMULA_NAME CANConstruction-PT-100-LTLFireability-12
FORMULA_NAME CANConstruction-PT-100-LTLFireability-13
FORMULA_NAME CANConstruction-PT-100-LTLFireability-14
FORMULA_NAME CANConstruction-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716222970083
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 16:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 16:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:36:12] [INFO ] Load time of PNML (sax parser for PT used): 686 ms
[2024-05-20 16:36:12] [INFO ] Transformed 21202 places.
[2024-05-20 16:36:12] [INFO ] Transformed 40800 transitions.
[2024-05-20 16:36:12] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 904 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-100-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 278 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:36:13] [INFO ] Computed 201 invariants in 599 ms
[2024-05-20 16:36:15] [INFO ] Implicit Places using invariants in 2496 ms returned []
Implicit Place search using SMT only with invariants took 2520 ms to find 0 implicit places.
[2024-05-20 16:36:15] [INFO ] Invariant cache hit.
[2024-05-20 16:36:17] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4813 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 44 out of 21202 places after structural reductions.
[2024-05-20 16:36:19] [INFO ] Flatten gal took : 1285 ms
[2024-05-20 16:36:20] [INFO ] Flatten gal took : 973 ms
[2024-05-20 16:36:22] [INFO ] Input system was already deterministic with 40800 transitions.
Support contains 40 out of 21202 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 934 ms. (steps per millisecond=10 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :1
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 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2024-05-20 16:36:23] [INFO ] Invariant cache hit.
[2024-05-20 16:36:30] [INFO ] [Real]Absence check using 101 positive place invariants in 443 ms returned sat
[2024-05-20 16:36:31] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 182 ms returned sat
[2024-05-20 16:36:48] [INFO ] After 13072ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:14
[2024-05-20 16:36:48] [INFO ] State equation strengthened by 19900 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:36:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:36:48] [INFO ] After 25265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 28 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 685 rules applied. Total rules applied 685 place count 21202 transition count 40115
Reduce places removed 685 places and 0 transitions.
Iterating post reduction 1 with 685 rules applied. Total rules applied 1370 place count 20517 transition count 40115
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1370 place count 20517 transition count 40110
Deduced a syphon composed of 5 places in 15 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1380 place count 20512 transition count 40110
Performed 9987 Post agglomeration using F-continuation condition.Transition count delta: 9987
Deduced a syphon composed of 9987 places in 12 ms
Reduce places removed 9987 places and 0 transitions.
Iterating global reduction 2 with 19974 rules applied. Total rules applied 21354 place count 10525 transition count 30123
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21364 place count 10525 transition count 30113
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 21374 place count 10515 transition count 30113
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 21379 place count 10515 transition count 30113
Applied a total of 21379 rules in 6715 ms. Remains 10515 /21202 variables (removed 10687) and now considering 30113/40800 (removed 10687) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6718 ms. Remains : 10515/21202 places, 30113/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 17) seen :3
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 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 14) 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 14) 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 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 30 ms. (steps per millisecond=333 ) 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 36 ms. (steps per millisecond=277 ) 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 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 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 30113 rows 10515 cols
[2024-05-20 16:36:57] [INFO ] Computed 201 invariants in 232 ms
[2024-05-20 16:36:59] [INFO ] [Real]Absence check using 101 positive place invariants in 242 ms returned sat
[2024-05-20 16:36:59] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 124 ms returned sat
[2024-05-20 16:37:22] [INFO ] After 20349ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:1
[2024-05-20 16:37:22] [INFO ] State equation strengthened by 29892 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:37:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:37:22] [INFO ] After 25291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 10515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10515/10515 places, 30113/30113 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10513 transition count 30111
Applied a total of 4 rules in 277 ms. Remains 10513 /10515 variables (removed 2) and now considering 30111/30113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 10513/10515 places, 30111/30113 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 30111 rows 10513 cols
[2024-05-20 16:37:23] [INFO ] Computed 201 invariants in 213 ms
[2024-05-20 16:37:26] [INFO ] [Real]Absence check using 101 positive place invariants in 226 ms returned sat
[2024-05-20 16:37:26] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 129 ms returned sat
[2024-05-20 16:37:48] [INFO ] After 21331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:1
[2024-05-20 16:37:49] [INFO ] State equation strengthened by 29893 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:37:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:37:49] [INFO ] After 25341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 10513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10513/10513 places, 30111/30111 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10512 transition count 30110
Applied a total of 2 rules in 342 ms. Remains 10512 /10513 variables (removed 1) and now considering 30110/30111 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 10512/10513 places, 30110/30111 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 10) seen :4
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 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 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 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 30110 rows 10512 cols
[2024-05-20 16:37:50] [INFO ] Computed 201 invariants in 225 ms
[2024-05-20 16:37:52] [INFO ] [Real]Absence check using 101 positive place invariants in 253 ms returned sat
[2024-05-20 16:37:52] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 148 ms returned sat
[2024-05-20 16:38:15] [INFO ] After 22103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:5
[2024-05-20 16:38:15] [INFO ] State equation strengthened by 29894 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:38:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:38:15] [INFO ] After 25397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 10512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10512/10512 places, 30110/30110 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10509 transition count 30107
Applied a total of 6 rules in 294 ms. Remains 10509 /10512 variables (removed 3) and now considering 30107/30110 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 10509/10512 places, 30107/30110 transitions.
Computed a total of 401 stabilizing places and 500 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1396 place count 20504 transition count 40101
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 12 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 5025 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2024-05-20 16:38:21] [INFO ] Computed 201 invariants in 198 ms
[2024-05-20 16:38:22] [INFO ] Implicit Places using invariants in 1080 ms returned []
Implicit Place search using SMT only with invariants took 1085 ms to find 0 implicit places.
[2024-05-20 16:38:22] [INFO ] Invariant cache hit.
[2024-05-20 16:38:23] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10504/21202 places, 30102/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7015 ms. Remains : 10504/21202 places, 30102/40800 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s460 1) (GEQ s510 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2146 steps with 4 reset in 97 ms.
FORMULA CANConstruction-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 7352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1||X(F(p2))))))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 108 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:38:24] [INFO ] Computed 201 invariants in 473 ms
[2024-05-20 16:38:26] [INFO ] Implicit Places using invariants in 2163 ms returned []
Implicit Place search using SMT only with invariants took 2165 ms to find 0 implicit places.
[2024-05-20 16:38:26] [INFO ] Invariant cache hit.
[2024-05-20 16:38:28] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4196 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p2), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LT s7131 1), p0:(AND (GEQ s776 1) (GEQ s1299 1)), p1:(GEQ s20311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7923 ms.
Product exploration explored 100000 steps with 33333 reset in 7604 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 20257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 14 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 5382 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2024-05-20 16:38:49] [INFO ] Computed 201 invariants in 197 ms
[2024-05-20 16:38:50] [INFO ] Implicit Places using invariants in 1086 ms returned []
Implicit Place search using SMT only with invariants took 1087 ms to find 0 implicit places.
[2024-05-20 16:38:50] [INFO ] Invariant cache hit.
[2024-05-20 16:38:51] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10504/21202 places, 30102/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7368 ms. Remains : 10504/21202 places, 30102/40800 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6617 1) (AND (GEQ s484 1) (GEQ s9792 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 144 reset in 3392 ms.
Product exploration explored 100000 steps with 145 reset in 3471 ms.
Computed a total of 303 stabilizing places and 301 stable transitions
Computed a total of 303 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 83166 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83166 steps, saw 74874 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:39:02] [INFO ] Invariant cache hit.
[2024-05-20 16:39:03] [INFO ] [Real]Absence check using 101 positive place invariants in 245 ms returned sat
[2024-05-20 16:39:03] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 165 ms returned sat
[2024-05-20 16:39:27] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10504 transition count 30101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10503 transition count 30101
Applied a total of 2 rules in 395 ms. Remains 10503 /10504 variables (removed 1) and now considering 30101/30102 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 10503/10504 places, 30101/30102 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 83260 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83260 steps, saw 74885 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30101 rows 10503 cols
[2024-05-20 16:39:31] [INFO ] Computed 201 invariants in 195 ms
[2024-05-20 16:39:32] [INFO ] [Real]Absence check using 101 positive place invariants in 243 ms returned sat
[2024-05-20 16:39:32] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 150 ms returned sat
[2024-05-20 16:39:32] [INFO ] After 1538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:39:33] [INFO ] [Nat]Absence check using 101 positive place invariants in 260 ms returned sat
[2024-05-20 16:39:34] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 143 ms returned sat
[2024-05-20 16:39:57] [INFO ] After 23128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:39:57] [INFO ] State equation strengthened by 29899 read => feed constraints.
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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:39:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:39:57] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 10503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 172 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10503/10503 places, 30101/30101 transitions.
Applied a total of 0 rules in 194 ms. Remains 10503 /10503 variables (removed 0) and now considering 30101/30101 (removed 0) transitions.
[2024-05-20 16:39:58] [INFO ] Invariant cache hit.
[2024-05-20 16:39:59] [INFO ] Implicit Places using invariants in 916 ms returned []
Implicit Place search using SMT only with invariants took 917 ms to find 0 implicit places.
[2024-05-20 16:39:59] [INFO ] Invariant cache hit.
[2024-05-20 16:39:59] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2031 ms. Remains : 10503/10503 places, 30101/30101 transitions.
Graph (trivial) has 29795 edges and 10503 vertex of which 10098 / 10503 are part of one of the 100 SCC in 16 ms
Free SCC test removed 9998 places
Drop transitions removed 19896 transitions
Ensure Unique test removed 9798 transitions
Reduce isomorphic transitions removed 29694 transitions.
Graph (complete) has 1008 edges and 505 vertex of which 13 are kept as prefixes of interest. Removing 492 places using SCC suffix rule.1 ms
Discarding 492 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 103 rules applied. Total rules applied 105 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 10 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 10
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 9 transition count 10
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 7 transition count 8
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 7 transition count 8
Applied a total of 116 rules in 208 ms. Remains 7 /10503 variables (removed 10496) and now considering 8/30101 (removed 30093) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 7 cols
[2024-05-20 16:40:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 16:40:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 16:40:00] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 16:40:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 16:40:00] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 16:40:00] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 16:40:00] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 253 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2024-05-20 16:40:01] [INFO ] Computed 201 invariants in 228 ms
[2024-05-20 16:40:01] [INFO ] Implicit Places using invariants in 1148 ms returned []
Implicit Place search using SMT only with invariants took 1151 ms to find 0 implicit places.
[2024-05-20 16:40:01] [INFO ] Invariant cache hit.
[2024-05-20 16:40:02] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2324 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Computed a total of 303 stabilizing places and 301 stable transitions
Computed a total of 303 stabilizing places and 301 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9031 steps, including 12 resets, run visited all 1 properties in 305 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 144 reset in 3324 ms.
Product exploration explored 100000 steps with 146 reset in 3392 ms.
Built C files in :
/tmp/ltsmin9066730106646137405
[2024-05-20 16:40:10] [INFO ] Too many transitions (30102) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:40:10] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9066730106646137405
Running compilation step : cd /tmp/ltsmin9066730106646137405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9066730106646137405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9066730106646137405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 10504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 214 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2024-05-20 16:40:14] [INFO ] Invariant cache hit.
[2024-05-20 16:40:15] [INFO ] Implicit Places using invariants in 886 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2024-05-20 16:40:15] [INFO ] Invariant cache hit.
[2024-05-20 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2023 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Built C files in :
/tmp/ltsmin2368400657422619464
[2024-05-20 16:40:17] [INFO ] Too many transitions (30102) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:40:17] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2368400657422619464
Running compilation step : cd /tmp/ltsmin2368400657422619464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2368400657422619464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2368400657422619464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 16:40:22] [INFO ] Flatten gal took : 567 ms
[2024-05-20 16:40:22] [INFO ] Flatten gal took : 538 ms
[2024-05-20 16:40:22] [INFO ] Time to serialize gal into /tmp/LTL8817060555929823324.gal : 137 ms
[2024-05-20 16:40:22] [INFO ] Time to serialize properties into /tmp/LTL18414118274937905089.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8817060555929823324.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7662330749022743541.hoa' '-atoms' '/tmp/LTL18414118274937905089.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18414118274937905089.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7662330749022743541.hoa
Detected timeout of ITS tools.
[2024-05-20 16:40:39] [INFO ] Flatten gal took : 712 ms
[2024-05-20 16:40:39] [INFO ] Flatten gal took : 529 ms
[2024-05-20 16:40:39] [INFO ] Time to serialize gal into /tmp/LTL17204850814393275947.gal : 113 ms
[2024-05-20 16:40:39] [INFO ] Time to serialize properties into /tmp/LTL5678821983671297842.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17204850814393275947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5678821983671297842.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"))))
Formula 0 simplified : FG!"((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"
Detected timeout of ITS tools.
[2024-05-20 16:40:55] [INFO ] Flatten gal took : 504 ms
[2024-05-20 16:40:55] [INFO ] Applying decomposition
[2024-05-20 16:40:55] [INFO ] Flatten gal took : 533 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16239097739928964430.txt' '-o' '/tmp/graph16239097739928964430.bin' '-w' '/tmp/graph16239097739928964430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16239097739928964430.bin' '-l' '-1' '-v' '-w' '/tmp/graph16239097739928964430.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:40:57] [INFO ] Decomposing Gal with order
[2024-05-20 16:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:41:04] [INFO ] Removed a total of 29507 redundant transitions.
[2024-05-20 16:41:05] [INFO ] Flatten gal took : 6614 ms
[2024-05-20 16:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 29399 labels/synchronizations in 9288 ms.
[2024-05-20 16:41:15] [INFO ] Time to serialize gal into /tmp/LTL512536039037615807.gal : 143 ms
[2024-05-20 16:41:15] [INFO ] Time to serialize properties into /tmp/LTL7921884115098033206.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL512536039037615807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7921884115098033206.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((u75.Node60GiveAnswer74<1)||((u48.Node80IsInserted>=1)&&(u93.Node92requestsent80>=1)))"))))
Formula 0 simplified : FG!"((u75.Node60GiveAnswer74<1)||((u48.Node80IsInserted>=1)&&(u93.Node92requestsent80>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16402695064997676871
[2024-05-20 16:41:30] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16402695064997676871
Running compilation step : cd /tmp/ltsmin16402695064997676871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16402695064997676871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16402695064997676871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 169443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(G(p1))&&p0))&&F(p2))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21202 transition count 40104
Reduce places removed 696 places and 0 transitions.
Iterating post reduction 1 with 696 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1392 place count 20506 transition count 40102
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9997 Post agglomeration using F-continuation condition.Transition count delta: 9997
Deduced a syphon composed of 9997 places in 21 ms
Reduce places removed 9997 places and 0 transitions.
Iterating global reduction 2 with 19994 rules applied. Total rules applied 21390 place count 10507 transition count 30105
Applied a total of 21390 rules in 5775 ms. Remains 10507 /21202 variables (removed 10695) and now considering 30105/40800 (removed 10695) transitions.
// Phase 1: matrix 30105 rows 10507 cols
[2024-05-20 16:41:39] [INFO ] Computed 201 invariants in 266 ms
[2024-05-20 16:41:40] [INFO ] Implicit Places using invariants in 1285 ms returned []
Implicit Place search using SMT only with invariants took 1286 ms to find 0 implicit places.
[2024-05-20 16:41:40] [INFO ] Invariant cache hit.
[2024-05-20 16:41:41] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10507/21202 places, 30105/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8083 ms. Remains : 10507/21202 places, 30105/40800 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s414 1) (GEQ s446 1)), p2:(GEQ s7713 1), p1:(AND (GEQ s35 1) (GEQ s347 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 705 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-03 finished in 8376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 699 rules applied. Total rules applied 1397 place count 20504 transition count 40101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 18 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 3 with 20000 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 5467 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2024-05-20 16:41:47] [INFO ] Computed 201 invariants in 217 ms
[2024-05-20 16:41:48] [INFO ] Implicit Places using invariants in 1230 ms returned []
Implicit Place search using SMT only with invariants took 1231 ms to find 0 implicit places.
[2024-05-20 16:41:48] [INFO ] Invariant cache hit.
[2024-05-20 16:41:49] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7705 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 766 steps with 0 reset in 38 ms.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-04 finished in 7879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(p2)||G(p3))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 19 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21394 place count 10505 transition count 30103
Applied a total of 21394 rules in 5378 ms. Remains 10505 /21202 variables (removed 10697) and now considering 30103/40800 (removed 10697) transitions.
// Phase 1: matrix 30103 rows 10505 cols
[2024-05-20 16:41:55] [INFO ] Computed 201 invariants in 222 ms
[2024-05-20 16:41:56] [INFO ] Implicit Places using invariants in 1208 ms returned []
Implicit Place search using SMT only with invariants took 1212 ms to find 0 implicit places.
[2024-05-20 16:41:56] [INFO ] Invariant cache hit.
[2024-05-20 16:41:57] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10505/21202 places, 30103/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7594 ms. Remains : 10505/21202 places, 30103/40800 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s10047 1), p0:(AND (GEQ s1781 1) (GEQ s34 1) (GEQ s7737 1)), p2:(GEQ s1781 1), p3:(AND (GEQ s34 1) (GEQ s7737 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 775 steps with 0 reset in 41 ms.
FORMULA CANConstruction-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-05 finished in 7788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 21202 transition count 40103
Reduce places removed 697 places and 0 transitions.
Iterating post reduction 1 with 697 rules applied. Total rules applied 1394 place count 20505 transition count 40103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1394 place count 20505 transition count 40102
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 18 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21392 place count 10506 transition count 30104
Applied a total of 21392 rules in 5711 ms. Remains 10506 /21202 variables (removed 10696) and now considering 30104/40800 (removed 10696) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2024-05-20 16:42:03] [INFO ] Computed 201 invariants in 246 ms
[2024-05-20 16:42:04] [INFO ] Implicit Places using invariants in 1218 ms returned []
Implicit Place search using SMT only with invariants took 1219 ms to find 0 implicit places.
[2024-05-20 16:42:04] [INFO ] Invariant cache hit.
[2024-05-20 16:42:05] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10506/21202 places, 30104/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7846 ms. Remains : 10506/21202 places, 30104/40800 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s340 1) (LT s558 1) (AND (GEQ s570 1) (GEQ s3668 1))), p1:(OR (LT s340 1) (LT s558 1)), p2:(LT s5876 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 143 reset in 3501 ms.
Stack based approach found an accepted trace after 14046 steps with 19 reset with depth 666 and stack size 661 in 499 ms.
FORMULA CANConstruction-PT-100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-07 finished in 12009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X((G(p3)&&p2))&&p1))))'
Support contains 5 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 129 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:42:10] [INFO ] Computed 201 invariants in 394 ms
[2024-05-20 16:42:11] [INFO ] Implicit Places using invariants in 2107 ms returned []
Implicit Place search using SMT only with invariants took 2109 ms to find 0 implicit places.
[2024-05-20 16:42:11] [INFO ] Invariant cache hit.
[2024-05-20 16:42:13] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3904 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s585 1) (LT s734 1) (LT s622 1) (LT s669 1)), p1:(AND (GEQ s622 1) (GEQ s669 1)), p2:(AND (GEQ s622 1) (GEQ s669 1)), p3:(GEQ s5335 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 85440 steps with 42720 reset in 10002 ms.
Product exploration timeout after 84300 steps with 42150 reset in 10001 ms.
Computed a total of 401 stabilizing places and 500 stable transitions
Computed a total of 401 stabilizing places and 500 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-08 finished in 24376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 21202 transition count 40104
Reduce places removed 696 places and 0 transitions.
Iterating post reduction 1 with 696 rules applied. Total rules applied 1392 place count 20506 transition count 40104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1392 place count 20506 transition count 40102
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1396 place count 20504 transition count 40102
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 14 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21392 place count 10506 transition count 30104
Applied a total of 21392 rules in 5718 ms. Remains 10506 /21202 variables (removed 10696) and now considering 30104/40800 (removed 10696) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2024-05-20 16:42:39] [INFO ] Computed 201 invariants in 225 ms
[2024-05-20 16:42:40] [INFO ] Implicit Places using invariants in 1125 ms returned []
Implicit Place search using SMT only with invariants took 1126 ms to find 0 implicit places.
[2024-05-20 16:42:40] [INFO ] Invariant cache hit.
[2024-05-20 16:42:41] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10506/21202 places, 30104/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7768 ms. Remains : 10506/21202 places, 30104/40800 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s415 1) (GEQ s553 1)), p0:(AND (GEQ s415 1) (GEQ s553 1) (GEQ s58 1) (GEQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 166 reset in 3344 ms.
Product exploration explored 100000 steps with 171 reset in 3432 ms.
Computed a total of 299 stabilizing places and 300 stable transitions
Computed a total of 299 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 612 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:42:49] [INFO ] Invariant cache hit.
[2024-05-20 16:42:51] [INFO ] [Real]Absence check using 101 positive place invariants in 265 ms returned sat
[2024-05-20 16:42:51] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 168 ms returned sat
[2024-05-20 16:43:14] [INFO ] After 23443ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:43:15] [INFO ] State equation strengthened by 29898 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 16:43:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 16:43:15] [INFO ] After 25278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10506 transition count 30102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 10504 transition count 30102
Applied a total of 6 rules in 736 ms. Remains 10504 /10506 variables (removed 2) and now considering 30102/30104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 737 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 82275 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82275 steps, saw 74534 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2024-05-20 16:43:19] [INFO ] Computed 201 invariants in 232 ms
[2024-05-20 16:43:20] [INFO ] [Real]Absence check using 101 positive place invariants in 235 ms returned sat
[2024-05-20 16:43:20] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 146 ms returned sat
[2024-05-20 16:43:44] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 228 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 241 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2024-05-20 16:43:45] [INFO ] Invariant cache hit.
[2024-05-20 16:43:45] [INFO ] Implicit Places using invariants in 914 ms returned []
Implicit Place search using SMT only with invariants took 915 ms to find 0 implicit places.
[2024-05-20 16:43:45] [INFO ] Invariant cache hit.
[2024-05-20 16:43:46] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2064 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29602 edges and 10504 vertex of which 9898 / 10504 are part of one of the 98 SCC in 7 ms
Free SCC test removed 9800 places
Drop transitions removed 19502 transitions
Ensure Unique test removed 9604 transitions
Reduce isomorphic transitions removed 29106 transitions.
Graph (complete) has 1597 edges and 704 vertex of which 217 are kept as prefixes of interest. Removing 487 places using SCC suffix rule.1 ms
Discarding 487 places :
Also discarding 290 output transitions
Drop transitions removed 290 transitions
Drop transitions removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 215 transition count 408
Reduce places removed 2 places and 0 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 1 with 200 rules applied. Total rules applied 502 place count 213 transition count 210
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 2 with 394 rules applied. Total rules applied 896 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 896 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 900 place count 13 transition count 12
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 902 place count 11 transition count 10
Iterating global reduction 3 with 2 rules applied. Total rules applied 904 place count 11 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 906 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 908 place count 9 transition count 8
Applied a total of 908 rules in 156 ms. Remains 9 /10504 variables (removed 10495) and now considering 8/30102 (removed 30094) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2024-05-20 16:43:47] [INFO ] Computed 4 invariants in 0 ms
[2024-05-20 16:43:47] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-20 16:43:47] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:43:47] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 16:43:47] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Applied a total of 0 rules in 253 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2024-05-20 16:43:47] [INFO ] Computed 201 invariants in 274 ms
[2024-05-20 16:43:48] [INFO ] Implicit Places using invariants in 1187 ms returned []
Implicit Place search using SMT only with invariants took 1188 ms to find 0 implicit places.
[2024-05-20 16:43:48] [INFO ] Invariant cache hit.
[2024-05-20 16:43:49] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2366 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Computed a total of 299 stabilizing places and 300 stable transitions
Computed a total of 299 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 16:43:50] [INFO ] Invariant cache hit.
[2024-05-20 16:43:51] [INFO ] [Real]Absence check using 101 positive place invariants in 270 ms returned sat
[2024-05-20 16:43:51] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 160 ms returned sat
[2024-05-20 16:44:15] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10506 transition count 30102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 10504 transition count 30102
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 10504 transition count 30102
Applied a total of 6 rules in 623 ms. Remains 10504 /10506 variables (removed 2) and now considering 30102/30104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 82490 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82490 steps, saw 74567 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2024-05-20 16:44:19] [INFO ] Computed 201 invariants in 229 ms
[2024-05-20 16:44:21] [INFO ] [Real]Absence check using 101 positive place invariants in 242 ms returned sat
[2024-05-20 16:44:21] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 140 ms returned sat
[2024-05-20 16:44:44] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 201 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10504/10504 places, 30102/30102 transitions.
Applied a total of 0 rules in 207 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2024-05-20 16:44:45] [INFO ] Invariant cache hit.
[2024-05-20 16:44:46] [INFO ] Implicit Places using invariants in 911 ms returned []
Implicit Place search using SMT only with invariants took 912 ms to find 0 implicit places.
[2024-05-20 16:44:46] [INFO ] Invariant cache hit.
[2024-05-20 16:44:46] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2029 ms. Remains : 10504/10504 places, 30102/30102 transitions.
Graph (trivial) has 29602 edges and 10504 vertex of which 9898 / 10504 are part of one of the 98 SCC in 6 ms
Free SCC test removed 9800 places
Drop transitions removed 19502 transitions
Ensure Unique test removed 9604 transitions
Reduce isomorphic transitions removed 29106 transitions.
Graph (complete) has 1597 edges and 704 vertex of which 217 are kept as prefixes of interest. Removing 487 places using SCC suffix rule.1 ms
Discarding 487 places :
Also discarding 290 output transitions
Drop transitions removed 290 transitions
Drop transitions removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 215 transition count 408
Reduce places removed 2 places and 0 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 1 with 200 rules applied. Total rules applied 502 place count 213 transition count 210
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 2 with 394 rules applied. Total rules applied 896 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 896 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 900 place count 13 transition count 12
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 902 place count 11 transition count 10
Iterating global reduction 3 with 2 rules applied. Total rules applied 904 place count 11 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 906 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 908 place count 9 transition count 8
Applied a total of 908 rules in 147 ms. Remains 9 /10504 variables (removed 10495) and now considering 8/30102 (removed 30094) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 9 cols
[2024-05-20 16:44:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-20 16:44:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-20 16:44:47] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 16:44:47] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 16:44:47] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Product exploration explored 100000 steps with 168 reset in 3244 ms.
Product exploration explored 100000 steps with 168 reset in 3404 ms.
Built C files in :
/tmp/ltsmin7373021377298483797
[2024-05-20 16:44:54] [INFO ] Too many transitions (30104) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:44:54] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7373021377298483797
Running compilation step : cd /tmp/ltsmin7373021377298483797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7373021377298483797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7373021377298483797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 10506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10506/10506 places, 30104/30104 transitions.
Applied a total of 0 rules in 217 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2024-05-20 16:44:57] [INFO ] Computed 201 invariants in 234 ms
[2024-05-20 16:44:58] [INFO ] Implicit Places using invariants in 1136 ms returned []
Implicit Place search using SMT only with invariants took 1137 ms to find 0 implicit places.
[2024-05-20 16:44:58] [INFO ] Invariant cache hit.
[2024-05-20 16:44:59] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2265 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Built C files in :
/tmp/ltsmin18318762222963586056
[2024-05-20 16:44:59] [INFO ] Too many transitions (30104) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:45:00] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18318762222963586056
Running compilation step : cd /tmp/ltsmin18318762222963586056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18318762222963586056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18318762222963586056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 16:45:03] [INFO ] Flatten gal took : 499 ms
[2024-05-20 16:45:04] [INFO ] Flatten gal took : 525 ms
[2024-05-20 16:45:04] [INFO ] Time to serialize gal into /tmp/LTL4170589205706554452.gal : 101 ms
[2024-05-20 16:45:04] [INFO ] Time to serialize properties into /tmp/LTL11385177525549934051.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4170589205706554452.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15780953129098138382.hoa' '-atoms' '/tmp/LTL11385177525549934051.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11385177525549934051.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15780953129098138382.hoa
Detected timeout of ITS tools.
[2024-05-20 16:45:20] [INFO ] Flatten gal took : 625 ms
[2024-05-20 16:45:21] [INFO ] Flatten gal took : 524 ms
[2024-05-20 16:45:21] [INFO ] Time to serialize gal into /tmp/LTL16806313698254168033.gal : 99 ms
[2024-05-20 16:45:21] [INFO ] Time to serialize properties into /tmp/LTL5202484681431600926.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16806313698254168033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5202484681431600926.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((Node68Request<1)||(Node91IsInserted<1))||((Node9IsInserted<1)||(Node43Request<1)))")))||(("((Node68Request>=1)&&(Node91I...269
Formula 0 simplified : G(FG!"(((Node68Request<1)||(Node91IsInserted<1))||((Node9IsInserted<1)||(Node43Request<1)))" & (!"((Node68Request>=1)&&(Node91IsInse...259
Detected timeout of ITS tools.
[2024-05-20 16:45:37] [INFO ] Flatten gal took : 496 ms
[2024-05-20 16:45:37] [INFO ] Applying decomposition
[2024-05-20 16:45:37] [INFO ] Flatten gal took : 524 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1375316798009450634.txt' '-o' '/tmp/graph1375316798009450634.bin' '-w' '/tmp/graph1375316798009450634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1375316798009450634.bin' '-l' '-1' '-v' '-w' '/tmp/graph1375316798009450634.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:45:39] [INFO ] Decomposing Gal with order
[2024-05-20 16:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:45:45] [INFO ] Removed a total of 29530 redundant transitions.
[2024-05-20 16:45:45] [INFO ] Flatten gal took : 5132 ms
[2024-05-20 16:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 29702 labels/synchronizations in 9101 ms.
[2024-05-20 16:45:55] [INFO ] Time to serialize gal into /tmp/LTL16006373666696623312.gal : 100 ms
[2024-05-20 16:45:55] [INFO ] Time to serialize properties into /tmp/LTL6326387489811526332.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16006373666696623312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6326387489811526332.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((u102.Node68Request<1)||(u8.Node91IsInserted<1))||((u72.Node9IsInserted<1)||(u44.Node43Request<1)))")))||(("((u102.Node68...309
Formula 0 simplified : G(FG!"(((u102.Node68Request<1)||(u8.Node91IsInserted<1))||((u72.Node9IsInserted<1)||(u44.Node43Request<1)))" & (!"((u102.Node68Reque...299
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2864801113095801647
[2024-05-20 16:46:10] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2864801113095801647
Running compilation step : cd /tmp/ltsmin2864801113095801647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2864801113095801647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2864801113095801647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-100-LTLFireability-11 finished in 219495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1))) U (X(p2)&&G(p3)))))'
Support contains 4 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 188 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:46:14] [INFO ] Computed 201 invariants in 385 ms
[2024-05-20 16:46:15] [INFO ] Implicit Places using invariants in 2229 ms returned []
Implicit Place search using SMT only with invariants took 2234 ms to find 0 implicit places.
[2024-05-20 16:46:15] [INFO ] Invariant cache hit.
[2024-05-20 16:46:17] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4085 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={0} source=1 dest: 4}, { cond=p3, acceptance={} source=1 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}], [{ cond=(OR (AND p3 (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=7 dest: 3}]], initial=0, aps=[p3:(GEQ s14487 1), p0:(OR (GEQ s7407 1) (AND (GEQ s1056 1) (GEQ s2936 1))), p1:(AND (GEQ s1056 1) (GEQ s2936 1)), p2:(GEQ s7407 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1858 steps with 0 reset in 47 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 4575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 21202 transition count 40101
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 11 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 2 with 20000 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 5434 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2024-05-20 16:46:23] [INFO ] Computed 201 invariants in 188 ms
[2024-05-20 16:46:24] [INFO ] Implicit Places using invariants in 1059 ms returned []
Implicit Place search using SMT only with invariants took 1060 ms to find 0 implicit places.
[2024-05-20 16:46:24] [INFO ] Invariant cache hit.
[2024-05-20 16:46:25] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10503/21202 places, 30101/40800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7395 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s124 1) (GEQ s4979 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 772 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 7622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 21202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Applied a total of 0 rules in 122 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 16:46:26] [INFO ] Computed 201 invariants in 390 ms
[2024-05-20 16:46:27] [INFO ] Implicit Places using invariants in 2074 ms returned []
Implicit Place search using SMT only with invariants took 2075 ms to find 0 implicit places.
[2024-05-20 16:46:27] [INFO ] Invariant cache hit.
[2024-05-20 16:46:29] [INFO ] Dead Transitions using invariants and state equation in 1610 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3809 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-14 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:(AND (GEQ s1308 1) (GEQ s14852 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-14 finished in 4018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
[2024-05-20 16:46:30] [INFO ] Flatten gal took : 796 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16478176209127528686
[2024-05-20 16:46:31] [INFO ] Too many transitions (40800) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:46:31] [INFO ] Built C files in 383ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16478176209127528686
Running compilation step : cd /tmp/ltsmin16478176209127528686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 16:46:31] [INFO ] Applying decomposition
[2024-05-20 16:46:32] [INFO ] Flatten gal took : 1078 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11487175417829097797.txt' '-o' '/tmp/graph11487175417829097797.bin' '-w' '/tmp/graph11487175417829097797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11487175417829097797.bin' '-l' '-1' '-v' '-w' '/tmp/graph11487175417829097797.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:46:34] [INFO ] Decomposing Gal with order
[2024-05-20 16:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:46:42] [INFO ] Removed a total of 16860 redundant transitions.
[2024-05-20 16:46:43] [INFO ] Flatten gal took : 2555 ms
[2024-05-20 16:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 277 ms.
[2024-05-20 16:46:44] [INFO ] Time to serialize gal into /tmp/LTLFireability5141342655041748922.gal : 260 ms
[2024-05-20 16:46:44] [INFO ] Time to serialize properties into /tmp/LTLFireability8953414479549872210.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5141342655041748922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8953414479549872210.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F("((i75.i1.u380.Node60GiveAnswer74<1)||((i64.i1.u407.Node80IsInserted>=1)&&(i64.i1.u407.Node92requestsent80>=1)))"))))
Formula 0 simplified : FG!"((i75.i1.u380.Node60GiveAnswer74<1)||((i64.i1.u407.Node80IsInserted>=1)&&(i64.i1.u407.Node92requestsent80>=1)))"
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/ltsmin16478176209127528686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16478176209127528686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 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)
ITS-tools command line returned an error code 137
[2024-05-20 16:55:16] [INFO ] Flatten gal took : 2652 ms
[2024-05-20 16:55:17] [INFO ] Time to serialize gal into /tmp/LTLFireability11406142261373460992.gal : 199 ms
[2024-05-20 16:55:17] [INFO ] Time to serialize properties into /tmp/LTLFireability8568702696729003105.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11406142261373460992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8568702696729003105.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F("((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"))))
Formula 0 simplified : FG!"((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"
Detected timeout of ITS tools.
[2024-05-20 17:18:45] [INFO ] Flatten gal took : 866 ms
[2024-05-20 17:18:47] [INFO ] Input system was already deterministic with 40800 transitions.
[2024-05-20 17:18:47] [INFO ] Transformed 21202 places.
[2024-05-20 17:18:48] [INFO ] Transformed 40800 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 17:19:33] [INFO ] Time to serialize gal into /tmp/LTLFireability16724195582112308432.gal : 111 ms
[2024-05-20 17:19:33] [INFO ] Time to serialize properties into /tmp/LTLFireability10560317328724579356.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16724195582112308432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10560317328724579356.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"))))
Formula 0 simplified : FG!"((Node60GiveAnswer74<1)||((Node80IsInserted>=1)&&(Node92requestsent80>=1)))"
ITS-tools command line returned an error code 137
Total runtime 3509855 ms.
BK_STOP 1716226485139
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-100.tgz
mv CANConstruction-PT-100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;