MCC'2023- Execution of r293-tall-167873945900764

About the Execution of ITS-Tools for PolyORBNT-PT-S10J30

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14351.052	3600000.00	13111937.00	7827.90	?FFFFTFFFF?FTFFT	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945900764.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-PT-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 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 PolyORBNT-PT-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678966709969

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=PolyORBNT-PT-S10J30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 11:38:31] [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-16 11:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 11:38:32] [INFO ] Load time of PNML (sax parser for PT used): 988 ms
[2023-03-16 11:38:32] [INFO ] Transformed 664 places.
[2023-03-16 11:38:32] [INFO ] Transformed 12050 transitions.
[2023-03-16 11:38:32] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-16 11:38:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-16 11:38:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-16 11:38:32] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-16 11:38:32] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-16 11:38:32] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 69 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-16 11:38:32] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-16 11:38:33] [INFO ] Computed 92 place invariants in 124 ms
[2023-03-16 11:38:34] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-16 11:38:34] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-16 11:38:34] [INFO ] Computed 92 place invariants in 50 ms
[2023-03-16 11:38:34] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-16 11:38:34] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-16 11:38:34] [INFO ] Invariant cache hit.
[2023-03-16 11:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:38:36] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 22 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3162 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 500 out of 664 places after structural reductions.
[2023-03-16 11:38:36] [INFO ] Flatten gal took : 230 ms
[2023-03-16 11:38:36] [INFO ] Flatten gal took : 147 ms
[2023-03-16 11:38:37] [INFO ] Input system was already deterministic with 1325 transitions.
Support contains 497 out of 664 places (down from 500) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1510 ms. (steps per millisecond=6 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 8) 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 8) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-16 11:38:38] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-16 11:38:38] [INFO ] Invariant cache hit.
[2023-03-16 11:38:39] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-16 11:38:39] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 31 ms returned sat
[2023-03-16 11:38:41] [INFO ] After 2338ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-16 11:38:41] [INFO ] [Nat]Absence check using 62 positive place invariants in 15 ms returned sat
[2023-03-16 11:38:41] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 33 ms returned sat
[2023-03-16 11:38:43] [INFO ] After 2139ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-16 11:38:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:38:44] [INFO ] After 441ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-16 11:38:44] [INFO ] Deduced a trap composed of 299 places in 354 ms of which 5 ms to minimize.
[2023-03-16 11:38:44] [INFO ] Deduced a trap composed of 313 places in 323 ms of which 1 ms to minimize.
[2023-03-16 11:38:45] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 1 ms to minimize.
[2023-03-16 11:38:45] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2023-03-16 11:38:45] [INFO ] Deduced a trap composed of 299 places in 313 ms of which 1 ms to minimize.
[2023-03-16 11:38:46] [INFO ] Deduced a trap composed of 294 places in 319 ms of which 0 ms to minimize.
[2023-03-16 11:38:46] [INFO ] Deduced a trap composed of 309 places in 316 ms of which 0 ms to minimize.
[2023-03-16 11:38:47] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 1 ms to minimize.
[2023-03-16 11:38:47] [INFO ] Deduced a trap composed of 313 places in 316 ms of which 0 ms to minimize.
[2023-03-16 11:38:47] [INFO ] Deduced a trap composed of 311 places in 313 ms of which 1 ms to minimize.
[2023-03-16 11:38:48] [INFO ] Deduced a trap composed of 310 places in 320 ms of which 0 ms to minimize.
[2023-03-16 11:38:48] [INFO ] Deduced a trap composed of 302 places in 294 ms of which 1 ms to minimize.
[2023-03-16 11:38:49] [INFO ] Deduced a trap composed of 311 places in 312 ms of which 1 ms to minimize.
[2023-03-16 11:38:49] [INFO ] Deduced a trap composed of 305 places in 322 ms of which 1 ms to minimize.
[2023-03-16 11:38:50] [INFO ] Deduced a trap composed of 297 places in 324 ms of which 1 ms to minimize.
[2023-03-16 11:38:50] [INFO ] Deduced a trap composed of 299 places in 321 ms of which 0 ms to minimize.
[2023-03-16 11:38:51] [INFO ] Deduced a trap composed of 303 places in 322 ms of which 0 ms to minimize.
[2023-03-16 11:38:51] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 0 ms to minimize.
[2023-03-16 11:38:52] [INFO ] Deduced a trap composed of 309 places in 305 ms of which 1 ms to minimize.
[2023-03-16 11:38:52] [INFO ] Deduced a trap composed of 307 places in 332 ms of which 0 ms to minimize.
[2023-03-16 11:38:52] [INFO ] Deduced a trap composed of 322 places in 311 ms of which 0 ms to minimize.
[2023-03-16 11:38:53] [INFO ] Deduced a trap composed of 307 places in 296 ms of which 1 ms to minimize.
[2023-03-16 11:38:53] [INFO ] Deduced a trap composed of 308 places in 327 ms of which 0 ms to minimize.
[2023-03-16 11:38:54] [INFO ] Deduced a trap composed of 309 places in 298 ms of which 1 ms to minimize.
[2023-03-16 11:38:55] [INFO ] Deduced a trap composed of 301 places in 295 ms of which 0 ms to minimize.
[2023-03-16 11:38:55] [INFO ] Deduced a trap composed of 303 places in 324 ms of which 1 ms to minimize.
[2023-03-16 11:38:56] [INFO ] Deduced a trap composed of 304 places in 327 ms of which 1 ms to minimize.
[2023-03-16 11:38:56] [INFO ] Deduced a trap composed of 300 places in 318 ms of which 1 ms to minimize.
[2023-03-16 11:38:57] [INFO ] Deduced a trap composed of 299 places in 304 ms of which 0 ms to minimize.
[2023-03-16 11:38:57] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 1 ms to minimize.
[2023-03-16 11:38:57] [INFO ] Deduced a trap composed of 303 places in 317 ms of which 0 ms to minimize.
[2023-03-16 11:38:58] [INFO ] Deduced a trap composed of 297 places in 322 ms of which 1 ms to minimize.
[2023-03-16 11:38:58] [INFO ] Deduced a trap composed of 299 places in 328 ms of which 1 ms to minimize.
[2023-03-16 11:38:58] [INFO ] Deduced a trap composed of 307 places in 319 ms of which 1 ms to minimize.
[2023-03-16 11:39:01] [INFO ] Deduced a trap composed of 315 places in 286 ms of which 2 ms to minimize.
[2023-03-16 11:39:01] [INFO ] Deduced a trap composed of 306 places in 287 ms of which 1 ms to minimize.
[2023-03-16 11:39:01] [INFO ] Deduced a trap composed of 306 places in 295 ms of which 1 ms to minimize.
[2023-03-16 11:39:02] [INFO ] Deduced a trap composed of 308 places in 317 ms of which 0 ms to minimize.
[2023-03-16 11:39:03] [INFO ] Deduced a trap composed of 305 places in 318 ms of which 0 ms to minimize.
[2023-03-16 11:39:06] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 11:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 11:39:06] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1251
Applied a total of 158 rules in 228 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-16 11:39:06] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-16 11:39:06] [INFO ] Computed 82 place invariants in 26 ms
[2023-03-16 11:39:07] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 905 ms. Remains : 580/664 places, 1251/1325 transitions.
Incomplete random walk after 10000 steps, including 739 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 11:39:07] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 11:39:07] [INFO ] Invariant cache hit.
[2023-03-16 11:39:07] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:39:07] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-16 11:39:07] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 11:39:07] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-16 11:39:07] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 26 ms returned sat
[2023-03-16 11:39:08] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 11:39:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:39:08] [INFO ] After 147ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 11:39:09] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 1 ms to minimize.
[2023-03-16 11:39:09] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 1 ms to minimize.
[2023-03-16 11:39:09] [INFO ] Deduced a trap composed of 241 places in 293 ms of which 0 ms to minimize.
[2023-03-16 11:39:10] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 0 ms to minimize.
[2023-03-16 11:39:10] [INFO ] Deduced a trap composed of 238 places in 284 ms of which 1 ms to minimize.
[2023-03-16 11:39:10] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-16 11:39:11] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 0 ms to minimize.
[2023-03-16 11:39:11] [INFO ] Deduced a trap composed of 229 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:39:11] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:39:12] [INFO ] Deduced a trap composed of 233 places in 299 ms of which 0 ms to minimize.
[2023-03-16 11:39:12] [INFO ] Deduced a trap composed of 236 places in 301 ms of which 1 ms to minimize.
[2023-03-16 11:39:12] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2023-03-16 11:39:13] [INFO ] Deduced a trap composed of 237 places in 279 ms of which 0 ms to minimize.
[2023-03-16 11:39:13] [INFO ] Deduced a trap composed of 231 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:39:14] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:39:14] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 1 ms to minimize.
[2023-03-16 11:39:14] [INFO ] Deduced a trap composed of 233 places in 310 ms of which 9 ms to minimize.
[2023-03-16 11:39:15] [INFO ] Deduced a trap composed of 244 places in 285 ms of which 1 ms to minimize.
[2023-03-16 11:39:15] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 1 ms to minimize.
[2023-03-16 11:39:16] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 1 ms to minimize.
[2023-03-16 11:39:16] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-16 11:39:16] [INFO ] Deduced a trap composed of 224 places in 299 ms of which 2 ms to minimize.
[2023-03-16 11:39:17] [INFO ] Deduced a trap composed of 218 places in 274 ms of which 1 ms to minimize.
[2023-03-16 11:39:17] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 2 ms to minimize.
[2023-03-16 11:39:17] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:39:18] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:39:18] [INFO ] Deduced a trap composed of 222 places in 283 ms of which 2 ms to minimize.
[2023-03-16 11:39:18] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 1 ms to minimize.
[2023-03-16 11:39:19] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 0 ms to minimize.
[2023-03-16 11:39:19] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:39:19] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:39:20] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 1 ms to minimize.
[2023-03-16 11:39:20] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 1 ms to minimize.
[2023-03-16 11:39:21] [INFO ] Deduced a trap composed of 224 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:39:21] [INFO ] Deduced a trap composed of 239 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:39:22] [INFO ] Deduced a trap composed of 228 places in 280 ms of which 0 ms to minimize.
[2023-03-16 11:39:22] [INFO ] Deduced a trap composed of 237 places in 293 ms of which 1 ms to minimize.
[2023-03-16 11:39:23] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 0 ms to minimize.
[2023-03-16 11:39:23] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-16 11:39:23] [INFO ] Deduced a trap composed of 245 places in 282 ms of which 1 ms to minimize.
[2023-03-16 11:39:24] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 0 ms to minimize.
[2023-03-16 11:39:24] [INFO ] Deduced a trap composed of 228 places in 286 ms of which 1 ms to minimize.
[2023-03-16 11:39:24] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:39:25] [INFO ] Deduced a trap composed of 224 places in 294 ms of which 1 ms to minimize.
[2023-03-16 11:39:25] [INFO ] Deduced a trap composed of 241 places in 288 ms of which 1 ms to minimize.
[2023-03-16 11:39:26] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 0 ms to minimize.
[2023-03-16 11:39:26] [INFO ] Deduced a trap composed of 226 places in 296 ms of which 1 ms to minimize.
[2023-03-16 11:39:27] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 1 ms to minimize.
[2023-03-16 11:39:27] [INFO ] Deduced a trap composed of 240 places in 289 ms of which 0 ms to minimize.
[2023-03-16 11:39:27] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-16 11:39:28] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 0 ms to minimize.
[2023-03-16 11:39:30] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:39:31] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 0 ms to minimize.
[2023-03-16 11:39:31] [INFO ] Deduced a trap composed of 237 places in 276 ms of which 0 ms to minimize.
[2023-03-16 11:39:31] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:39:32] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 1 ms to minimize.
[2023-03-16 11:39:32] [INFO ] Deduced a trap composed of 244 places in 294 ms of which 1 ms to minimize.
[2023-03-16 11:39:32] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 23743 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 11:39:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 11:39:32] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 41 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 748 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 302593 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 302593 steps, saw 49435 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 11:39:35] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 11:39:35] [INFO ] Invariant cache hit.
[2023-03-16 11:39:35] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-16 11:39:35] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-16 11:39:35] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 11:39:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-16 11:39:36] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-16 11:39:37] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 11:39:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:39:37] [INFO ] After 121ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 11:39:37] [INFO ] Deduced a trap composed of 228 places in 315 ms of which 1 ms to minimize.
[2023-03-16 11:39:37] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 1 ms to minimize.
[2023-03-16 11:39:38] [INFO ] Deduced a trap composed of 241 places in 294 ms of which 1 ms to minimize.
[2023-03-16 11:39:38] [INFO ] Deduced a trap composed of 240 places in 292 ms of which 0 ms to minimize.
[2023-03-16 11:39:38] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 0 ms to minimize.
[2023-03-16 11:39:39] [INFO ] Deduced a trap composed of 232 places in 307 ms of which 0 ms to minimize.
[2023-03-16 11:39:39] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 1 ms to minimize.
[2023-03-16 11:39:39] [INFO ] Deduced a trap composed of 229 places in 284 ms of which 0 ms to minimize.
[2023-03-16 11:39:40] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 1 ms to minimize.
[2023-03-16 11:39:40] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 0 ms to minimize.
[2023-03-16 11:39:40] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 0 ms to minimize.
[2023-03-16 11:39:41] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2023-03-16 11:39:41] [INFO ] Deduced a trap composed of 237 places in 311 ms of which 0 ms to minimize.
[2023-03-16 11:39:42] [INFO ] Deduced a trap composed of 231 places in 295 ms of which 0 ms to minimize.
[2023-03-16 11:39:42] [INFO ] Deduced a trap composed of 241 places in 291 ms of which 0 ms to minimize.
[2023-03-16 11:39:42] [INFO ] Deduced a trap composed of 241 places in 311 ms of which 1 ms to minimize.
[2023-03-16 11:39:43] [INFO ] Deduced a trap composed of 233 places in 296 ms of which 1 ms to minimize.
[2023-03-16 11:39:43] [INFO ] Deduced a trap composed of 244 places in 278 ms of which 1 ms to minimize.
[2023-03-16 11:39:44] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 1 ms to minimize.
[2023-03-16 11:39:44] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:39:45] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 1 ms to minimize.
[2023-03-16 11:39:45] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 1 ms to minimize.
[2023-03-16 11:39:45] [INFO ] Deduced a trap composed of 218 places in 287 ms of which 0 ms to minimize.
[2023-03-16 11:39:46] [INFO ] Deduced a trap composed of 222 places in 284 ms of which 0 ms to minimize.
[2023-03-16 11:39:46] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 0 ms to minimize.
[2023-03-16 11:39:46] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-16 11:39:47] [INFO ] Deduced a trap composed of 222 places in 288 ms of which 0 ms to minimize.
[2023-03-16 11:39:47] [INFO ] Deduced a trap composed of 226 places in 304 ms of which 0 ms to minimize.
[2023-03-16 11:39:47] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 1 ms to minimize.
[2023-03-16 11:39:48] [INFO ] Deduced a trap composed of 230 places in 320 ms of which 2 ms to minimize.
[2023-03-16 11:39:48] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 0 ms to minimize.
[2023-03-16 11:39:48] [INFO ] Deduced a trap composed of 239 places in 286 ms of which 1 ms to minimize.
[2023-03-16 11:39:49] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 1 ms to minimize.
[2023-03-16 11:39:49] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 1 ms to minimize.
[2023-03-16 11:39:50] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 1 ms to minimize.
[2023-03-16 11:39:51] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 1 ms to minimize.
[2023-03-16 11:39:51] [INFO ] Deduced a trap composed of 237 places in 286 ms of which 1 ms to minimize.
[2023-03-16 11:39:51] [INFO ] Deduced a trap composed of 239 places in 276 ms of which 0 ms to minimize.
[2023-03-16 11:39:52] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 0 ms to minimize.
[2023-03-16 11:39:52] [INFO ] Deduced a trap composed of 245 places in 288 ms of which 0 ms to minimize.
[2023-03-16 11:39:52] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 1 ms to minimize.
[2023-03-16 11:39:53] [INFO ] Deduced a trap composed of 228 places in 311 ms of which 0 ms to minimize.
[2023-03-16 11:39:53] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 1 ms to minimize.
[2023-03-16 11:39:54] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 1 ms to minimize.
[2023-03-16 11:39:54] [INFO ] Deduced a trap composed of 241 places in 284 ms of which 1 ms to minimize.
[2023-03-16 11:39:54] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 2 ms to minimize.
[2023-03-16 11:39:55] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 1 ms to minimize.
[2023-03-16 11:39:55] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:39:56] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:39:56] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 0 ms to minimize.
[2023-03-16 11:39:57] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:39:59] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:39:59] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 1 ms to minimize.
[2023-03-16 11:40:00] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 0 ms to minimize.
[2023-03-16 11:40:00] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:40:00] [INFO ] Deduced a trap composed of 234 places in 271 ms of which 0 ms to minimize.
[2023-03-16 11:40:01] [INFO ] Deduced a trap composed of 2 places in 360 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 11:40:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 11:40:01] [INFO ] After 25371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 43 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-16 11:40:01] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 11:40:01] [INFO ] Invariant cache hit.
[2023-03-16 11:40:02] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2023-03-16 11:40:02] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 11:40:02] [INFO ] Invariant cache hit.
[2023-03-16 11:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:40:09] [INFO ] Implicit Places using invariants and state equation in 7382 ms returned []
Implicit Place search using SMT with State Equation took 8452 ms to find 0 implicit places.
[2023-03-16 11:40:09] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-16 11:40:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-16 11:40:09] [INFO ] Invariant cache hit.
[2023-03-16 11:40:10] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9265 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 161 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-16 11:40:10] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-16 11:40:10] [INFO ] [Real]Absence check using 62 positive place invariants in 9 ms returned sat
[2023-03-16 11:40:10] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-16 11:40:10] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 11:40:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 14 ms returned sat
[2023-03-16 11:40:11] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-16 11:40:11] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 11:40:12] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-16 11:40:12] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:40:12] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:40:12] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 1 ms to minimize.
[2023-03-16 11:40:13] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2023-03-16 11:40:13] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-16 11:40:13] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:40:14] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:14] [INFO ] Deduced a trap composed of 238 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:40:14] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:40:14] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 0 ms to minimize.
[2023-03-16 11:40:15] [INFO ] Deduced a trap composed of 229 places in 243 ms of which 1 ms to minimize.
[2023-03-16 11:40:15] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 0 ms to minimize.
[2023-03-16 11:40:15] [INFO ] Deduced a trap composed of 231 places in 251 ms of which 1 ms to minimize.
[2023-03-16 11:40:16] [INFO ] Deduced a trap composed of 231 places in 244 ms of which 1 ms to minimize.
[2023-03-16 11:40:16] [INFO ] Deduced a trap composed of 229 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:40:16] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:40:17] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 1 ms to minimize.
[2023-03-16 11:40:17] [INFO ] Deduced a trap composed of 222 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:40:17] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2023-03-16 11:40:17] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:18] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2023-03-16 11:40:18] [INFO ] Deduced a trap composed of 225 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:40:18] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:40:19] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 1 ms to minimize.
[2023-03-16 11:40:19] [INFO ] Deduced a trap composed of 224 places in 242 ms of which 0 ms to minimize.
[2023-03-16 11:40:19] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-16 11:40:20] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:40:20] [INFO ] Deduced a trap composed of 226 places in 229 ms of which 1 ms to minimize.
[2023-03-16 11:40:20] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:40:20] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:40:21] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-16 11:40:21] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:40:21] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:40:22] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:40:22] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2023-03-16 11:40:22] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:40:23] [INFO ] Deduced a trap composed of 223 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:40:23] [INFO ] Deduced a trap composed of 229 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:40:23] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:40:23] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-16 11:40:24] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-16 11:40:24] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2023-03-16 11:40:25] [INFO ] Deduced a trap composed of 226 places in 294 ms of which 1 ms to minimize.
[2023-03-16 11:40:25] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-16 11:40:26] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-16 11:40:26] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:40:26] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 0 ms to minimize.
[2023-03-16 11:40:27] [INFO ] Deduced a trap composed of 221 places in 266 ms of which 0 ms to minimize.
[2023-03-16 11:40:27] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 0 ms to minimize.
[2023-03-16 11:40:27] [INFO ] Deduced a trap composed of 237 places in 263 ms of which 0 ms to minimize.
[2023-03-16 11:40:28] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:40:28] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:40:29] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 0 ms to minimize.
[2023-03-16 11:40:29] [INFO ] Deduced a trap composed of 222 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:40:30] [INFO ] Deduced a trap composed of 218 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:30] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:40:31] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-16 11:40:31] [INFO ] Deduced a trap composed of 224 places in 289 ms of which 1 ms to minimize.
[2023-03-16 11:40:31] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:40:32] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-16 11:40:32] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2023-03-16 11:40:32] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 0 ms to minimize.
[2023-03-16 11:40:33] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-16 11:40:33] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:33] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 0 ms to minimize.
[2023-03-16 11:40:34] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:34] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:34] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:40:35] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:35] [INFO ] Deduced a trap composed of 226 places in 236 ms of which 1 ms to minimize.
[2023-03-16 11:40:35] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 0 ms to minimize.
[2023-03-16 11:40:35] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 1 ms to minimize.
[2023-03-16 11:40:36] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 1 ms to minimize.
[2023-03-16 11:40:36] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 1 ms to minimize.
[2023-03-16 11:40:36] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:37] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-16 11:40:37] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2023-03-16 11:40:37] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-16 11:40:38] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:40:38] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:40:39] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-16 11:40:39] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 0 ms to minimize.
[2023-03-16 11:40:39] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-16 11:40:40] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-16 11:40:40] [INFO ] Deduced a trap composed of 244 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:40:40] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:41] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 0 ms to minimize.
[2023-03-16 11:40:41] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-16 11:40:41] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-16 11:40:42] [INFO ] Deduced a trap composed of 235 places in 252 ms of which 1 ms to minimize.
[2023-03-16 11:40:45] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-16 11:40:46] [INFO ] Deduced a trap composed of 218 places in 242 ms of which 0 ms to minimize.
[2023-03-16 11:40:47] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:47] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:40:47] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-16 11:40:48] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-16 11:40:48] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 1 ms to minimize.
[2023-03-16 11:40:49] [INFO ] Deduced a trap composed of 220 places in 232 ms of which 1 ms to minimize.
[2023-03-16 11:40:49] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 13 ms to minimize.
[2023-03-16 11:40:49] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 1 ms to minimize.
[2023-03-16 11:40:50] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 7 ms to minimize.
[2023-03-16 11:40:50] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 0 ms to minimize.
[2023-03-16 11:40:50] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 0 ms to minimize.
[2023-03-16 11:40:51] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 1 ms to minimize.
[2023-03-16 11:40:51] [INFO ] Deduced a trap composed of 238 places in 234 ms of which 0 ms to minimize.
[2023-03-16 11:40:51] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 1 ms to minimize.
[2023-03-16 11:40:52] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2023-03-16 11:40:52] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 1 ms to minimize.
[2023-03-16 11:40:52] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-16 11:40:52] [INFO ] Deduced a trap composed of 222 places in 248 ms of which 1 ms to minimize.
[2023-03-16 11:40:53] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-16 11:40:53] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:40:53] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:40:54] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:40:54] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-16 11:40:54] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 1 ms to minimize.
[2023-03-16 11:40:54] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2023-03-16 11:40:55] [INFO ] Deduced a trap composed of 226 places in 234 ms of which 1 ms to minimize.
[2023-03-16 11:40:55] [INFO ] Deduced a trap composed of 226 places in 224 ms of which 1 ms to minimize.
[2023-03-16 11:40:55] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 1 ms to minimize.
[2023-03-16 11:40:56] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-16 11:40:56] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 1 ms to minimize.
[2023-03-16 11:40:56] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2023-03-16 11:40:56] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 0 ms to minimize.
[2023-03-16 11:40:57] [INFO ] Deduced a trap composed of 238 places in 238 ms of which 1 ms to minimize.
[2023-03-16 11:40:57] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2023-03-16 11:40:57] [INFO ] Deduced a trap composed of 240 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:40:58] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-16 11:40:58] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 0 ms to minimize.
[2023-03-16 11:40:58] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2023-03-16 11:40:59] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-16 11:40:59] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 0 ms to minimize.
[2023-03-16 11:40:59] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 0 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 0 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 220 places in 244 ms of which 1 ms to minimize.
[2023-03-16 11:41:00] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2023-03-16 11:41:01] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-16 11:41:01] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 1 ms to minimize.
[2023-03-16 11:41:04] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-16 11:41:04] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 1 ms to minimize.
[2023-03-16 11:41:04] [INFO ] Deduced a trap composed of 226 places in 237 ms of which 1 ms to minimize.
[2023-03-16 11:41:05] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 0 ms to minimize.
[2023-03-16 11:41:14] [INFO ] Trap strengthening (SAT) tested/added 144/144 trap constraints in 62523 ms
[2023-03-16 11:41:15] [INFO ] After 64088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 11:41:15] [INFO ] After 64228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 142 place count 583 transition count 1254
Applied a total of 142 rules in 132 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-16 11:41:15] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-16 11:41:15] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-16 11:41:16] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2023-03-16 11:41:16] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:16] [INFO ] Invariant cache hit.
[2023-03-16 11:41:17] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-16 11:41:17] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:17] [INFO ] Invariant cache hit.
[2023-03-16 11:41:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:41:25] [INFO ] Implicit Places using invariants and state equation in 8664 ms returned []
Implicit Place search using SMT with State Equation took 9329 ms to find 0 implicit places.
[2023-03-16 11:41:25] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-16 11:41:25] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:25] [INFO ] Invariant cache hit.
[2023-03-16 11:41:26] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10885 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), 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:(OR (LT s251 1) (LT s327 1)), p1:(AND (GEQ s3 1) (GEQ s187 1)), p2:(LT s255 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6866 reset in 757 ms.
Product exploration explored 100000 steps with 6867 reset in 672 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 554 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 685 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 11:41:29] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:29] [INFO ] Invariant cache hit.
[2023-03-16 11:41:29] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-16 11:41:29] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-16 11:41:29] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-16 11:41:29] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-16 11:41:29] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-16 11:41:30] [INFO ] After 1074ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-16 11:41:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:41:30] [INFO ] After 281ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-16 11:41:32] [INFO ] Deduced a trap composed of 250 places in 283 ms of which 1 ms to minimize.
[2023-03-16 11:41:33] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 0 ms to minimize.
[2023-03-16 11:41:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 759 ms
[2023-03-16 11:41:33] [INFO ] After 2720ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-16 11:41:33] [INFO ] After 4035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 36 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-16 11:41:33] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:41:33] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-16 11:41:34] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 779 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 187 steps, including 14 resets, run visited all 1 properties in 3 ms. (steps per millisecond=62 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1078 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 36 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-16 11:41:35] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-16 11:41:35] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-16 11:41:36] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
[2023-03-16 11:41:36] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:36] [INFO ] Invariant cache hit.
[2023-03-16 11:41:36] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-16 11:41:36] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:36] [INFO ] Invariant cache hit.
[2023-03-16 11:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:41:45] [INFO ] Implicit Places using invariants and state equation in 8216 ms returned []
Implicit Place search using SMT with State Equation took 8861 ms to find 0 implicit places.
[2023-03-16 11:41:45] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 11:41:45] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:45] [INFO ] Invariant cache hit.
[2023-03-16 11:41:45] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10333 ms. Remains : 583/583 places, 1254/1254 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 1039 steps, including 69 resets, run visited all 3 properties in 19 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6822 reset in 628 ms.
Product exploration explored 100000 steps with 6844 reset in 667 ms.
Built C files in :
/tmp/ltsmin11134767121149755555
[2023-03-16 11:41:48] [INFO ] Computing symmetric may disable matrix : 1254 transitions.
[2023-03-16 11:41:48] [INFO ] Computation of Complete disable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:41:48] [INFO ] Computing symmetric may enable matrix : 1254 transitions.
[2023-03-16 11:41:48] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:41:48] [INFO ] Computing Do-Not-Accords matrix : 1254 transitions.
[2023-03-16 11:41:48] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:41:48] [INFO ] Built C files in 443ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11134767121149755555
Running compilation step : cd /tmp/ltsmin11134767121149755555;'/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/ltsmin11134767121149755555;'/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/ltsmin11134767121149755555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 41 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-16 11:41:51] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:51] [INFO ] Invariant cache hit.
[2023-03-16 11:41:52] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
[2023-03-16 11:41:52] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:52] [INFO ] Invariant cache hit.
[2023-03-16 11:41:53] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-16 11:41:53] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:41:53] [INFO ] Invariant cache hit.
[2023-03-16 11:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:42:00] [INFO ] Implicit Places using invariants and state equation in 7114 ms returned []
Implicit Place search using SMT with State Equation took 7755 ms to find 0 implicit places.
[2023-03-16 11:42:00] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 11:42:00] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-16 11:42:00] [INFO ] Invariant cache hit.
[2023-03-16 11:42:00] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9276 ms. Remains : 583/583 places, 1254/1254 transitions.
Built C files in :
/tmp/ltsmin9641503835907583679
[2023-03-16 11:42:00] [INFO ] Computing symmetric may disable matrix : 1254 transitions.
[2023-03-16 11:42:01] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:42:01] [INFO ] Computing symmetric may enable matrix : 1254 transitions.
[2023-03-16 11:42:01] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:42:01] [INFO ] Computing Do-Not-Accords matrix : 1254 transitions.
[2023-03-16 11:42:01] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:42:01] [INFO ] Built C files in 382ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9641503835907583679
Running compilation step : cd /tmp/ltsmin9641503835907583679;'/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/ltsmin9641503835907583679;'/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/ltsmin9641503835907583679;'/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-16 11:42:04] [INFO ] Flatten gal took : 68 ms
[2023-03-16 11:42:04] [INFO ] Flatten gal took : 68 ms
[2023-03-16 11:42:04] [INFO ] Time to serialize gal into /tmp/LTL10115729970286905012.gal : 19 ms
[2023-03-16 11:42:04] [INFO ] Time to serialize properties into /tmp/LTL15111688212944682176.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/LTL10115729970286905012.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5728685890519893040.hoa' '-atoms' '/tmp/LTL15111688212944682176.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15111688212944682176.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5728685890519893040.hoa
Detected timeout of ITS tools.
[2023-03-16 11:42:19] [INFO ] Flatten gal took : 58 ms
[2023-03-16 11:42:19] [INFO ] Flatten gal took : 57 ms
[2023-03-16 11:42:19] [INFO ] Time to serialize gal into /tmp/LTL2879044478880828827.gal : 11 ms
[2023-03-16 11:42:19] [INFO ] Time to serialize properties into /tmp/LTL2310156703300020276.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/LTL2879044478880828827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2310156703300020276.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...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE_1<1)||(place_458<1))"))&&(F((G("((JobCnt>=1)&&(place_782_1>=1))"))||(G("(place_787_1<1)")))))))
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE_1<1)||(place_458<1))" | G(F!"((JobCnt>=1)&&(place_782_1>=1))" & F!"(place_787_1<1)"))
Detected timeout of ITS tools.
[2023-03-16 11:42:35] [INFO ] Flatten gal took : 54 ms
[2023-03-16 11:42:35] [INFO ] Applying decomposition
[2023-03-16 11:42:35] [INFO ] Flatten gal took : 55 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/graph5774710278655763403.txt' '-o' '/tmp/graph5774710278655763403.bin' '-w' '/tmp/graph5774710278655763403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5774710278655763403.bin' '-l' '-1' '-v' '-w' '/tmp/graph5774710278655763403.weights' '-q' '0' '-e' '0.001'
[2023-03-16 11:42:35] [INFO ] Decomposing Gal with order
[2023-03-16 11:42:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 11:42:35] [INFO ] Removed a total of 3070 redundant transitions.
[2023-03-16 11:42:35] [INFO ] Flatten gal took : 238 ms
[2023-03-16 11:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 49 ms.
[2023-03-16 11:42:35] [INFO ] Time to serialize gal into /tmp/LTL3477577067960076794.gal : 17 ms
[2023-03-16 11:42:35] [INFO ] Time to serialize properties into /tmp/LTL14668265555550544088.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/LTL3477577067960076794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14668265555550544088.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 : !((G((F("((i13.u27.NotifyEventJobQueuedE_1<1)||(i13.u27.place_458<1))"))&&(F((G("((i0.u0.JobCnt>=1)&&(i3.u4.place_782_1>=1))"))||(G("(...185
Formula 0 simplified : F(G!"((i13.u27.NotifyEventJobQueuedE_1<1)||(i13.u27.place_458<1))" | G(F!"((i0.u0.JobCnt>=1)&&(i3.u4.place_782_1>=1))" & F!"(i13.u24...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15324384544972462243
[2023-03-16 11:42:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15324384544972462243
Running compilation step : cd /tmp/ltsmin15324384544972462243;'/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'
Compilation finished in 2630 ms.
Running link step : cd /tmp/ltsmin15324384544972462243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15324384544972462243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 110487 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(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 75 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-16 11:43:06] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-16 11:43:06] [INFO ] Computed 92 place invariants in 22 ms
[2023-03-16 11:43:06] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
[2023-03-16 11:43:06] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 11:43:06] [INFO ] Invariant cache hit.
[2023-03-16 11:43:07] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-16 11:43:07] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 11:43:07] [INFO ] Invariant cache hit.
[2023-03-16 11:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:12] [INFO ] Implicit Places using invariants and state equation in 4812 ms returned []
Implicit Place search using SMT with State Equation took 5304 ms to find 0 implicit places.
[2023-03-16 11:43:12] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 11:43:12] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-16 11:43:12] [INFO ] Invariant cache hit.
[2023-03-16 11:43:13] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7112 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s135 1) (GEQ s572 1)) (AND (GEQ s441 1) (GEQ s555 1)) (AND (GEQ s165 1) (GEQ s485 1)) (AND (GEQ s19 1) (GEQ s47 1)) (AND (GEQ s256 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-01 finished in 7237 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))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 84 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-16 11:43:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-16 11:43:13] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 11:43:14] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
[2023-03-16 11:43:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:43:14] [INFO ] Invariant cache hit.
[2023-03-16 11:43:14] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-16 11:43:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:43:14] [INFO ] Invariant cache hit.
[2023-03-16 11:43:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:25] [INFO ] Implicit Places using invariants and state equation in 10845 ms returned []
Implicit Place search using SMT with State Equation took 11429 ms to find 0 implicit places.
[2023-03-16 11:43:25] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 11:43:25] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:43:25] [INFO ] Invariant cache hit.
[2023-03-16 11:43:26] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13053 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s88 8) (GEQ s333 2) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s96 1) (GEQ s182 1) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s98 1) (GEQ s411 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 13126 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 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1257
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 77 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-16 11:43:26] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-16 11:43:26] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-16 11:43:27] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
[2023-03-16 11:43:27] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 11:43:27] [INFO ] Invariant cache hit.
[2023-03-16 11:43:27] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-16 11:43:27] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 11:43:27] [INFO ] Invariant cache hit.
[2023-03-16 11:43:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:37] [INFO ] Implicit Places using invariants and state equation in 10104 ms returned []
Implicit Place search using SMT with State Equation took 10780 ms to find 0 implicit places.
[2023-03-16 11:43:37] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 11:43:37] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-16 11:43:37] [INFO ] Invariant cache hit.
[2023-03-16 11:43:38] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12307 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s122 1) (LT s494 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 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-03 finished in 12415 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((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 146 place count 581 transition count 1252
Applied a total of 146 rules in 82 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-16 11:43:38] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-16 11:43:38] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-16 11:43:39] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
[2023-03-16 11:43:39] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:39] [INFO ] Invariant cache hit.
[2023-03-16 11:43:40] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-16 11:43:40] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:40] [INFO ] Invariant cache hit.
[2023-03-16 11:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:49] [INFO ] Implicit Places using invariants and state equation in 9227 ms returned []
Implicit Place search using SMT with State Equation took 9891 ms to find 0 implicit places.
[2023-03-16 11:43:49] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-16 11:43:49] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-16 11:43:49] [INFO ] Invariant cache hit.
[2023-03-16 11:43:50] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11316 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s67 1) (GEQ s144 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s483 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s92 1) (GEQ s534 1)) (AND (GEQ s67 1)...], nbAcceptance=1, 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 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-04 finished in 11471 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(p0) U p1)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 28 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 11:43:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-16 11:43:50] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-16 11:43:51] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
[2023-03-16 11:43:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:43:51] [INFO ] Invariant cache hit.
[2023-03-16 11:43:51] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-16 11:43:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:43:51] [INFO ] Invariant cache hit.
[2023-03-16 11:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:43:57] [INFO ] Implicit Places using invariants and state equation in 5263 ms returned []
Implicit Place search using SMT with State Equation took 5740 ms to find 0 implicit places.
[2023-03-16 11:43:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:43:57] [INFO ] Invariant cache hit.
[2023-03-16 11:43:58] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7962 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s102 7) (GEQ s180 1) (GEQ s511 1) (GEQ s572 1) (GEQ s647 1)) (AND (GEQ s102 7) (GEQ s111 2) (GEQ s437 1) (GEQ s572 1)) (AND (GEQ s102 7) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-07 finished in 8260 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)||G(p1))))'
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 93 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-16 11:43:58] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-16 11:43:58] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-16 11:43:59] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
[2023-03-16 11:43:59] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:43:59] [INFO ] Invariant cache hit.
[2023-03-16 11:44:00] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-16 11:44:00] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:00] [INFO ] Invariant cache hit.
[2023-03-16 11:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:06] [INFO ] Implicit Places using invariants and state equation in 6831 ms returned []
Implicit Place search using SMT with State Equation took 7494 ms to find 0 implicit places.
[2023-03-16 11:44:06] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 11:44:06] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:06] [INFO ] Invariant cache hit.
[2023-03-16 11:44:07] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8987 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s119 1) (GEQ s299 1) (GEQ s310 1)), p1:(LT s357 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7233 reset in 771 ms.
Product exploration explored 100000 steps with 7212 reset in 792 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 11:44:09] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:09] [INFO ] Invariant cache hit.
[2023-03-16 11:44:09] [INFO ] [Real]Absence check using 62 positive place invariants in 14 ms returned sat
[2023-03-16 11:44:09] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-16 11:44:09] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 416 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Support contains 1 out of 582 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 30 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-16 11:44:10] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:10] [INFO ] Invariant cache hit.
[2023-03-16 11:44:10] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
[2023-03-16 11:44:10] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:10] [INFO ] Invariant cache hit.
[2023-03-16 11:44:11] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-16 11:44:11] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:11] [INFO ] Invariant cache hit.
[2023-03-16 11:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:18] [INFO ] Implicit Places using invariants and state equation in 7100 ms returned []
Implicit Place search using SMT with State Equation took 7743 ms to find 0 implicit places.
[2023-03-16 11:44:18] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 11:44:18] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:18] [INFO ] Invariant cache hit.
[2023-03-16 11:44:19] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9136 ms. Remains : 582/582 places, 1253/1253 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Finished random walk after 440 steps, including 37 resets, run visited all 1 properties in 6 ms. (steps per millisecond=73 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7294 reset in 699 ms.
Product exploration explored 100000 steps with 7275 reset in 741 ms.
Built C files in :
/tmp/ltsmin11535903910533422621
[2023-03-16 11:44:21] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2023-03-16 11:44:21] [INFO ] Computation of Complete disable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:21] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2023-03-16 11:44:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:21] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2023-03-16 11:44:21] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:21] [INFO ] Built C files in 363ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11535903910533422621
Running compilation step : cd /tmp/ltsmin11535903910533422621;'/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/ltsmin11535903910533422621;'/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/ltsmin11535903910533422621;'/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 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 38 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-16 11:44:24] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:24] [INFO ] Invariant cache hit.
[2023-03-16 11:44:25] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2023-03-16 11:44:25] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:25] [INFO ] Invariant cache hit.
[2023-03-16 11:44:26] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-16 11:44:26] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:26] [INFO ] Invariant cache hit.
[2023-03-16 11:44:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:44:34] [INFO ] Implicit Places using invariants and state equation in 8352 ms returned []
Implicit Place search using SMT with State Equation took 8998 ms to find 0 implicit places.
[2023-03-16 11:44:34] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 11:44:34] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-16 11:44:34] [INFO ] Invariant cache hit.
[2023-03-16 11:44:35] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10366 ms. Remains : 582/582 places, 1253/1253 transitions.
Built C files in :
/tmp/ltsmin10431914705857807924
[2023-03-16 11:44:35] [INFO ] Computing symmetric may disable matrix : 1253 transitions.
[2023-03-16 11:44:35] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:35] [INFO ] Computing symmetric may enable matrix : 1253 transitions.
[2023-03-16 11:44:35] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:35] [INFO ] Computing Do-Not-Accords matrix : 1253 transitions.
[2023-03-16 11:44:35] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:44:35] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10431914705857807924
Running compilation step : cd /tmp/ltsmin10431914705857807924;'/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/ltsmin10431914705857807924;'/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/ltsmin10431914705857807924;'/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-16 11:44:38] [INFO ] Flatten gal took : 57 ms
[2023-03-16 11:44:38] [INFO ] Flatten gal took : 89 ms
[2023-03-16 11:44:38] [INFO ] Time to serialize gal into /tmp/LTL13099020055157273198.gal : 9 ms
[2023-03-16 11:44:38] [INFO ] Time to serialize properties into /tmp/LTL4706589369599309880.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/LTL13099020055157273198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8462925176029905498.hoa' '-atoms' '/tmp/LTL4706589369599309880.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4706589369599309880.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8462925176029905498.hoa
Detected timeout of ITS tools.
[2023-03-16 11:44:53] [INFO ] Flatten gal took : 60 ms
[2023-03-16 11:44:53] [INFO ] Flatten gal took : 52 ms
[2023-03-16 11:44:53] [INFO ] Time to serialize gal into /tmp/LTL13042259461250710683.gal : 12 ms
[2023-03-16 11:44:54] [INFO ] Time to serialize properties into /tmp/LTL2150699553769758320.ltl : 179 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/LTL13042259461250710683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2150699553769758320.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("(((FetchJobB_1>=1)&&(f2_6>=1))&&(mo2>=1))"))||(G("(place_518_1<1)")))))
Formula 0 simplified : G(F!"(((FetchJobB_1>=1)&&(f2_6>=1))&&(mo2>=1))" & F!"(place_518_1<1)")
Detected timeout of ITS tools.
[2023-03-16 11:45:09] [INFO ] Flatten gal took : 53 ms
[2023-03-16 11:45:09] [INFO ] Applying decomposition
[2023-03-16 11:45:09] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12948286283477648980.txt' '-o' '/tmp/graph12948286283477648980.bin' '-w' '/tmp/graph12948286283477648980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12948286283477648980.bin' '-l' '-1' '-v' '-w' '/tmp/graph12948286283477648980.weights' '-q' '0' '-e' '0.001'
[2023-03-16 11:45:09] [INFO ] Decomposing Gal with order
[2023-03-16 11:45:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 11:45:09] [INFO ] Removed a total of 3067 redundant transitions.
[2023-03-16 11:45:09] [INFO ] Flatten gal took : 121 ms
[2023-03-16 11:45:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 41 ms.
[2023-03-16 11:45:09] [INFO ] Time to serialize gal into /tmp/LTL9011805357826435098.gal : 11 ms
[2023-03-16 11:45:09] [INFO ] Time to serialize properties into /tmp/LTL2850534878100228797.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/LTL9011805357826435098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2850534878100228797.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...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i10.u13.FetchJobB_1>=1)&&(i10.u13.f2_6>=1))&&(i10.u13.mo2>=1))"))||(G("(i14.u9.place_518_1<1)")))))
Formula 0 simplified : G(F!"(((i10.u13.FetchJobB_1>=1)&&(i10.u13.f2_6>=1))&&(i10.u13.mo2>=1))" & F!"(i14.u9.place_518_1<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18291268047747456733
[2023-03-16 11:45:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18291268047747456733
Running compilation step : cd /tmp/ltsmin18291268047747456733;'/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'
Compilation finished in 2511 ms.
Running link step : cd /tmp/ltsmin18291268047747456733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18291268047747456733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-10 finished in 101248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((p1 U p2)||F((p3||X(p3)))))))'
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 655 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 654 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 654 transition count 1324
Applied a total of 11 rules in 39 ms. Remains 654 /664 variables (removed 10) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 11:45:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 654 cols
[2023-03-16 11:45:39] [INFO ] Computed 83 place invariants in 21 ms
[2023-03-16 11:45:40] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
[2023-03-16 11:45:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:45:40] [INFO ] Invariant cache hit.
[2023-03-16 11:45:41] [INFO ] Implicit Places using invariants in 664 ms returned []
[2023-03-16 11:45:41] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:45:41] [INFO ] Invariant cache hit.
[2023-03-16 11:45:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:45:49] [INFO ] Implicit Places using invariants and state equation in 8197 ms returned []
Implicit Place search using SMT with State Equation took 8863 ms to find 0 implicit places.
[2023-03-16 11:45:49] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:45:49] [INFO ] Invariant cache hit.
[2023-03-16 11:45:50] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11025 ms. Remains : 654/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LT s475 1), p2:(AND (GEQ s102 1) (GEQ s133 1) (GEQ s174 1) (GEQ s599 1)), p1:(GEQ s143 1), p0:(AND (GEQ s102 7) (GEQ s181 1) (GEQ s375 1) (GEQ s446 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 913 ms.
Product exploration explored 100000 steps with 50000 reset in 894 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-12 finished in 13243 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((G(F(p0))||(!p0&&F(p0))))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 36 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 11:45:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-16 11:45:53] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-16 11:45:54] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
[2023-03-16 11:45:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:45:54] [INFO ] Invariant cache hit.
[2023-03-16 11:45:54] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-16 11:45:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:45:54] [INFO ] Invariant cache hit.
[2023-03-16 11:45:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:46:02] [INFO ] Implicit Places using invariants and state equation in 8034 ms returned []
Implicit Place search using SMT with State Equation took 8731 ms to find 0 implicit places.
[2023-03-16 11:46:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:46:02] [INFO ] Invariant cache hit.
[2023-03-16 11:46:03] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10923 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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 s79 1) (GEQ s141 1) (GEQ s603 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 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-13 finished in 11074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||(p1 U X(p2)))))'
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 34 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-16 11:46:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:46:04] [INFO ] Invariant cache hit.
[2023-03-16 11:46:05] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
[2023-03-16 11:46:05] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:46:05] [INFO ] Invariant cache hit.
[2023-03-16 11:46:05] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-16 11:46:05] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:46:05] [INFO ] Invariant cache hit.
[2023-03-16 11:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 11:46:15] [INFO ] Implicit Places using invariants and state equation in 9509 ms returned []
Implicit Place search using SMT with State Equation took 10175 ms to find 0 implicit places.
[2023-03-16 11:46:15] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-16 11:46:15] [INFO ] Invariant cache hit.
[2023-03-16 11:46:16] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12325 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s366 1)), p1:(OR (AND (GEQ s284 1) (GEQ s366 1)) (NOT (AND (GEQ s102 7) (GEQ s111 1) (GEQ s437 1) (GEQ s462 1) (GEQ s572 1)))), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-14 finished in 12577 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)&&F((G(p1)||G(p2))))))'
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)||G(p1))))'
[2023-03-16 11:46:17] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3018824484545557350
[2023-03-16 11:46:17] [INFO ] Computing symmetric may disable matrix : 1325 transitions.
[2023-03-16 11:46:17] [INFO ] Applying decomposition
[2023-03-16 11:46:17] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:46:17] [INFO ] Computing symmetric may enable matrix : 1325 transitions.
[2023-03-16 11:46:17] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:46:17] [INFO ] Flatten gal took : 58 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/graph2459367027652770714.txt' '-o' '/tmp/graph2459367027652770714.bin' '-w' '/tmp/graph2459367027652770714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2459367027652770714.bin' '-l' '-1' '-v' '-w' '/tmp/graph2459367027652770714.weights' '-q' '0' '-e' '0.001'
[2023-03-16 11:46:17] [INFO ] Decomposing Gal with order
[2023-03-16 11:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 11:46:17] [INFO ] Removed a total of 1291 redundant transitions.
[2023-03-16 11:46:17] [INFO ] Computing Do-Not-Accords matrix : 1325 transitions.
[2023-03-16 11:46:17] [INFO ] Flatten gal took : 105 ms
[2023-03-16 11:46:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 23 ms.
[2023-03-16 11:46:17] [INFO ] Time to serialize gal into /tmp/LTLFireability15650621558969338463.gal : 14 ms
[2023-03-16 11:46:17] [INFO ] Time to serialize properties into /tmp/LTLFireability205211129568986480.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/LTLFireability15650621558969338463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability205211129568986480.ltl' '-c' '-stutter-deadlock'
[2023-03-16 11:46:17] [INFO ] Computation of Completed DNA matrix. took 72 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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 2 LTL properties
[2023-03-16 11:46:17] [INFO ] Built C files in 526ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3018824484545557350
Running compilation step : cd /tmp/ltsmin3018824484545557350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((G((F("((i2.i1.u39.NotifyEventJobQueuedE_1<1)||(u57.place_458<1))"))&&(F((G("((i0.u0.JobCnt>=1)&&(i2.i1.u19.place_782_1>=1))"))||(G(...188
Formula 0 simplified : F(G!"((i2.i1.u39.NotifyEventJobQueuedE_1<1)||(u57.place_458<1))" | G(F!"((i0.u0.JobCnt>=1)&&(i2.i1.u19.place_782_1>=1))" & F!"(i2.i0...176
Compilation finished in 5958 ms.
Running link step : cd /tmp/ltsmin3018824484545557350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin3018824484545557350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 12:08:53] [INFO ] Flatten gal took : 172 ms
[2023-03-16 12:08:53] [INFO ] Time to serialize gal into /tmp/LTLFireability17168634648667202921.gal : 10 ms
[2023-03-16 12:08:53] [INFO ] Time to serialize properties into /tmp/LTLFireability13885786362347124495.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/LTLFireability17168634648667202921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13885786362347124495.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE_1<1)||(place_458<1))"))&&(F((G("((JobCnt>=1)&&(place_782_1>=1))"))||(G("(place_787_1<1)")))))))
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE_1<1)||(place_458<1))" | G(F!"((JobCnt>=1)&&(place_782_1>=1))" & F!"(place_787_1<1)"))
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin3018824484545557350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>(([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin3018824484545557350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp3==true))||[]((LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 12:31:29] [INFO ] Flatten gal took : 174 ms
[2023-03-16 12:31:29] [INFO ] Input system was already deterministic with 1325 transitions.
[2023-03-16 12:31:30] [INFO ] Transformed 664 places.
[2023-03-16 12:31:30] [INFO ] Transformed 1325 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-16 12:32:00] [INFO ] Time to serialize gal into /tmp/LTLFireability5263473586542913372.gal : 9 ms
[2023-03-16 12:32:00] [INFO ] Time to serialize properties into /tmp/LTLFireability11587947463602025008.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/LTLFireability5263473586542913372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11587947463602025008.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((NotifyEventJobQueuedE_1<1)||(place_458<1))"))&&(F((G("((JobCnt>=1)&&(place_782_1>=1))"))||(G("(place_787_1<1)")))))))
Formula 0 simplified : F(G!"((NotifyEventJobQueuedE_1<1)||(place_458<1))" | G(F!"((JobCnt>=1)&&(place_782_1>=1))" & F!"(place_787_1<1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9608536 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15216352 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r293-tall-167873945900764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 ;