Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690700692.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1678373261159

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=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 202303021504
[2023-03-09 14:47:43] [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]
[2023-03-09 14:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:47:44] [INFO ] Load time of PNML (sax parser for PT used): 1049 ms
[2023-03-09 14:47:44] [INFO ] Transformed 21202 places.
[2023-03-09 14:47:45] [INFO ] Transformed 40800 transitions.
[2023-03-09 14:47:45] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1462 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Support contains 52 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 662 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:47:47] [INFO ] Computed 201 place invariants in 875 ms
[2023-03-09 14:47:50] [INFO ] Implicit Places using invariants in 3784 ms returned []
Implicit Place search using SMT only with invariants took 3842 ms to find 0 implicit places.
[2023-03-09 14:47:50] [INFO ] Invariant cache hit.
[2023-03-09 14:47:53] [INFO ] Dead Transitions using invariants and state equation in 2751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7269 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Support contains 52 out of 21202 places after structural reductions.
[2023-03-09 14:47:56] [INFO ] Flatten gal took : 2023 ms
[2023-03-09 14:47:57] [INFO ] Flatten gal took : 1287 ms
[2023-03-09 14:47:59] [INFO ] Input system was already deterministic with 40800 transitions.
Support contains 51 out of 21202 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1259 ms. (steps per millisecond=7 ) properties (out of 33) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-09 14:48:01] [INFO ] Invariant cache hit.
[2023-03-09 14:48:12] [INFO ] [Real]Absence check using 101 positive place invariants in 663 ms returned sat
[2023-03-09 14:48:13] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 268 ms returned sat
[2023-03-09 14:48:26] [INFO ] After 5842ms SMT Verify possible using state equation in real domain returned unsat :0 sat :22
[2023-03-09 14:48:27] [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:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:48:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:48:27] [INFO ] After 25386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 21202 transition count 40116
Reduce places removed 684 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 685 rules applied. Total rules applied 1369 place count 20518 transition count 40115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1370 place count 20517 transition count 40115
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1370 place count 20517 transition count 40112
Deduced a syphon composed of 3 places in 23 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1376 place count 20514 transition count 40112
Performed 9982 Post agglomeration using F-continuation condition.Transition count delta: 9982
Deduced a syphon composed of 9982 places in 53 ms
Reduce places removed 9982 places and 0 transitions.
Iterating global reduction 3 with 19964 rules applied. Total rules applied 21340 place count 10532 transition count 30130
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 21351 place count 10532 transition count 30119
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 21362 place count 10521 transition count 30119
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 21365 place count 10521 transition count 30119
Applied a total of 21365 rules in 15697 ms. Remains 10521 /21202 variables (removed 10681) and now considering 30119/40800 (removed 10681) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15712 ms. Remains : 10521/21202 places, 30119/40800 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 23) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 30119 rows 10521 cols
[2023-03-09 14:48:44] [INFO ] Computed 201 place invariants in 276 ms
[2023-03-09 14:48:49] [INFO ] [Real]Absence check using 101 positive place invariants in 346 ms returned sat
[2023-03-09 14:48:49] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 155 ms returned sat
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:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:49:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:49:09] [INFO ] After 25064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 10521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10521/10521 places, 30119/30119 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 10517 transition count 30115
Applied a total of 8 rules in 628 ms. Remains 10517 /10521 variables (removed 4) and now considering 30115/30119 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 10517/10521 places, 30115/30119 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1265 ms. (steps per millisecond=7 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 30115 rows 10517 cols
[2023-03-09 14:49:11] [INFO ] Computed 201 place invariants in 436 ms
[2023-03-09 14:49:16] [INFO ] [Real]Absence check using 101 positive place invariants in 405 ms returned sat
[2023-03-09 14:49:16] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 330 ms returned sat
[2023-03-09 14:49:36] [INFO ] After 17667ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2023-03-09 14:49:37] [INFO ] State equation strengthened by 29889 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:49:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:49:37] [INFO ] After 25434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 10517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10517/10517 places, 30115/30115 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 10515 transition count 30113
Applied a total of 4 rules in 331 ms. Remains 10515 /10517 variables (removed 2) and now considering 30113/30115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 10515/10517 places, 30113/30115 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1165 ms. (steps per millisecond=8 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 30113 rows 10515 cols
[2023-03-09 14:49:39] [INFO ] Computed 201 place invariants in 307 ms
[2023-03-09 14:49:43] [INFO ] [Real]Absence check using 101 positive place invariants in 305 ms returned sat
[2023-03-09 14:49:43] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 148 ms returned sat
[2023-03-09 14:50:04] [INFO ] After 19735ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2023-03-09 14:50:05] [INFO ] State equation strengthened by 29889 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:50:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:50:05] [INFO ] After 25481ms 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 19 out of 10515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10515/10515 places, 30113/30113 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 10512 transition count 30110
Applied a total of 6 rules in 628 ms. Remains 10512 /10515 variables (removed 3) and now considering 30110/30113 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 10512/10515 places, 30110/30113 transitions.
FORMULA CANConstruction-PT-100-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 177 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:50:07] [INFO ] Computed 201 place invariants in 533 ms
[2023-03-09 14:50:10] [INFO ] Implicit Places using invariants in 4019 ms returned []
Implicit Place search using SMT only with invariants took 4032 ms to find 0 implicit places.
[2023-03-09 14:50:10] [INFO ] Invariant cache hit.
[2023-03-09 14:50:14] [INFO ] Dead Transitions using invariants and state equation in 3476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7701 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1098 1) (GEQ s16010 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-00 finished in 8157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 3 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 156 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-09 14:50:14] [INFO ] Invariant cache hit.
[2023-03-09 14:50:18] [INFO ] Implicit Places using invariants in 3709 ms returned []
Implicit Place search using SMT only with invariants took 3724 ms to find 0 implicit places.
[2023-03-09 14:50:18] [INFO ] Invariant cache hit.
[2023-03-09 14:50:22] [INFO ] Dead Transitions using invariants and state equation in 3506 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7394 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LT s5719 1), p0:(AND (GEQ s137 1) (GEQ s790 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1696 steps with 0 reset in 135 ms.
FORMULA CANConstruction-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-01 finished in 7923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 21202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 20 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 10231 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-09 14:50:33] [INFO ] Computed 201 place invariants in 248 ms
[2023-03-09 14:50:34] [INFO ] Implicit Places using invariants in 1334 ms returned []
Implicit Place search using SMT only with invariants took 1352 ms to find 0 implicit places.
[2023-03-09 14:50:34] [INFO ] Invariant cache hit.
[2023-03-09 14:50:35] [INFO ] Dead Transitions using invariants and state equation in 1796 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 13397 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-02 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 s2675 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 634 steps with 0 reset in 50 ms.
FORMULA CANConstruction-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-02 finished in 13647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 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 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9998 Post agglomeration using F-continuation condition.Transition count delta: 9998
Deduced a syphon composed of 9998 places in 31 ms
Reduce places removed 9998 places and 0 transitions.
Iterating global reduction 2 with 19996 rules applied. Total rules applied 21396 place count 10504 transition count 30102
Applied a total of 21396 rules in 7323 ms. Remains 10504 /21202 variables (removed 10698) and now considering 30102/40800 (removed 10698) transitions.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-09 14:50:43] [INFO ] Computed 201 place invariants in 268 ms
[2023-03-09 14:50:45] [INFO ] Implicit Places using invariants in 1512 ms returned []
Implicit Place search using SMT only with invariants took 1519 ms to find 0 implicit places.
[2023-03-09 14:50:45] [INFO ] Invariant cache hit.
[2023-03-09 14:50:46] [INFO ] Dead Transitions using invariants and state equation in 1802 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 10650 ms. Remains : 10504/21202 places, 30102/40800 transitions.
Stuttering acceptance computed with spot in 79 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:(OR (GEQ s9035 1) (GEQ s3906 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 754 steps with 0 reset in 69 ms.
FORMULA CANConstruction-PT-100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-04 finished in 10899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)&&G((F(G(X(p2)))&&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 124 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:50:47] [INFO ] Computed 201 place invariants in 555 ms
[2023-03-09 14:50:51] [INFO ] Implicit Places using invariants in 3928 ms returned []
Implicit Place search using SMT only with invariants took 3929 ms to find 0 implicit places.
[2023-03-09 14:50:51] [INFO ] Invariant cache hit.
[2023-03-09 14:50:53] [INFO ] Dead Transitions using invariants and state equation in 2215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6275 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GEQ s1563 1), p1:(AND (GEQ s123 1) (GEQ s650 1)), p0:(GEQ s5109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-05 finished in 6737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p2)))))'
Support contains 3 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 147 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-09 14:50:54] [INFO ] Invariant cache hit.
[2023-03-09 14:50:56] [INFO ] Implicit Places using invariants in 2172 ms returned []
Implicit Place search using SMT only with invariants took 2176 ms to find 0 implicit places.
[2023-03-09 14:50:56] [INFO ] Invariant cache hit.
[2023-03-09 14:50:58] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4363 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LT s20039 1), p0:(GEQ s8583 1), p1:(GEQ s18769 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-06 finished in 4799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 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 224 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-09 14:50:58] [INFO ] Invariant cache hit.
[2023-03-09 14:51:01] [INFO ] Implicit Places using invariants in 2285 ms returned []
Implicit Place search using SMT only with invariants took 2291 ms to find 0 implicit places.
[2023-03-09 14:51:01] [INFO ] Invariant cache hit.
[2023-03-09 14:51:03] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4562 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) p1), p1, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s188 1) (GEQ s8358 1)), p1:(AND (GEQ s986 1) (GEQ s1327 1)), p2:(AND (GEQ s188 1) (GEQ s8358 1) (GEQ s305 1) (GEQ s720 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 69130 steps with 34565 reset in 10002 ms.
Product exploration timeout after 72510 steps with 36255 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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 15 factoid took 664 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-07 finished in 25993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
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 162 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-09 14:51:24] [INFO ] Invariant cache hit.
[2023-03-09 14:51:28] [INFO ] Implicit Places using invariants in 3408 ms returned []
Implicit Place search using SMT only with invariants took 3412 ms to find 0 implicit places.
[2023-03-09 14:51:28] [INFO ] Invariant cache hit.
[2023-03-09 14:51:30] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5649 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s230 1) (LT s347 1)), p1:(AND (GEQ s958 1) (GEQ s12228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1696 steps with 0 reset in 60 ms.
FORMULA CANConstruction-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-08 finished in 6014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21202 transition count 40100
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20502 transition count 40100
Performed 9999 Post agglomeration using F-continuation condition.Transition count delta: 9999
Deduced a syphon composed of 9999 places in 23 ms
Reduce places removed 9999 places and 0 transitions.
Iterating global reduction 2 with 19998 rules applied. Total rules applied 21398 place count 10503 transition count 30101
Applied a total of 21398 rules in 7471 ms. Remains 10503 /21202 variables (removed 10699) and now considering 30101/40800 (removed 10699) transitions.
// Phase 1: matrix 30101 rows 10503 cols
[2023-03-09 14:51:38] [INFO ] Computed 201 place invariants in 258 ms
[2023-03-09 14:51:39] [INFO ] Implicit Places using invariants in 1411 ms returned []
Implicit Place search using SMT only with invariants took 1413 ms to find 0 implicit places.
[2023-03-09 14:51:39] [INFO ] Invariant cache hit.
[2023-03-09 14:51:40] [INFO ] Dead Transitions using invariants and state equation in 1072 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 9962 ms. Remains : 10503/21202 places, 30101/40800 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8365 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 706 steps with 0 reset in 57 ms.
FORMULA CANConstruction-PT-100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-09 finished in 10288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !p1)))'
Support contains 3 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 190 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:51:41] [INFO ] Computed 201 place invariants in 632 ms
[2023-03-09 14:51:45] [INFO ] Implicit Places using invariants in 4022 ms returned []
Implicit Place search using SMT only with invariants took 4035 ms to find 0 implicit places.
[2023-03-09 14:51:45] [INFO ] Invariant cache hit.
[2023-03-09 14:51:47] [INFO ] Dead Transitions using invariants and state equation in 2016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6263 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 227 ms :[p1, p1, true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s10515 1) (GEQ s230 1) (GEQ s18462 1)), p0:(GEQ s10515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 77390 steps with 38695 reset in 10002 ms.
Product exploration timeout after 76010 steps with 38005 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-100-LTLFireability-10 finished in 26952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(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 13 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 23 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 12511 ms. Remains 10506 /21202 variables (removed 10696) and now considering 30104/40800 (removed 10696) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-09 14:52:20] [INFO ] Computed 201 place invariants in 277 ms
[2023-03-09 14:52:21] [INFO ] Implicit Places using invariants in 1439 ms returned []
Implicit Place search using SMT only with invariants took 1440 ms to find 0 implicit places.
[2023-03-09 14:52:21] [INFO ] Invariant cache hit.
[2023-03-09 14:52:23] [INFO ] Dead Transitions using invariants and state equation in 1191 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 15148 ms. Remains : 10506/21202 places, 30104/40800 transitions.
Stuttering acceptance computed with spot in 105 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 169 reset in 4196 ms.
Product exploration explored 100000 steps with 165 reset in 4063 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 301 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 105 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:52:32] [INFO ] Invariant cache hit.
[2023-03-09 14:52:34] [INFO ] [Real]Absence check using 101 positive place invariants in 245 ms returned sat
[2023-03-09 14:52:34] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 136 ms returned sat
[2023-03-09 14:52:55] [INFO ] After 21072ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:52:55] [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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:52:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:52:57] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 40 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 577 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 578 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Finished random walk after 5220 steps, including 7 resets, run visited all 1 properties in 219 ms. (steps per millisecond=23 )
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), (F p0)]
Knowledge based reduction with 5 factoid took 502 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 152 ms :[p0, p0]
Stuttering acceptance computed with spot in 134 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 277 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
[2023-03-09 14:52:59] [INFO ] Invariant cache hit.
[2023-03-09 14:53:00] [INFO ] Implicit Places using invariants in 1102 ms returned []
Implicit Place search using SMT only with invariants took 1119 ms to find 0 implicit places.
[2023-03-09 14:53:00] [INFO ] Invariant cache hit.
[2023-03-09 14:53:01] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2388 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 282 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 106 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:53:02] [INFO ] Invariant cache hit.
[2023-03-09 14:53:04] [INFO ] [Real]Absence check using 101 positive place invariants in 289 ms returned sat
[2023-03-09 14:53:04] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 114 ms returned sat
[2023-03-09 14:53:24] [INFO ] After 19964ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:53:24] [INFO ] State equation strengthened by 29898 read => feed constraints.
[2023-03-09 14:53:27] [INFO ] After 2812ms SMT Verify possible using 29898 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-09 14:53:27] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 60 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 755 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 755 ms. Remains : 10504/10506 places, 30102/30104 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 385 ms. (steps per millisecond=25 ) 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 85742 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85742 steps, saw 75019 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30102 rows 10504 cols
[2023-03-09 14:53:32] [INFO ] Computed 201 place invariants in 187 ms
[2023-03-09 14:53:33] [INFO ] [Real]Absence check using 101 positive place invariants in 243 ms returned sat
[2023-03-09 14:53:33] [INFO ] [Real]Absence check using 101 positive and 100 generalized place invariants in 111 ms returned sat
[2023-03-09 14:53:51] [INFO ] After 18001ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:53:52] [INFO ] State equation strengthened by 29900 read => feed constraints.
[2023-03-09 14:53:57] [INFO ] After 4753ms SMT Verify possible using 29900 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:53:57] [INFO ] After 24732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:53:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 279 ms returned sat
[2023-03-09 14:53:58] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 127 ms returned sat
[2023-03-09 14:54:22] [INFO ] After 25050ms SMT Verify possible using all constraints in natural 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 292 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 293 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 272 ms. Remains 10504 /10504 variables (removed 0) and now considering 30102/30102 (removed 0) transitions.
[2023-03-09 14:54:22] [INFO ] Invariant cache hit.
[2023-03-09 14:54:24] [INFO ] Implicit Places using invariants in 1375 ms returned []
Implicit Place search using SMT only with invariants took 1377 ms to find 0 implicit places.
[2023-03-09 14:54:24] [INFO ] Invariant cache hit.
[2023-03-09 14:54:24] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2596 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 15 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.2 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 262 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
[2023-03-09 14:54:25] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 14:54:25] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-09 14:54:25] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 14:54:25] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 14:54:25] [INFO ] After 38ms 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 320 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 116 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Product exploration explored 100000 steps with 163 reset in 3289 ms.
Product exploration explored 100000 steps with 164 reset in 3087 ms.
Built C files in :
/tmp/ltsmin1032718512212761187
[2023-03-09 14:54:32] [INFO ] Too many transitions (30104) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:54:32] [INFO ] Built C files in 405ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1032718512212761187
Running compilation step : cd /tmp/ltsmin1032718512212761187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1032718512212761187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1032718512212761187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 266 ms. Remains 10506 /10506 variables (removed 0) and now considering 30104/30104 (removed 0) transitions.
// Phase 1: matrix 30104 rows 10506 cols
[2023-03-09 14:54:36] [INFO ] Computed 201 place invariants in 226 ms
[2023-03-09 14:54:37] [INFO ] Implicit Places using invariants in 1416 ms returned []
Implicit Place search using SMT only with invariants took 1420 ms to find 0 implicit places.
[2023-03-09 14:54:37] [INFO ] Invariant cache hit.
[2023-03-09 14:54:38] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2797 ms. Remains : 10506/10506 places, 30104/30104 transitions.
Built C files in :
/tmp/ltsmin8289041335389316770
[2023-03-09 14:54:38] [INFO ] Too many transitions (30104) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:54:39] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8289041335389316770
Running compilation step : cd /tmp/ltsmin8289041335389316770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8289041335389316770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8289041335389316770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 14:54:43] [INFO ] Flatten gal took : 681 ms
[2023-03-09 14:54:44] [INFO ] Flatten gal took : 693 ms
[2023-03-09 14:54:44] [INFO ] Time to serialize gal into /tmp/LTL2850258097104575968.gal : 186 ms
[2023-03-09 14:54:44] [INFO ] Time to serialize properties into /tmp/LTL6751451143128431095.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2850258097104575968.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9210670610454096431.hoa' '-atoms' '/tmp/LTL6751451143128431095.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6751451143128431095.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9210670610454096431.hoa
Detected timeout of ITS tools.
[2023-03-09 14:55:01] [INFO ] Flatten gal took : 580 ms
[2023-03-09 14:55:02] [INFO ] Flatten gal took : 543 ms
[2023-03-09 14:55:02] [INFO ] Time to serialize gal into /tmp/LTL13527631584146650780.gal : 102 ms
[2023-03-09 14:55:02] [INFO ] Time to serialize properties into /tmp/LTL5294888674397238479.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13527631584146650780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5294888674397238479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((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.
[2023-03-09 14:55:18] [INFO ] Flatten gal took : 679 ms
[2023-03-09 14:55:18] [INFO ] Applying decomposition
[2023-03-09 14:55:18] [INFO ] Flatten gal took : 598 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12997874888409996719.txt' '-o' '/tmp/graph12997874888409996719.bin' '-w' '/tmp/graph12997874888409996719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12997874888409996719.bin' '-l' '-1' '-v' '-w' '/tmp/graph12997874888409996719.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:55:20] [INFO ] Decomposing Gal with order
[2023-03-09 14:55:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:55:27] [INFO ] Removed a total of 29533 redundant transitions.
[2023-03-09 14:55:29] [INFO ] Flatten gal took : 6770 ms
[2023-03-09 14:55:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 29702 labels/synchronizations in 9495 ms.
[2023-03-09 14:55:39] [INFO ] Time to serialize gal into /tmp/LTL3814492789488291979.gal : 171 ms
[2023-03-09 14:55:39] [INFO ] Time to serialize properties into /tmp/LTL17873513803113842402.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3814492789488291979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17873513803113842402.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((u71.Node68Request<1)||(u14.Node91IsInserted<1))||((u88.Node9IsInserted<1)||(u45.Node43Request<1)))")))||(("((u71.Node68R...309
Formula 0 simplified : G(FG!"(((u71.Node68Request<1)||(u14.Node91IsInserted<1))||((u88.Node9IsInserted<1)||(u45.Node43Request<1)))" & (!"((u71.Node68Reques...299
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9256350500259276735
[2023-03-09 14:55:54] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9256350500259276735
Running compilation step : cd /tmp/ltsmin9256350500259276735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9256350500259276735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9256350500259276735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-100-LTLFireability-11 finished in 229813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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 192 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:55:58] [INFO ] Computed 201 place invariants in 533 ms
[2023-03-09 14:56:00] [INFO ] Implicit Places using invariants in 2617 ms returned []
Implicit Place search using SMT only with invariants took 2644 ms to find 0 implicit places.
[2023-03-09 14:56:00] [INFO ] Invariant cache hit.
[2023-03-09 14:56:02] [INFO ] Dead Transitions using invariants and state equation in 2176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5030 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
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 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s846 1) (GEQ s8648 1) (GEQ s14119 1) (GEQ s900 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][false, false]]
Stuttering criterion allowed to conclude after 1849 steps with 0 reset in 77 ms.
FORMULA CANConstruction-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-12 finished in 5376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F((p1&&X((p1 U (p0||G(p1))))))))))'
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 162 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
[2023-03-09 14:56:03] [INFO ] Invariant cache hit.
[2023-03-09 14:56:06] [INFO ] Implicit Places using invariants in 3419 ms returned []
Implicit Place search using SMT only with invariants took 3433 ms to find 0 implicit places.
[2023-03-09 14:56:06] [INFO ] Invariant cache hit.
[2023-03-09 14:56:08] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5666 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s10041 1), p0:(GEQ s7543 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6985 steps with 3 reset in 354 ms.
FORMULA CANConstruction-PT-100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-13 finished in 6559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)||G(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 50 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 14 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 9114 ms. Remains 10507 /21202 variables (removed 10695) and now considering 30105/40800 (removed 10695) transitions.
// Phase 1: matrix 30105 rows 10507 cols
[2023-03-09 14:56:19] [INFO ] Computed 201 place invariants in 307 ms
[2023-03-09 14:56:20] [INFO ] Implicit Places using invariants in 1582 ms returned []
Implicit Place search using SMT only with invariants took 1585 ms to find 0 implicit places.
[2023-03-09 14:56:20] [INFO ] Invariant cache hit.
[2023-03-09 14:56:21] [INFO ] Dead Transitions using invariants and state equation in 1140 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 11854 ms. Remains : 10507/21202 places, 30105/40800 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s311 1) (GEQ s343 1)), p1:(OR (LT s5 1) (LT s379 1)), p2:(GEQ s893 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 670 steps with 0 reset in 31 ms.
FORMULA CANConstruction-PT-100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-14 finished in 12239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F((p1||X(p2))))&&p0))))'
Support contains 3 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 158 ms. Remains 21202 /21202 variables (removed 0) and now considering 40800/40800 (removed 0) transitions.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-09 14:56:22] [INFO ] Computed 201 place invariants in 483 ms
[2023-03-09 14:56:24] [INFO ] Implicit Places using invariants in 2865 ms returned []
Implicit Place search using SMT only with invariants took 2882 ms to find 0 implicit places.
[2023-03-09 14:56:24] [INFO ] Invariant cache hit.
[2023-03-09 14:56:28] [INFO ] Dead Transitions using invariants and state equation in 3182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6230 ms. Remains : 21202/21202 places, 40800/40800 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s216 1) (GEQ s16282 1)), p2:(LT s18983 1), p0:(AND (GEQ s18983 1) (GEQ s216 1) (GEQ s16282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1921 steps with 0 reset in 75 ms.
FORMULA CANConstruction-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-100-LTLFireability-15 finished in 6743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
[2023-03-09 14:56:29] [INFO ] Flatten gal took : 1011 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16638191697955054424
[2023-03-09 14:56:30] [INFO ] Too many transitions (40800) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:56:31] [INFO ] Built C files in 538ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16638191697955054424
Running compilation step : cd /tmp/ltsmin16638191697955054424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 14:56:31] [INFO ] Applying decomposition
[2023-03-09 14:56:32] [INFO ] Flatten gal took : 1266 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2406553541513489243.txt' '-o' '/tmp/graph2406553541513489243.bin' '-w' '/tmp/graph2406553541513489243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2406553541513489243.bin' '-l' '-1' '-v' '-w' '/tmp/graph2406553541513489243.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:56:35] [INFO ] Decomposing Gal with order
[2023-03-09 14:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:56:42] [INFO ] Removed a total of 16852 redundant transitions.
[2023-03-09 14:56:43] [INFO ] Flatten gal took : 2294 ms
[2023-03-09 14:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 298 ms.
[2023-03-09 14:56:44] [INFO ] Time to serialize gal into /tmp/LTLFireability12513466397188258576.gal : 229 ms
[2023-03-09 14:56:44] [INFO ] Time to serialize properties into /tmp/LTLFireability14703374449231901923.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12513466397188258576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14703374449231901923.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((G(F(!("(((i87.u347.Node68Request>=1)&&(i84.u592.Node91IsInserted>=1))&&((i15.u48.Node9IsInserted>=1)&&(i16.u220.Node43Request>=1...371
Formula 0 simplified : G(FG"(((i87.u347.Node68Request>=1)&&(i84.u592.Node91IsInserted>=1))&&((i15.u48.Node9IsInserted>=1)&&(i16.u220.Node43Request>=1)))" &...353
ITS-tools command line returned an error code 137
[2023-03-09 15:04:28] [INFO ] Flatten gal took : 2329 ms
[2023-03-09 15:04:29] [INFO ] Time to serialize gal into /tmp/LTLFireability3450559687198791132.gal : 266 ms
[2023-03-09 15:04:29] [INFO ] Time to serialize properties into /tmp/LTLFireability262568799324762296.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3450559687198791132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability262568799324762296.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((F((G(F(!("(((Node68Request>=1)&&(Node91IsInserted>=1))&&((Node9IsInserted>=1)&&(Node43Request>=1)))"))))||(("((Node68Request>=1)&&(...283
Formula 0 simplified : G(FG"(((Node68Request>=1)&&(Node91IsInserted>=1))&&((Node9IsInserted>=1)&&(Node43Request>=1)))" & (!"((Node68Request>=1)&&(Node91IsI...265
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/ltsmin16638191697955054424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16638191697955054424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 720 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)
Detected timeout of ITS tools.
[2023-03-09 15:27:27] [INFO ] Flatten gal took : 1798 ms
[2023-03-09 15:27:29] [INFO ] Input system was already deterministic with 40800 transitions.
[2023-03-09 15:27:29] [INFO ] Transformed 21202 places.
[2023-03-09 15:27:29] [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
[2023-03-09 15:28:14] [INFO ] Time to serialize gal into /tmp/LTLFireability2632810397359870803.gal : 198 ms
[2023-03-09 15:28:14] [INFO ] Time to serialize properties into /tmp/LTLFireability7886153152581405108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2632810397359870803.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7886153152581405108.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F(!("(((Node68Request>=1)&&(Node91IsInserted>=1))&&((Node9IsInserted>=1)&&(Node43Request>=1)))"))))||(("((Node68Request>=1)&&(...283
Formula 0 simplified : G(FG"(((Node68Request>=1)&&(Node91IsInserted>=1))&&((Node9IsInserted>=1)&&(Node43Request>=1)))" & (!"((Node68Request>=1)&&(Node91IsI...265
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 207420 kB
After kill :
MemTotal: 16393340 kB
MemFree: 12598552 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r037-tajo-167813690700692"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;