Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460700233.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.8K Apr 12 09:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 12 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717125789416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 03:23:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 03:23:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:23:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 03:23:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:23:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1548 ms
[2024-05-31 03:23:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 03:23:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 22 ms.
[2024-05-31 03:23:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 799 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 20) seen :9
Incomplete Best-First random walk after 10001 steps, including 244 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:23:18] [INFO ] Computed 13 invariants in 4 ms
[2024-05-31 03:23:18] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2024-05-31 03:23:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:23:18] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 03:23:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:23:18] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 03:23:18] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 22 ms to minimize.
[2024-05-31 03:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-31 03:23:18] [INFO ] After 154ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:23:18] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:23:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2024-05-31 03:23:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-31 03:23:19] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:23:19] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:23:19] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2024-05-31 03:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-05-31 03:23:19] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-31 03:23:19] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
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 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
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 21 place count 37 transition count 28
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 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 40 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-05-31 03:23:19] [INFO ] Computed 12 invariants in 11 ms
[2024-05-31 03:23:19] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 1171 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 360 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Probably explored full state space saw : 335 states, properties seen :0
Probabilistic random walk after 889 steps, saw 335 distinct states, run finished after 28 ms. (steps per millisecond=31 ) properties seen :0
Explored full state space saw : 335 states, properties seen :0
Exhaustive walk after 889 steps, saw 335 distinct states, run finished after 3 ms. (steps per millisecond=296 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 03:23:20] [INFO ] Flatten gal took : 76 ms
[2024-05-31 03:23:20] [INFO ] Flatten gal took : 5 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 03:23:20] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 147 ms.
[2024-05-31 03:23:20] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-31 03:23:20] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-31 03:23:20] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 03:23:20] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-31 03:23:20] [INFO ] Reduced 90 identical enabling conditions.
Deduced a syphon composed of 30 places in 39 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 258 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Applied a total of 0 rules in 69 ms. Remains 489 /489 variables (removed 0) and now considering 745/745 (removed 0) transitions.
[2024-05-31 03:23:20] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-31 03:23:20] [INFO ] Computed 82 invariants in 168 ms
[2024-05-31 03:23:24] [INFO ] Dead Transitions using invariants and state equation in 3484 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-05-31 03:23:24] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 489 cols
[2024-05-31 03:23:24] [INFO ] Computed 82 invariants in 53 ms
[2024-05-31 03:23:25] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-31 03:23:25] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:23:25] [INFO ] Invariant cache hit.
[2024-05-31 03:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:23:37] [INFO ] Implicit Places using invariants and state equation in 12006 ms returned []
Implicit Place search using SMT with State Equation took 13259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/489 places, 650/745 transitions.
Applied a total of 0 rules in 38 ms. Remains 489 /489 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16858 ms. Remains : 489/489 places, 650/745 transitions.
Support contains 258 out of 489 places after structural reductions.
[2024-05-31 03:23:37] [INFO ] Flatten gal took : 239 ms
[2024-05-31 03:23:38] [INFO ] Flatten gal took : 221 ms
[2024-05-31 03:23:38] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 695 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 159 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-31 03:23:39] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:23:39] [INFO ] Invariant cache hit.
[2024-05-31 03:23:40] [INFO ] [Real]Absence check using 75 positive place invariants in 345 ms returned sat
[2024-05-31 03:23:40] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 03:23:44] [INFO ] After 4402ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 03:23:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 29 ms returned sat
[2024-05-31 03:23:44] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-31 03:23:45] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-31 03:23:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:23:45] [INFO ] After 177ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-31 03:23:45] [INFO ] Deduced a trap composed of 267 places in 382 ms of which 3 ms to minimize.
[2024-05-31 03:23:46] [INFO ] Deduced a trap composed of 256 places in 390 ms of which 2 ms to minimize.
[2024-05-31 03:23:46] [INFO ] Deduced a trap composed of 251 places in 374 ms of which 13 ms to minimize.
[2024-05-31 03:23:47] [INFO ] Deduced a trap composed of 258 places in 418 ms of which 1 ms to minimize.
[2024-05-31 03:23:47] [INFO ] Deduced a trap composed of 254 places in 343 ms of which 29 ms to minimize.
[2024-05-31 03:23:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2322 ms
[2024-05-31 03:23:48] [INFO ] Deduced a trap composed of 201 places in 329 ms of which 1 ms to minimize.
[2024-05-31 03:23:48] [INFO ] Deduced a trap composed of 210 places in 311 ms of which 1 ms to minimize.
[2024-05-31 03:23:49] [INFO ] Deduced a trap composed of 204 places in 380 ms of which 1 ms to minimize.
[2024-05-31 03:23:52] [INFO ] Deduced a trap composed of 204 places in 3566 ms of which 1 ms to minimize.
[2024-05-31 03:23:56] [INFO ] Deduced a trap composed of 198 places in 3772 ms of which 1 ms to minimize.
[2024-05-31 03:23:56] [INFO ] Deduced a trap composed of 198 places in 390 ms of which 1 ms to minimize.
[2024-05-31 03:23:57] [INFO ] Deduced a trap composed of 210 places in 385 ms of which 1 ms to minimize.
[2024-05-31 03:24:05] [INFO ] Deduced a trap composed of 204 places in 8290 ms of which 9 ms to minimize.
[2024-05-31 03:24:06] [INFO ] Deduced a trap composed of 192 places in 272 ms of which 0 ms to minimize.
[2024-05-31 03:24:06] [INFO ] Deduced a trap composed of 201 places in 314 ms of which 0 ms to minimize.
[2024-05-31 03:24:12] [INFO ] Deduced a trap composed of 204 places in 5516 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:24:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:24:12] [INFO ] After 27863ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 40 rules applied. Total rules applied 40 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 75 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 75 place count 449 transition count 581
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 143 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 414 transition count 580
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 149 place count 412 transition count 578
Applied a total of 149 rules in 364 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 03:24:12] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:24:12] [INFO ] Computed 77 invariants in 42 ms
[2024-05-31 03:24:13] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1880 ms. Remains : 412/489 places, 578/650 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:24:14] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:24:14] [INFO ] Invariant cache hit.
[2024-05-31 03:24:14] [INFO ] [Real]Absence check using 70 positive place invariants in 62 ms returned sat
[2024-05-31 03:24:14] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-31 03:24:14] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:24:14] [INFO ] [Nat]Absence check using 70 positive place invariants in 360 ms returned sat
[2024-05-31 03:24:14] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 03:24:15] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:24:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:24:15] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:24:15] [INFO ] Deduced a trap composed of 90 places in 278 ms of which 1 ms to minimize.
[2024-05-31 03:24:16] [INFO ] Deduced a trap composed of 139 places in 267 ms of which 1 ms to minimize.
[2024-05-31 03:24:16] [INFO ] Deduced a trap composed of 127 places in 349 ms of which 27 ms to minimize.
[2024-05-31 03:24:16] [INFO ] Deduced a trap composed of 129 places in 254 ms of which 1 ms to minimize.
[2024-05-31 03:24:17] [INFO ] Deduced a trap composed of 181 places in 279 ms of which 1 ms to minimize.
[2024-05-31 03:24:17] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 1 ms to minimize.
[2024-05-31 03:24:17] [INFO ] Deduced a trap composed of 163 places in 236 ms of which 1 ms to minimize.
[2024-05-31 03:24:18] [INFO ] Deduced a trap composed of 135 places in 245 ms of which 1 ms to minimize.
[2024-05-31 03:24:24] [INFO ] Deduced a trap composed of 129 places in 5872 ms of which 2 ms to minimize.
[2024-05-31 03:24:24] [INFO ] Deduced a trap composed of 117 places in 278 ms of which 1 ms to minimize.
[2024-05-31 03:24:24] [INFO ] Deduced a trap composed of 123 places in 475 ms of which 23 ms to minimize.
[2024-05-31 03:24:25] [INFO ] Deduced a trap composed of 120 places in 239 ms of which 0 ms to minimize.
[2024-05-31 03:24:25] [INFO ] Deduced a trap composed of 138 places in 248 ms of which 2 ms to minimize.
[2024-05-31 03:24:25] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:24:26] [INFO ] Deduced a trap composed of 129 places in 263 ms of which 35 ms to minimize.
[2024-05-31 03:24:26] [INFO ] Deduced a trap composed of 126 places in 240 ms of which 4 ms to minimize.
[2024-05-31 03:24:26] [INFO ] Deduced a trap composed of 132 places in 252 ms of which 1 ms to minimize.
[2024-05-31 03:24:27] [INFO ] Deduced a trap composed of 132 places in 223 ms of which 1 ms to minimize.
[2024-05-31 03:24:27] [INFO ] Deduced a trap composed of 135 places in 244 ms of which 1 ms to minimize.
[2024-05-31 03:24:27] [INFO ] Deduced a trap composed of 117 places in 366 ms of which 1 ms to minimize.
[2024-05-31 03:24:27] [INFO ] Deduced a trap composed of 126 places in 253 ms of which 29 ms to minimize.
[2024-05-31 03:24:28] [INFO ] Deduced a trap composed of 144 places in 260 ms of which 1 ms to minimize.
[2024-05-31 03:24:28] [INFO ] Deduced a trap composed of 117 places in 247 ms of which 0 ms to minimize.
[2024-05-31 03:24:29] [INFO ] Deduced a trap composed of 126 places in 259 ms of which 1 ms to minimize.
[2024-05-31 03:24:29] [INFO ] Deduced a trap composed of 129 places in 244 ms of which 1 ms to minimize.
[2024-05-31 03:24:29] [INFO ] Deduced a trap composed of 135 places in 258 ms of which 1 ms to minimize.
[2024-05-31 03:24:29] [INFO ] Deduced a trap composed of 132 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:24:30] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 1 ms to minimize.
[2024-05-31 03:24:30] [INFO ] Deduced a trap composed of 123 places in 339 ms of which 1 ms to minimize.
[2024-05-31 03:24:31] [INFO ] Deduced a trap composed of 121 places in 293 ms of which 1 ms to minimize.
[2024-05-31 03:24:31] [INFO ] Deduced a trap composed of 129 places in 294 ms of which 1 ms to minimize.
[2024-05-31 03:24:31] [INFO ] Deduced a trap composed of 120 places in 264 ms of which 1 ms to minimize.
[2024-05-31 03:24:32] [INFO ] Deduced a trap composed of 123 places in 270 ms of which 1 ms to minimize.
[2024-05-31 03:24:32] [INFO ] Deduced a trap composed of 132 places in 293 ms of which 1 ms to minimize.
[2024-05-31 03:24:32] [INFO ] Deduced a trap composed of 126 places in 323 ms of which 1 ms to minimize.
[2024-05-31 03:24:33] [INFO ] Deduced a trap composed of 141 places in 277 ms of which 1 ms to minimize.
[2024-05-31 03:24:34] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 10 ms to minimize.
[2024-05-31 03:24:37] [INFO ] Deduced a trap composed of 120 places in 3535 ms of which 1 ms to minimize.
[2024-05-31 03:24:38] [INFO ] Deduced a trap composed of 129 places in 302 ms of which 1 ms to minimize.
[2024-05-31 03:24:39] [INFO ] Deduced a trap composed of 138 places in 273 ms of which 0 ms to minimize.
[2024-05-31 03:24:39] [INFO ] Deduced a trap composed of 118 places in 262 ms of which 0 ms to minimize.
[2024-05-31 03:24:39] [INFO ] Deduced a trap composed of 135 places in 293 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:24:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:24:39] [INFO ] After 25312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 412 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 411 transition count 577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 411 transition count 576
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 4 place count 410 transition count 576
Applied a total of 4 rules in 119 ms. Remains 410 /412 variables (removed 2) and now considering 576/578 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 410/412 places, 576/578 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 377034 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 377034 steps, saw 112899 distinct states, run finished after 3015 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:24:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2024-05-31 03:24:43] [INFO ] Computed 77 invariants in 14 ms
[2024-05-31 03:24:43] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned sat
[2024-05-31 03:24:43] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 03:24:43] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:24:43] [INFO ] [Nat]Absence check using 70 positive place invariants in 32 ms returned sat
[2024-05-31 03:24:43] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-31 03:24:43] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:24:43] [INFO ] After 97ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 03:24:44] [INFO ] Deduced a trap composed of 128 places in 266 ms of which 1 ms to minimize.
[2024-05-31 03:24:44] [INFO ] Deduced a trap composed of 137 places in 298 ms of which 1 ms to minimize.
[2024-05-31 03:24:44] [INFO ] Deduced a trap composed of 125 places in 310 ms of which 35 ms to minimize.
[2024-05-31 03:24:45] [INFO ] Deduced a trap composed of 122 places in 231 ms of which 0 ms to minimize.
[2024-05-31 03:24:47] [INFO ] Deduced a trap composed of 134 places in 2713 ms of which 25 ms to minimize.
[2024-05-31 03:24:50] [INFO ] Deduced a trap composed of 134 places in 2865 ms of which 2 ms to minimize.
[2024-05-31 03:24:51] [INFO ] Deduced a trap composed of 131 places in 233 ms of which 6 ms to minimize.
[2024-05-31 03:24:51] [INFO ] Deduced a trap composed of 125 places in 259 ms of which 2 ms to minimize.
[2024-05-31 03:24:51] [INFO ] Deduced a trap composed of 116 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:24:51] [INFO ] Deduced a trap composed of 134 places in 228 ms of which 1 ms to minimize.
[2024-05-31 03:24:52] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 13 ms to minimize.
[2024-05-31 03:24:52] [INFO ] Deduced a trap composed of 125 places in 247 ms of which 0 ms to minimize.
[2024-05-31 03:24:52] [INFO ] Deduced a trap composed of 128 places in 258 ms of which 1 ms to minimize.
[2024-05-31 03:24:53] [INFO ] Deduced a trap composed of 134 places in 252 ms of which 1 ms to minimize.
[2024-05-31 03:24:53] [INFO ] Deduced a trap composed of 128 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:24:54] [INFO ] Deduced a trap composed of 137 places in 1298 ms of which 0 ms to minimize.
[2024-05-31 03:24:55] [INFO ] Deduced a trap composed of 122 places in 298 ms of which 0 ms to minimize.
[2024-05-31 03:25:01] [INFO ] Deduced a trap composed of 128 places in 5612 ms of which 1 ms to minimize.
[2024-05-31 03:25:01] [INFO ] Deduced a trap composed of 125 places in 287 ms of which 0 ms to minimize.
[2024-05-31 03:25:01] [INFO ] Deduced a trap composed of 119 places in 259 ms of which 1 ms to minimize.
[2024-05-31 03:25:02] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 0 ms to minimize.
[2024-05-31 03:25:02] [INFO ] Deduced a trap composed of 125 places in 256 ms of which 1 ms to minimize.
[2024-05-31 03:25:02] [INFO ] Deduced a trap composed of 128 places in 293 ms of which 0 ms to minimize.
[2024-05-31 03:25:03] [INFO ] Deduced a trap composed of 126 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:25:05] [INFO ] Deduced a trap composed of 125 places in 309 ms of which 0 ms to minimize.
[2024-05-31 03:25:05] [INFO ] Deduced a trap composed of 113 places in 294 ms of which 0 ms to minimize.
[2024-05-31 03:25:05] [INFO ] Deduced a trap composed of 128 places in 226 ms of which 1 ms to minimize.
[2024-05-31 03:25:12] [INFO ] Deduced a trap composed of 119 places in 6770 ms of which 26 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:25:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:25:12] [INFO ] After 29367ms 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 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 57 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 65 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-31 03:25:12] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:25:12] [INFO ] Invariant cache hit.
[2024-05-31 03:25:13] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-31 03:25:13] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:25:13] [INFO ] Invariant cache hit.
[2024-05-31 03:25:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:25:15] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 3166 ms to find 0 implicit places.
[2024-05-31 03:25:15] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-31 03:25:16] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:25:16] [INFO ] Invariant cache hit.
[2024-05-31 03:25:16] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3869 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 158 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2024-05-31 03:25:16] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:25:17] [INFO ] [Real]Absence check using 70 positive place invariants in 360 ms returned sat
[2024-05-31 03:25:17] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-31 03:25:17] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:25:17] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2024-05-31 03:25:17] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 03:25:17] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:25:24] [INFO ] Deduced a trap composed of 123 places in 6262 ms of which 1 ms to minimize.
[2024-05-31 03:25:24] [INFO ] Deduced a trap composed of 129 places in 237 ms of which 0 ms to minimize.
[2024-05-31 03:25:24] [INFO ] Deduced a trap composed of 123 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:25:24] [INFO ] Deduced a trap composed of 123 places in 249 ms of which 1 ms to minimize.
[2024-05-31 03:25:25] [INFO ] Deduced a trap composed of 129 places in 230 ms of which 1 ms to minimize.
[2024-05-31 03:25:25] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:25:25] [INFO ] Deduced a trap composed of 120 places in 247 ms of which 0 ms to minimize.
[2024-05-31 03:25:25] [INFO ] Deduced a trap composed of 129 places in 223 ms of which 1 ms to minimize.
[2024-05-31 03:25:26] [INFO ] Deduced a trap composed of 129 places in 233 ms of which 0 ms to minimize.
[2024-05-31 03:25:26] [INFO ] Deduced a trap composed of 123 places in 247 ms of which 0 ms to minimize.
[2024-05-31 03:25:26] [INFO ] Deduced a trap composed of 120 places in 266 ms of which 1 ms to minimize.
[2024-05-31 03:25:27] [INFO ] Deduced a trap composed of 138 places in 228 ms of which 1 ms to minimize.
[2024-05-31 03:25:27] [INFO ] Deduced a trap composed of 123 places in 214 ms of which 0 ms to minimize.
[2024-05-31 03:25:27] [INFO ] Deduced a trap composed of 129 places in 238 ms of which 1 ms to minimize.
[2024-05-31 03:25:28] [INFO ] Deduced a trap composed of 120 places in 247 ms of which 1 ms to minimize.
[2024-05-31 03:25:28] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 1 ms to minimize.
[2024-05-31 03:25:28] [INFO ] Deduced a trap composed of 129 places in 249 ms of which 1 ms to minimize.
[2024-05-31 03:25:29] [INFO ] Deduced a trap composed of 123 places in 241 ms of which 1 ms to minimize.
[2024-05-31 03:25:29] [INFO ] Deduced a trap composed of 138 places in 244 ms of which 0 ms to minimize.
[2024-05-31 03:25:29] [INFO ] Deduced a trap composed of 126 places in 230 ms of which 0 ms to minimize.
[2024-05-31 03:25:29] [INFO ] Deduced a trap composed of 120 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:25:30] [INFO ] Deduced a trap composed of 135 places in 245 ms of which 0 ms to minimize.
[2024-05-31 03:25:30] [INFO ] Deduced a trap composed of 126 places in 264 ms of which 1 ms to minimize.
[2024-05-31 03:25:30] [INFO ] Deduced a trap composed of 120 places in 269 ms of which 1 ms to minimize.
[2024-05-31 03:25:31] [INFO ] Deduced a trap composed of 126 places in 290 ms of which 1 ms to minimize.
[2024-05-31 03:25:31] [INFO ] Deduced a trap composed of 120 places in 258 ms of which 1 ms to minimize.
[2024-05-31 03:25:31] [INFO ] Deduced a trap composed of 123 places in 250 ms of which 0 ms to minimize.
[2024-05-31 03:25:32] [INFO ] Deduced a trap composed of 129 places in 246 ms of which 1 ms to minimize.
[2024-05-31 03:25:32] [INFO ] Deduced a trap composed of 123 places in 251 ms of which 1 ms to minimize.
[2024-05-31 03:25:38] [INFO ] Deduced a trap composed of 132 places in 5447 ms of which 3 ms to minimize.
[2024-05-31 03:25:38] [INFO ] Deduced a trap composed of 117 places in 252 ms of which 1 ms to minimize.
[2024-05-31 03:25:38] [INFO ] Deduced a trap composed of 123 places in 240 ms of which 1 ms to minimize.
[2024-05-31 03:25:39] [INFO ] Deduced a trap composed of 132 places in 249 ms of which 1 ms to minimize.
[2024-05-31 03:25:41] [INFO ] Deduced a trap composed of 117 places in 2668 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 1 ms to minimize.
[2024-05-31 03:25:42] [INFO ] Deduced a trap composed of 123 places in 184 ms of which 1 ms to minimize.
[2024-05-31 03:25:43] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 1 ms to minimize.
[2024-05-31 03:25:43] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 1 ms to minimize.
[2024-05-31 03:25:43] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 0 ms to minimize.
[2024-05-31 03:25:43] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 0 ms to minimize.
[2024-05-31 03:25:43] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 1 ms to minimize.
[2024-05-31 03:25:44] [INFO ] Deduced a trap composed of 132 places in 243 ms of which 1 ms to minimize.
[2024-05-31 03:25:44] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 1 ms to minimize.
[2024-05-31 03:25:44] [INFO ] Deduced a trap composed of 129 places in 268 ms of which 1 ms to minimize.
[2024-05-31 03:25:45] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 1 ms to minimize.
[2024-05-31 03:25:45] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 0 ms to minimize.
[2024-05-31 03:25:48] [INFO ] Deduced a trap composed of 123 places in 276 ms of which 1 ms to minimize.
[2024-05-31 03:25:49] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 0 ms to minimize.
[2024-05-31 03:25:50] [INFO ] Deduced a trap composed of 126 places in 244 ms of which 1 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 129 places in 199 ms of which 2 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 1 ms to minimize.
[2024-05-31 03:26:02] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 44842 ms
[2024-05-31 03:26:02] [INFO ] After 45159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:26:02] [INFO ] After 45333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-COL-S05J30-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 66 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 15 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:26:03] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 03:26:03] [INFO ] Computed 77 invariants in 14 ms
[2024-05-31 03:26:03] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
[2024-05-31 03:26:03] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:03] [INFO ] Invariant cache hit.
[2024-05-31 03:26:04] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-31 03:26:04] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:04] [INFO ] Invariant cache hit.
[2024-05-31 03:26:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:06] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
[2024-05-31 03:26:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:06] [INFO ] Invariant cache hit.
[2024-05-31 03:26:06] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3631 ms. Remains : 483/489 places, 649/650 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p2)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s59 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s161 1)) (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6713 steps with 492 reset in 91 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-00 finished in 4189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 21 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:26:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:07] [INFO ] Invariant cache hit.
[2024-05-31 03:26:07] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
[2024-05-31 03:26:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:07] [INFO ] Invariant cache hit.
[2024-05-31 03:26:08] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 03:26:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:08] [INFO ] Invariant cache hit.
[2024-05-31 03:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:10] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-31 03:26:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:26:10] [INFO ] Invariant cache hit.
[2024-05-31 03:26:10] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3135 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s202 1), p1:(AND (GEQ s164 1) (GEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-01 finished in 3347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
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 449 transition count 580
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 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
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 412 transition count 578
Applied a total of 144 rules in 56 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 03:26:10] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:26:10] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 03:26:11] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2024-05-31 03:26:11] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:26:11] [INFO ] Invariant cache hit.
[2024-05-31 03:26:11] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 03:26:11] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:26:11] [INFO ] Invariant cache hit.
[2024-05-31 03:26:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:12] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
[2024-05-31 03:26:12] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-31 03:26:12] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:26:12] [INFO ] Invariant cache hit.
[2024-05-31 03:26:13] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/489 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2629 ms. Remains : 412/489 places, 578/650 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-03 finished in 2694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 14 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
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 489 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 454 transition count 615
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 454 transition count 581
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 420 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 419 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 419 transition count 580
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 142 place count 418 transition count 579
Applied a total of 142 rules in 42 ms. Remains 418 /489 variables (removed 71) and now considering 579/650 (removed 71) transitions.
[2024-05-31 03:26:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 418 cols
[2024-05-31 03:26:13] [INFO ] Computed 82 invariants in 9 ms
[2024-05-31 03:26:13] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
[2024-05-31 03:26:13] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:13] [INFO ] Invariant cache hit.
[2024-05-31 03:26:14] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-31 03:26:14] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:14] [INFO ] Invariant cache hit.
[2024-05-31 03:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:15] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2024-05-31 03:26:15] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 03:26:15] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:15] [INFO ] Invariant cache hit.
[2024-05-31 03:26:15] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/489 places, 579/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2522 ms. Remains : 418/489 places, 579/650 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s413 1) (LT s417 10)), p0:(AND (OR (LT s205 1) (LT s401 1) (LT s406 1) (LT s412 1)) (OR (LT s205 1) (LT s402 1) (LT s407 1) (LT s412 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9451 reset in 437 ms.
Product exploration explored 100000 steps with 9537 reset in 481 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 369 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 353 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 14 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 579/579 transitions.
Applied a total of 0 rules in 13 ms. Remains 418 /418 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 03:26:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:18] [INFO ] Invariant cache hit.
[2024-05-31 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
[2024-05-31 03:26:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:18] [INFO ] Invariant cache hit.
[2024-05-31 03:26:18] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-31 03:26:18] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:18] [INFO ] Invariant cache hit.
[2024-05-31 03:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:20] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2024-05-31 03:26:20] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 03:26:20] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:20] [INFO ] Invariant cache hit.
[2024-05-31 03:26:20] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2344 ms. Remains : 418/418 places, 579/579 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 (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9555 reset in 304 ms.
Product exploration explored 100000 steps with 9638 reset in 305 ms.
Built C files in :
/tmp/ltsmin16868650886612349830
[2024-05-31 03:26:21] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2024-05-31 03:26:21] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:21] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2024-05-31 03:26:21] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:21] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2024-05-31 03:26:21] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:21] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16868650886612349830
Running compilation step : cd /tmp/ltsmin16868650886612349830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1531 ms.
Running link step : cd /tmp/ltsmin16868650886612349830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16868650886612349830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7500185616805891482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 14 out of 418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 418/418 places, 579/579 transitions.
Applied a total of 0 rules in 12 ms. Remains 418 /418 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 03:26:36] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:36] [INFO ] Invariant cache hit.
[2024-05-31 03:26:37] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
[2024-05-31 03:26:37] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:37] [INFO ] Invariant cache hit.
[2024-05-31 03:26:37] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-31 03:26:37] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:37] [INFO ] Invariant cache hit.
[2024-05-31 03:26:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:39] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
[2024-05-31 03:26:39] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 03:26:39] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:26:39] [INFO ] Invariant cache hit.
[2024-05-31 03:26:39] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2480 ms. Remains : 418/418 places, 579/579 transitions.
Built C files in :
/tmp/ltsmin6092459411674254562
[2024-05-31 03:26:39] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2024-05-31 03:26:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:39] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2024-05-31 03:26:39] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:39] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2024-05-31 03:26:39] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:26:39] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6092459411674254562
Running compilation step : cd /tmp/ltsmin6092459411674254562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1369 ms.
Running link step : cd /tmp/ltsmin6092459411674254562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6092459411674254562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13572754736919786519.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:26:54] [INFO ] Flatten gal took : 64 ms
[2024-05-31 03:26:54] [INFO ] Flatten gal took : 44 ms
[2024-05-31 03:26:54] [INFO ] Time to serialize gal into /tmp/LTL17855612500880082593.gal : 24 ms
[2024-05-31 03:26:54] [INFO ] Time to serialize properties into /tmp/LTL3303950161736272873.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17855612500880082593.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2115751501930651700.hoa' '-atoms' '/tmp/LTL3303950161736272873.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3303950161736272873.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2115751501930651700.hoa
Detected timeout of ITS tools.
[2024-05-31 03:27:09] [INFO ] Flatten gal took : 61 ms
[2024-05-31 03:27:10] [INFO ] Flatten gal took : 52 ms
[2024-05-31 03:27:10] [INFO ] Time to serialize gal into /tmp/LTL14965809304173364093.gal : 31 ms
[2024-05-31 03:27:10] [INFO ] Time to serialize properties into /tmp/LTL4580460418820514130.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14965809304173364093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4580460418820514130.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((place_782_0<1)||(cJobCnt_0<10))"))||("((((((cSources_0<1)||(DataOnSrc_0<1))||((TheSour_0<1)||(CanInjectEvent_0<1)))&&(((c...464
Formula 0 simplified : G(F!"((place_782_0<1)||(cJobCnt_0<10))" & FG!"((((((cSources_0<1)||(DataOnSrc_0<1))||((TheSour_0<1)||(CanInjectEvent_0<1)))&&(((cSou...457
Detected timeout of ITS tools.
[2024-05-31 03:27:25] [INFO ] Flatten gal took : 52 ms
[2024-05-31 03:27:25] [INFO ] Applying decomposition
[2024-05-31 03:27:25] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12050768970078736957.txt' '-o' '/tmp/graph12050768970078736957.bin' '-w' '/tmp/graph12050768970078736957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12050768970078736957.bin' '-l' '-1' '-v' '-w' '/tmp/graph12050768970078736957.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:27:25] [INFO ] Decomposing Gal with order
[2024-05-31 03:27:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:27:25] [INFO ] Removed a total of 691 redundant transitions.
[2024-05-31 03:27:26] [INFO ] Flatten gal took : 387 ms
[2024-05-31 03:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 31 ms.
[2024-05-31 03:27:26] [INFO ] Time to serialize gal into /tmp/LTL4817526808880370125.gal : 23 ms
[2024-05-31 03:27:26] [INFO ] Time to serialize properties into /tmp/LTL6414140503333090101.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4817526808880370125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6414140503333090101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i1.u33.place_782_0<1)||(u34.cJobCnt_0<10))"))||("((((((i6.u12.cSources_0<1)||(i1.u14.DataOnSrc_0<1))||((i1.u4.TheSour_0<1...611
Formula 0 simplified : G(F!"((i1.u33.place_782_0<1)||(u34.cJobCnt_0<10))" & FG!"((((((i6.u12.cSources_0<1)||(i1.u14.DataOnSrc_0<1))||((i1.u4.TheSour_0<1)||...604
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8185533886096826121
[2024-05-31 03:27:41] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8185533886096826121
Running compilation step : cd /tmp/ltsmin8185533886096826121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 974 ms.
Running link step : cd /tmp/ltsmin8185533886096826121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8185533886096826121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-04 finished in 102879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||(p1&&G(p2))))))'
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Applied a total of 5 rules in 13 ms. Remains 484 /489 variables (removed 5) and now considering 650/650 (removed 0) transitions.
[2024-05-31 03:27:56] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2024-05-31 03:27:56] [INFO ] Computed 77 invariants in 15 ms
[2024-05-31 03:27:56] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2024-05-31 03:27:56] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:27:57] [INFO ] Invariant cache hit.
[2024-05-31 03:27:57] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 03:27:57] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:27:57] [INFO ] Invariant cache hit.
[2024-05-31 03:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:27:58] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2024-05-31 03:27:58] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:27:58] [INFO ] Invariant cache hit.
[2024-05-31 03:27:59] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2797 ms. Remains : 484/489 places, 650/650 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s198 4), p1:(LT s415 1), p2:(OR (LT s413 1) (LT s481 10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12114 reset in 280 ms.
Product exploration explored 100000 steps with 12227 reset in 365 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 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 15 factoid took 867 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 03:28:01] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-31 03:28:01] [INFO ] Invariant cache hit.
[2024-05-31 03:28:02] [INFO ] [Real]Absence check using 71 positive place invariants in 17 ms returned sat
[2024-05-31 03:28:02] [INFO ] [Real]Absence check using 71 positive and 6 generalized place invariants in 14 ms returned sat
[2024-05-31 03:28:02] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-31 03:28:02] [INFO ] [Nat]Absence check using 71 positive place invariants in 13 ms returned sat
[2024-05-31 03:28:02] [INFO ] [Nat]Absence check using 71 positive and 6 generalized place invariants in 10 ms returned sat
[2024-05-31 03:28:02] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2024-05-31 03:28:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:02] [INFO ] After 137ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2024-05-31 03:28:03] [INFO ] Deduced a trap composed of 198 places in 134 ms of which 1 ms to minimize.
[2024-05-31 03:28:03] [INFO ] Deduced a trap composed of 198 places in 177 ms of which 0 ms to minimize.
[2024-05-31 03:28:03] [INFO ] Deduced a trap composed of 204 places in 165 ms of which 1 ms to minimize.
[2024-05-31 03:28:03] [INFO ] Deduced a trap composed of 207 places in 136 ms of which 1 ms to minimize.
[2024-05-31 03:28:03] [INFO ] Deduced a trap composed of 198 places in 137 ms of which 0 ms to minimize.
[2024-05-31 03:28:04] [INFO ] Deduced a trap composed of 189 places in 138 ms of which 1 ms to minimize.
[2024-05-31 03:28:04] [INFO ] Deduced a trap composed of 210 places in 158 ms of which 1 ms to minimize.
[2024-05-31 03:28:04] [INFO ] Deduced a trap composed of 207 places in 135 ms of which 0 ms to minimize.
[2024-05-31 03:28:04] [INFO ] Deduced a trap composed of 207 places in 183 ms of which 1 ms to minimize.
[2024-05-31 03:28:04] [INFO ] Deduced a trap composed of 204 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:28:05] [INFO ] Deduced a trap composed of 201 places in 138 ms of which 0 ms to minimize.
[2024-05-31 03:28:05] [INFO ] Deduced a trap composed of 207 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:28:06] [INFO ] Deduced a trap composed of 207 places in 165 ms of which 0 ms to minimize.
[2024-05-31 03:28:06] [INFO ] Deduced a trap composed of 201 places in 159 ms of which 0 ms to minimize.
[2024-05-31 03:28:06] [INFO ] Deduced a trap composed of 201 places in 180 ms of which 2 ms to minimize.
[2024-05-31 03:28:07] [INFO ] Deduced a trap composed of 204 places in 203 ms of which 0 ms to minimize.
[2024-05-31 03:28:08] [INFO ] Deduced a trap composed of 216 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:28:08] [INFO ] Deduced a trap composed of 195 places in 141 ms of which 1 ms to minimize.
[2024-05-31 03:28:08] [INFO ] Deduced a trap composed of 204 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:28:09] [INFO ] Deduced a trap composed of 204 places in 197 ms of which 0 ms to minimize.
[2024-05-31 03:28:09] [INFO ] Deduced a trap composed of 210 places in 196 ms of which 0 ms to minimize.
[2024-05-31 03:28:09] [INFO ] Deduced a trap composed of 213 places in 219 ms of which 2 ms to minimize.
[2024-05-31 03:28:10] [INFO ] Deduced a trap composed of 198 places in 198 ms of which 1 ms to minimize.
[2024-05-31 03:28:10] [INFO ] Deduced a trap composed of 204 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:28:11] [INFO ] Deduced a trap composed of 204 places in 207 ms of which 0 ms to minimize.
[2024-05-31 03:28:11] [INFO ] Deduced a trap composed of 204 places in 208 ms of which 1 ms to minimize.
[2024-05-31 03:28:12] [INFO ] Deduced a trap composed of 207 places in 150 ms of which 0 ms to minimize.
[2024-05-31 03:28:12] [INFO ] Deduced a trap composed of 207 places in 172 ms of which 1 ms to minimize.
[2024-05-31 03:28:13] [INFO ] Deduced a trap composed of 204 places in 218 ms of which 0 ms to minimize.
[2024-05-31 03:28:13] [INFO ] Deduced a trap composed of 213 places in 206 ms of which 1 ms to minimize.
[2024-05-31 03:28:22] [INFO ] Trap strengthening (SAT) tested/added 30/30 trap constraints in 19854 ms
[2024-05-31 03:28:23] [INFO ] Deduced a trap composed of 201 places in 140 ms of which 1 ms to minimize.
[2024-05-31 03:28:23] [INFO ] Deduced a trap composed of 207 places in 188 ms of which 0 ms to minimize.
[2024-05-31 03:28:23] [INFO ] Deduced a trap composed of 201 places in 130 ms of which 0 ms to minimize.
[2024-05-31 03:28:24] [INFO ] Deduced a trap composed of 198 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:28:25] [INFO ] Deduced a trap composed of 201 places in 154 ms of which 1 ms to minimize.
[2024-05-31 03:28:26] [INFO ] Deduced a trap composed of 210 places in 190 ms of which 1 ms to minimize.
[2024-05-31 03:28:26] [INFO ] Deduced a trap composed of 198 places in 204 ms of which 1 ms to minimize.
[2024-05-31 03:28:26] [INFO ] Deduced a trap composed of 204 places in 212 ms of which 0 ms to minimize.
[2024-05-31 03:28:27] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 3963 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:28:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:28:27] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:5
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 650/650 transitions.
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 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
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 140 place count 414 transition count 580
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 412 transition count 578
Applied a total of 144 rules in 57 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2024-05-31 03:28:27] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:28:27] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:28:27] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 412/484 places, 578/650 transitions.
Incomplete random walk after 10000 steps, including 606 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 337156 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337156 steps, saw 100213 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:28:30] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:28:30] [INFO ] Invariant cache hit.
[2024-05-31 03:28:30] [INFO ] [Real]Absence check using 70 positive place invariants in 10 ms returned sat
[2024-05-31 03:28:30] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:28:30] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:28:31] [INFO ] [Nat]Absence check using 70 positive place invariants in 10 ms returned sat
[2024-05-31 03:28:31] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:28:31] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:28:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:31] [INFO ] After 186ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 03:28:31] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 0 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 1 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 124 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:28:32] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 0 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 0 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 1 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 142 places in 137 ms of which 1 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 0 ms to minimize.
[2024-05-31 03:28:33] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:28:34] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 1 ms to minimize.
[2024-05-31 03:28:34] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:28:34] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2024-05-31 03:28:34] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:28:35] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 1 ms to minimize.
[2024-05-31 03:28:35] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 0 ms to minimize.
[2024-05-31 03:28:35] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 1 ms to minimize.
[2024-05-31 03:28:35] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 0 ms to minimize.
[2024-05-31 03:28:35] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 1 ms to minimize.
[2024-05-31 03:28:36] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 0 ms to minimize.
[2024-05-31 03:28:36] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 1 ms to minimize.
[2024-05-31 03:28:37] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 0 ms to minimize.
[2024-05-31 03:28:37] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 0 ms to minimize.
[2024-05-31 03:28:37] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 0 ms to minimize.
[2024-05-31 03:28:37] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 1 ms to minimize.
[2024-05-31 03:28:38] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 1 ms to minimize.
[2024-05-31 03:28:38] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 0 ms to minimize.
[2024-05-31 03:28:41] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 0 ms to minimize.
[2024-05-31 03:28:41] [INFO ] Deduced a trap composed of 127 places in 109 ms of which 1 ms to minimize.
[2024-05-31 03:28:45] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 1 ms to minimize.
[2024-05-31 03:28:45] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 0 ms to minimize.
[2024-05-31 03:28:46] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 1 ms to minimize.
[2024-05-31 03:28:53] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 0 ms to minimize.
[2024-05-31 03:28:53] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 0 ms to minimize.
[2024-05-31 03:28:53] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 2 ms to minimize.
[2024-05-31 03:28:55] [INFO ] Deduced a trap composed of 121 places in 188 ms of which 1 ms to minimize.
[2024-05-31 03:28:55] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:28:56] [INFO ] Deduced a trap composed of 118 places in 187 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:28:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:28:56] [INFO ] After 25124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 412/412 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 03:28:56] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:28:56] [INFO ] Invariant cache hit.
[2024-05-31 03:28:56] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-31 03:28:56] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:28:56] [INFO ] Invariant cache hit.
[2024-05-31 03:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:28:57] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
[2024-05-31 03:28:57] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 03:28:57] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:28:57] [INFO ] Invariant cache hit.
[2024-05-31 03:28:57] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1907 ms. Remains : 412/412 places, 578/578 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 412 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 412 transition count 573
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 6 place count 411 transition count 573
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 411 transition count 568
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 406 transition count 568
Applied a total of 16 rules in 37 ms. Remains 406 /412 variables (removed 6) and now considering 568/578 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 568 rows 406 cols
[2024-05-31 03:28:58] [INFO ] Computed 77 invariants in 6 ms
[2024-05-31 03:28:58] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2024-05-31 03:28:58] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:28:58] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:28:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 12 ms returned sat
[2024-05-31 03:28:58] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 03:28:59] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:28:59] [INFO ] Deduced a trap composed of 157 places in 183 ms of which 1 ms to minimize.
[2024-05-31 03:28:59] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:28:59] [INFO ] Deduced a trap composed of 155 places in 143 ms of which 1 ms to minimize.
[2024-05-31 03:28:59] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:29:00] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 0 ms to minimize.
[2024-05-31 03:29:00] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:29:00] [INFO ] Deduced a trap composed of 126 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:29:00] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 0 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 2 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 1 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 114 places in 170 ms of which 1 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 1 ms to minimize.
[2024-05-31 03:29:01] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:29:02] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 0 ms to minimize.
[2024-05-31 03:29:02] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 1 ms to minimize.
[2024-05-31 03:29:02] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 1 ms to minimize.
[2024-05-31 03:29:03] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 1 ms to minimize.
[2024-05-31 03:29:04] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:29:04] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:29:05] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 1 ms to minimize.
[2024-05-31 03:29:05] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 1 ms to minimize.
[2024-05-31 03:29:05] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:29:06] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 0 ms to minimize.
[2024-05-31 03:29:07] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:29:07] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:29:15] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 1 ms to minimize.
[2024-05-31 03:29:15] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 14 ms to minimize.
[2024-05-31 03:29:15] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 0 ms to minimize.
[2024-05-31 03:29:15] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 0 ms to minimize.
[2024-05-31 03:29:16] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:29:20] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 1 ms to minimize.
[2024-05-31 03:29:20] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:29:20] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:29:21] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 1 ms to minimize.
[2024-05-31 03:29:22] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 5 ms to minimize.
[2024-05-31 03:29:23] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 0 ms to minimize.
[2024-05-31 03:29:23] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 1 ms to minimize.
[2024-05-31 03:29:24] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 0 ms to minimize.
[2024-05-31 03:29:24] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 1 ms to minimize.
[2024-05-31 03:29:25] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 0 ms to minimize.
[2024-05-31 03:29:25] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 1 ms to minimize.
[2024-05-31 03:29:31] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:29:34] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 1 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 135 places in 160 ms of which 1 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 0 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 0 ms to minimize.
[2024-05-31 03:29:43] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2024-05-31 03:29:44] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 0 ms to minimize.
[2024-05-31 03:29:44] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 0 ms to minimize.
[2024-05-31 03:29:53] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 53962 ms
[2024-05-31 03:29:56] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 0 ms to minimize.
[2024-05-31 03:29:57] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 1 ms to minimize.
[2024-05-31 03:30:01] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 0 ms to minimize.
[2024-05-31 03:30:02] [INFO ] Deduced a trap composed of 126 places in 164 ms of which 1 ms to minimize.
[2024-05-31 03:30:02] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:30:03] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:30:12] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 16217 ms
[2024-05-31 03:30:12] [INFO ] After 74186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:30:12] [INFO ] After 74291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1959 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 484 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 : 484/484 places, 650/650 transitions.
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 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
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 140 place count 414 transition count 580
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 412 transition count 578
Applied a total of 144 rules in 36 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2024-05-31 03:30:15] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:30:15] [INFO ] Computed 77 invariants in 11 ms
[2024-05-31 03:30:15] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2024-05-31 03:30:15] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:30:15] [INFO ] Invariant cache hit.
[2024-05-31 03:30:16] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-31 03:30:16] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:30:16] [INFO ] Invariant cache hit.
[2024-05-31 03:30:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:17] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-31 03:30:17] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 03:30:17] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:30:17] [INFO ] Invariant cache hit.
[2024-05-31 03:30:17] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2821 ms. Remains : 412/484 places, 578/650 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 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Finished random walk after 158 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6661 reset in 325 ms.
Product exploration explored 100000 steps with 6568 reset in 368 ms.
Built C files in :
/tmp/ltsmin12037451609484418672
[2024-05-31 03:30:19] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 03:30:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:19] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 03:30:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:19] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 03:30:19] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:19] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12037451609484418672
Running compilation step : cd /tmp/ltsmin12037451609484418672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1757 ms.
Running link step : cd /tmp/ltsmin12037451609484418672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12037451609484418672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11261428475737125157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 412 transition count 577
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 577
Applied a total of 2 rules in 17 ms. Remains 411 /412 variables (removed 1) and now considering 577/578 (removed 1) transitions.
[2024-05-31 03:30:34] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:30:34] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:30:34] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
[2024-05-31 03:30:34] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:30:34] [INFO ] Invariant cache hit.
[2024-05-31 03:30:34] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 03:30:34] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:30:34] [INFO ] Invariant cache hit.
[2024-05-31 03:30:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:30:35] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2024-05-31 03:30:35] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 03:30:35] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:30:35] [INFO ] Invariant cache hit.
[2024-05-31 03:30:36] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/412 places, 577/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2197 ms. Remains : 411/412 places, 577/578 transitions.
Built C files in :
/tmp/ltsmin13029875345289721996
[2024-05-31 03:30:36] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 03:30:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:36] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 03:30:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:36] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 03:30:36] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:30:36] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13029875345289721996
Running compilation step : cd /tmp/ltsmin13029875345289721996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin13029875345289721996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13029875345289721996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16674513480788094482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:30:51] [INFO ] Flatten gal took : 40 ms
[2024-05-31 03:30:51] [INFO ] Flatten gal took : 26 ms
[2024-05-31 03:30:51] [INFO ] Time to serialize gal into /tmp/LTL17621692488076141206.gal : 5 ms
[2024-05-31 03:30:51] [INFO ] Time to serialize properties into /tmp/LTL15013627402740138288.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17621692488076141206.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1134012812162798184.hoa' '-atoms' '/tmp/LTL15013627402740138288.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15013627402740138288.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1134012812162798184.hoa
Detected timeout of ITS tools.
[2024-05-31 03:31:06] [INFO ] Flatten gal took : 43 ms
[2024-05-31 03:31:06] [INFO ] Flatten gal took : 38 ms
[2024-05-31 03:31:06] [INFO ] Time to serialize gal into /tmp/LTL12756964514947120222.gal : 6 ms
[2024-05-31 03:31:06] [INFO ] Time to serialize properties into /tmp/LTL10854721217635383688.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12756964514947120222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10854721217635383688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((("(place_523_0<4)")&&(X("(Perform_Work_E_0<1)")))||(("(Perform_Work_E_0<1)")&&(G("((place_782_0<1)||(cJobCnt_0<10))")))))))
Formula 0 simplified : FG((!"(place_523_0<4)" | X!"(Perform_Work_E_0<1)") & (!"(Perform_Work_E_0<1)" | F!"((place_782_0<1)||(cJobCnt_0<10))"))
Detected timeout of ITS tools.
[2024-05-31 03:31:21] [INFO ] Flatten gal took : 43 ms
[2024-05-31 03:31:21] [INFO ] Applying decomposition
[2024-05-31 03:31:21] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6760396874837265640.txt' '-o' '/tmp/graph6760396874837265640.bin' '-w' '/tmp/graph6760396874837265640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6760396874837265640.bin' '-l' '-1' '-v' '-w' '/tmp/graph6760396874837265640.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:31:21] [INFO ] Decomposing Gal with order
[2024-05-31 03:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:31:22] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-31 03:31:22] [INFO ] Flatten gal took : 140 ms
[2024-05-31 03:31:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 19 ms.
[2024-05-31 03:31:22] [INFO ] Time to serialize gal into /tmp/LTL3060590294469810150.gal : 6 ms
[2024-05-31 03:31:22] [INFO ] Time to serialize properties into /tmp/LTL14050721032907710842.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3060590294469810150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14050721032907710842.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i8.u17.place_523_0<4)")&&(X("(i1.u2.Perform_Work_E_0<1)")))||(("(i1.u2.Perform_Work_E_0<1)")&&(G("((i8.u34.place_782_0<1)||...182
Formula 0 simplified : FG((!"(i8.u17.place_523_0<4)" | X!"(i1.u2.Perform_Work_E_0<1)") & (!"(i1.u2.Perform_Work_E_0<1)" | F!"((i8.u34.place_782_0<1)||(u35....172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9554688188780126374
[2024-05-31 03:31:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9554688188780126374
Running compilation step : cd /tmp/ltsmin9554688188780126374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1103 ms.
Running link step : cd /tmp/ltsmin9554688188780126374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9554688188780126374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-05 finished in 236022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 15 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:31:52] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 03:31:52] [INFO ] Computed 77 invariants in 11 ms
[2024-05-31 03:31:52] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
[2024-05-31 03:31:52] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:31:52] [INFO ] Invariant cache hit.
[2024-05-31 03:31:58] [INFO ] Implicit Places using invariants in 5573 ms returned []
[2024-05-31 03:31:58] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:31:58] [INFO ] Invariant cache hit.
[2024-05-31 03:31:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:01] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 8432 ms to find 0 implicit places.
[2024-05-31 03:32:01] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:01] [INFO ] Invariant cache hit.
[2024-05-31 03:32:01] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9501 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 14850 reset in 307 ms.
Product exploration explored 100000 steps with 14845 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-31 03:32:03] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:03] [INFO ] Invariant cache hit.
[2024-05-31 03:32:03] [INFO ] [Real]Absence check using 71 positive place invariants in 105 ms returned sat
[2024-05-31 03:32:03] [INFO ] [Real]Absence check using 71 positive and 6 generalized place invariants in 23 ms returned sat
[2024-05-31 03:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:04] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2024-05-31 03:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:32:04] [INFO ] [Nat]Absence check using 71 positive place invariants in 27 ms returned sat
[2024-05-31 03:32:04] [INFO ] [Nat]Absence check using 71 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-31 03:32:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:05] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-05-31 03:32:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 219 ms returned sat
[2024-05-31 03:32:05] [INFO ] Computed and/alt/rep : 354/814/354 causal constraints (skipped 285 transitions) in 96 ms.
[2024-05-31 03:32:06] [INFO ] Added : 31 causal constraints over 7 iterations in 702 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
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 483 transition count 615
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 70 place count 448 transition count 580
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 138 place count 414 transition count 580
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 411 transition count 577
Applied a total of 144 rules in 40 ms. Remains 411 /483 variables (removed 72) and now considering 577/649 (removed 72) transitions.
[2024-05-31 03:32:06] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:32:06] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 03:32:06] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
[2024-05-31 03:32:06] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:06] [INFO ] Invariant cache hit.
[2024-05-31 03:32:06] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-31 03:32:06] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:06] [INFO ] Invariant cache hit.
[2024-05-31 03:32:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:08] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-05-31 03:32:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 03:32:08] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:08] [INFO ] Invariant cache hit.
[2024-05-31 03:32:09] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/483 places, 577/649 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2924 ms. Remains : 411/483 places, 577/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 346 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
[2024-05-31 03:32:09] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:09] [INFO ] Invariant cache hit.
[2024-05-31 03:32:10] [INFO ] [Real]Absence check using 70 positive place invariants in 33 ms returned sat
[2024-05-31 03:32:10] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 147 ms returned sat
[2024-05-31 03:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:10] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-31 03:32:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:32:11] [INFO ] [Nat]Absence check using 70 positive place invariants in 34 ms returned sat
[2024-05-31 03:32:11] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 03:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:11] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2024-05-31 03:32:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 85 ms returned sat
[2024-05-31 03:32:11] [INFO ] Computed and/alt/rep : 282/977/282 causal constraints (skipped 285 transitions) in 85 ms.
[2024-05-31 03:32:12] [INFO ] Added : 31 causal constraints over 7 iterations in 650 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22298 reset in 292 ms.
Product exploration explored 100000 steps with 22226 reset in 302 ms.
Built C files in :
/tmp/ltsmin7053943223373762570
[2024-05-31 03:32:13] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 03:32:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:13] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 03:32:13] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:13] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 03:32:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:13] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7053943223373762570
Running compilation step : cd /tmp/ltsmin7053943223373762570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1754 ms.
Running link step : cd /tmp/ltsmin7053943223373762570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7053943223373762570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12661826427451332892.hoa' '--buchi-type=spotba'
LTSmin run took 5703 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-06 finished in 28440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 579
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 142 place count 413 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 578
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 148 place count 410 transition count 576
Applied a total of 148 rules in 36 ms. Remains 410 /489 variables (removed 79) and now considering 576/650 (removed 74) transitions.
[2024-05-31 03:32:20] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2024-05-31 03:32:20] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:32:21] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
[2024-05-31 03:32:21] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:32:21] [INFO ] Invariant cache hit.
[2024-05-31 03:32:21] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-31 03:32:21] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:32:21] [INFO ] Invariant cache hit.
[2024-05-31 03:32:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:22] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-05-31 03:32:22] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 03:32:22] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2024-05-31 03:32:22] [INFO ] Invariant cache hit.
[2024-05-31 03:32:23] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/489 places, 576/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2244 ms. Remains : 410/489 places, 576/650 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s97 1) (GEQ s117 1)) (AND (GEQ s32 1) (GEQ s97 1) (GEQ s118 1)) (AND (GEQ s32 1) (GEQ s97 1) (GEQ s115 1)) (AND (GEQ s32 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-07 finished in 2319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 450 transition count 616
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 450 transition count 582
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 416 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 415 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 415 transition count 581
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 142 place count 413 transition count 579
Applied a total of 142 rules in 39 ms. Remains 413 /489 variables (removed 76) and now considering 579/650 (removed 71) transitions.
[2024-05-31 03:32:23] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2024-05-31 03:32:23] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:32:23] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
[2024-05-31 03:32:23] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:23] [INFO ] Invariant cache hit.
[2024-05-31 03:32:23] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 03:32:23] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:23] [INFO ] Invariant cache hit.
[2024-05-31 03:32:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:25] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2024-05-31 03:32:25] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 03:32:25] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:25] [INFO ] Invariant cache hit.
[2024-05-31 03:32:25] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/489 places, 579/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2869 ms. Remains : 413/489 places, 579/650 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s412 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14843 reset in 339 ms.
Product exploration explored 100000 steps with 14822 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-31 03:32:27] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:27] [INFO ] Invariant cache hit.
[2024-05-31 03:32:27] [INFO ] [Real]Absence check using 70 positive place invariants in 58 ms returned sat
[2024-05-31 03:32:27] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 58 ms returned sat
[2024-05-31 03:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:29] [INFO ] [Real]Absence check using state equation in 1565 ms returned sat
[2024-05-31 03:32:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:32:29] [INFO ] [Nat]Absence check using 70 positive place invariants in 45 ms returned sat
[2024-05-31 03:32:29] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-31 03:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:31] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-31 03:32:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 51 ms returned sat
[2024-05-31 03:32:31] [INFO ] Computed and/alt/rep : 285/990/285 causal constraints (skipped 284 transitions) in 50 ms.
[2024-05-31 03:32:31] [INFO ] Added : 9 causal constraints over 2 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 579/579 transitions.
Applied a total of 0 rules in 16 ms. Remains 413 /413 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 03:32:31] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:31] [INFO ] Invariant cache hit.
[2024-05-31 03:32:31] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
[2024-05-31 03:32:31] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:31] [INFO ] Invariant cache hit.
[2024-05-31 03:32:32] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-31 03:32:32] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:32] [INFO ] Invariant cache hit.
[2024-05-31 03:32:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:34] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2024-05-31 03:32:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 03:32:34] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:34] [INFO ] Invariant cache hit.
[2024-05-31 03:32:34] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3104 ms. Remains : 413/413 places, 579/579 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2024-05-31 03:32:35] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:32:35] [INFO ] Invariant cache hit.
[2024-05-31 03:32:35] [INFO ] [Real]Absence check using 70 positive place invariants in 31 ms returned sat
[2024-05-31 03:32:35] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-31 03:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:36] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2024-05-31 03:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:32:36] [INFO ] [Nat]Absence check using 70 positive place invariants in 58 ms returned sat
[2024-05-31 03:32:36] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 03:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:32:38] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2024-05-31 03:32:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2024-05-31 03:32:39] [INFO ] Computed and/alt/rep : 285/990/285 causal constraints (skipped 284 transitions) in 76 ms.
[2024-05-31 03:32:39] [INFO ] Added : 9 causal constraints over 2 iterations in 429 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14805 reset in 365 ms.
Product exploration explored 100000 steps with 14821 reset in 379 ms.
Built C files in :
/tmp/ltsmin8883531811373161795
[2024-05-31 03:32:40] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2024-05-31 03:32:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:40] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2024-05-31 03:32:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:40] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2024-05-31 03:32:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:32:40] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8883531811373161795
Running compilation step : cd /tmp/ltsmin8883531811373161795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1785 ms.
Running link step : cd /tmp/ltsmin8883531811373161795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin8883531811373161795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15528268058568825405.hoa' '--buchi-type=spotba'
LTSmin run took 5417 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-08 finished in 24543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G(p1))))))'
Support contains 34 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 11 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:32:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-31 03:32:47] [INFO ] Computed 77 invariants in 12 ms
[2024-05-31 03:32:48] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
[2024-05-31 03:32:48] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:48] [INFO ] Invariant cache hit.
[2024-05-31 03:32:48] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-31 03:32:48] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:48] [INFO ] Invariant cache hit.
[2024-05-31 03:32:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:50] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2024-05-31 03:32:50] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:50] [INFO ] Invariant cache hit.
[2024-05-31 03:32:50] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2883 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GEQ s199 3), p1:(AND (OR (LT s32 1) (LT s71 1) (LT s96 1)) (OR (LT s32 1) (LT s76 1) (LT s96 1)) (OR (LT s32 1) (LT s66 1) (LT s96 1)) (OR (LT s32 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-10 finished in 3053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(X(G(!p1))) U (p2&&X(p3)))))'
Support contains 40 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 11 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:32:50] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:50] [INFO ] Invariant cache hit.
[2024-05-31 03:32:51] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
[2024-05-31 03:32:51] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:51] [INFO ] Invariant cache hit.
[2024-05-31 03:32:51] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 03:32:51] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:51] [INFO ] Invariant cache hit.
[2024-05-31 03:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:53] [INFO ] Implicit Places using invariants and state equation in 2335 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
[2024-05-31 03:32:53] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:53] [INFO ] Invariant cache hit.
[2024-05-31 03:32:54] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3771 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3) p1), (NOT p3), (NOT p3), p1, true]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s199 3), p0:(OR (LT s199 3) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-11 finished in 4098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 40 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 483 transition count 649
Applied a total of 7 rules in 17 ms. Remains 483 /489 variables (removed 6) and now considering 649/650 (removed 1) transitions.
[2024-05-31 03:32:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:54] [INFO ] Invariant cache hit.
[2024-05-31 03:32:55] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
[2024-05-31 03:32:55] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:55] [INFO ] Invariant cache hit.
[2024-05-31 03:32:55] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-31 03:32:55] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:55] [INFO ] Invariant cache hit.
[2024-05-31 03:32:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:32:57] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-31 03:32:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-31 03:32:57] [INFO ] Invariant cache hit.
[2024-05-31 03:32:58] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/489 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3298 ms. Remains : 483/489 places, 649/650 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s203 1) (GEQ s204 1) (GEQ s208 1) (GEQ s209 8)) (AND (GEQ s203 1) (GEQ s206 2) (GEQ s209 8)) (AND (GEQ s203 1) (GEQ s204 2) (GEQ s209 8))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-13 finished in 3431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 66 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
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 146 place count 411 transition count 577
Applied a total of 146 rules in 31 ms. Remains 411 /489 variables (removed 78) and now considering 577/650 (removed 73) transitions.
[2024-05-31 03:32:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:32:58] [INFO ] Computed 77 invariants in 6 ms
[2024-05-31 03:32:58] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
[2024-05-31 03:32:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:58] [INFO ] Invariant cache hit.
[2024-05-31 03:32:58] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-31 03:32:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:32:58] [INFO ] Invariant cache hit.
[2024-05-31 03:32:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:33:00] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2024-05-31 03:33:00] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 03:33:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:33:00] [INFO ] Invariant cache hit.
[2024-05-31 03:33:00] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/489 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2229 ms. Remains : 411/489 places, 577/650 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s33 1) (OR (LT s32 1) (LT s97 1) (LT s117 1)) (OR (LT s32 1) (LT s97 1) (LT s118 1)) (OR (LT s32 1) (LT s97 1) (LT s115 1)) (OR (LT s32 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-14 finished in 2287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 449 transition count 582
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 136 place count 416 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 415 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 415 transition count 581
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 142 place count 413 transition count 579
Applied a total of 142 rules in 43 ms. Remains 413 /489 variables (removed 76) and now considering 579/650 (removed 71) transitions.
[2024-05-31 03:33:00] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
// Phase 1: matrix 575 rows 413 cols
[2024-05-31 03:33:00] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 03:33:00] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
[2024-05-31 03:33:00] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:33:00] [INFO ] Invariant cache hit.
[2024-05-31 03:33:01] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 03:33:01] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:33:01] [INFO ] Invariant cache hit.
[2024-05-31 03:33:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:33:02] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
[2024-05-31 03:33:02] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 03:33:02] [INFO ] Flow matrix only has 575 transitions (discarded 4 similar events)
[2024-05-31 03:33:02] [INFO ] Invariant cache hit.
[2024-05-31 03:33:02] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/489 places, 579/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2139 ms. Remains : 413/489 places, 579/650 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s200 1) (GEQ s201 2) (GEQ s203 1) (GEQ s206 7)) (AND (GEQ s200 1) (GEQ s201 3) (GEQ s206 7)) (AND (GEQ s200 1) (GEQ s201 1) (GEQ s202 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-15 finished in 2184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(p1))||(p1&&G(p2))))))'
Found a Shortening insensitive property : PolyORBNT-COL-S05J30-LTLFireability-05
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 489 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 489/489 places, 650/650 transitions.
Ensure Unique test removed 5 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 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
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 140 place count 414 transition count 580
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 412 transition count 578
Applied a total of 144 rules in 26 ms. Remains 412 /489 variables (removed 77) and now considering 578/650 (removed 72) transitions.
[2024-05-31 03:33:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:33:03] [INFO ] Computed 77 invariants in 8 ms
[2024-05-31 03:33:03] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
[2024-05-31 03:33:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:03] [INFO ] Invariant cache hit.
[2024-05-31 03:33:03] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 03:33:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:03] [INFO ] Invariant cache hit.
[2024-05-31 03:33:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:33:04] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-31 03:33:04] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:04] [INFO ] Invariant cache hit.
[2024-05-31 03:33:05] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 412/489 places, 578/650 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2025 ms. Remains : 412/489 places, 578/650 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s195 4), p1:(LT s408 1), p2:(OR (LT s406 1) (LT s411 10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11760 reset in 322 ms.
Product exploration explored 100000 steps with 11769 reset in 331 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 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2))))]
Knowledge based reduction with 15 factoid took 639 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 566 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-31 03:33:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:08] [INFO ] Invariant cache hit.
[2024-05-31 03:33:08] [INFO ] [Real]Absence check using 70 positive place invariants in 29 ms returned sat
[2024-05-31 03:33:08] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:33:08] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-31 03:33:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2024-05-31 03:33:08] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:33:08] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2024-05-31 03:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:33:09] [INFO ] After 280ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2024-05-31 03:33:09] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 1 ms to minimize.
[2024-05-31 03:33:09] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 0 ms to minimize.
[2024-05-31 03:33:09] [INFO ] Deduced a trap composed of 127 places in 197 ms of which 1 ms to minimize.
[2024-05-31 03:33:10] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 1 ms to minimize.
[2024-05-31 03:33:10] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 0 ms to minimize.
[2024-05-31 03:33:10] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 0 ms to minimize.
[2024-05-31 03:33:10] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 0 ms to minimize.
[2024-05-31 03:33:10] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2024-05-31 03:33:11] [INFO ] Deduced a trap composed of 124 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:33:11] [INFO ] Deduced a trap composed of 121 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:33:11] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 0 ms to minimize.
[2024-05-31 03:33:12] [INFO ] Deduced a trap composed of 130 places in 675 ms of which 1 ms to minimize.
[2024-05-31 03:33:12] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 0 ms to minimize.
[2024-05-31 03:33:13] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 1 ms to minimize.
[2024-05-31 03:33:13] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:33:13] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:33:14] [INFO ] Deduced a trap composed of 143 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:33:14] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 0 ms to minimize.
[2024-05-31 03:33:14] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:33:14] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:33:15] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 1 ms to minimize.
[2024-05-31 03:33:15] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:33:15] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 1 ms to minimize.
[2024-05-31 03:33:15] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 0 ms to minimize.
[2024-05-31 03:33:16] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 0 ms to minimize.
[2024-05-31 03:33:16] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:33:17] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 0 ms to minimize.
[2024-05-31 03:33:18] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 0 ms to minimize.
[2024-05-31 03:33:18] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:33:23] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 1 ms to minimize.
[2024-05-31 03:33:24] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 1 ms to minimize.
[2024-05-31 03:33:24] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:33:29] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 1 ms to minimize.
[2024-05-31 03:33:29] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 1 ms to minimize.
[2024-05-31 03:33:29] [INFO ] Deduced a trap composed of 124 places in 182 ms of which 1 ms to minimize.
[2024-05-31 03:33:33] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 24147 ms
[2024-05-31 03:33:33] [INFO ] After 24490ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :0
[2024-05-31 03:33:33] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 03:33:33] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:33] [INFO ] Invariant cache hit.
[2024-05-31 03:33:33] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 412/412 places, 578/578 transitions.
Incomplete random walk after 10000 steps, including 612 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 393594 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 393594 steps, saw 116074 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:33:36] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:33:36] [INFO ] Invariant cache hit.
[2024-05-31 03:33:37] [INFO ] [Real]Absence check using 70 positive place invariants in 17 ms returned sat
[2024-05-31 03:33:37] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 03:33:37] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:33:37] [INFO ] [Nat]Absence check using 70 positive place invariants in 15 ms returned sat
[2024-05-31 03:33:37] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 03:33:37] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:33:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:33:37] [INFO ] After 243ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-31 03:33:38] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 1 ms to minimize.
[2024-05-31 03:33:38] [INFO ] Deduced a trap composed of 133 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:33:38] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 0 ms to minimize.
[2024-05-31 03:33:38] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 1 ms to minimize.
[2024-05-31 03:33:39] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 0 ms to minimize.
[2024-05-31 03:33:39] [INFO ] Deduced a trap composed of 145 places in 210 ms of which 0 ms to minimize.
[2024-05-31 03:33:39] [INFO ] Deduced a trap composed of 142 places in 145 ms of which 1 ms to minimize.
[2024-05-31 03:33:39] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 1 ms to minimize.
[2024-05-31 03:33:44] [INFO ] Deduced a trap composed of 142 places in 4424 ms of which 29 ms to minimize.
[2024-05-31 03:33:44] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 1 ms to minimize.
[2024-05-31 03:33:44] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 0 ms to minimize.
[2024-05-31 03:33:45] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 1 ms to minimize.
[2024-05-31 03:33:45] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 1 ms to minimize.
[2024-05-31 03:33:45] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 1 ms to minimize.
[2024-05-31 03:33:45] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:33:46] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 1 ms to minimize.
[2024-05-31 03:33:46] [INFO ] Deduced a trap composed of 127 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:33:46] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:33:46] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:33:47] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 0 ms to minimize.
[2024-05-31 03:33:47] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2024-05-31 03:33:47] [INFO ] Deduced a trap composed of 127 places in 178 ms of which 1 ms to minimize.
[2024-05-31 03:33:48] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 0 ms to minimize.
[2024-05-31 03:33:48] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 1 ms to minimize.
[2024-05-31 03:33:48] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 0 ms to minimize.
[2024-05-31 03:33:49] [INFO ] Deduced a trap composed of 130 places in 205 ms of which 0 ms to minimize.
[2024-05-31 03:33:49] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 0 ms to minimize.
[2024-05-31 03:33:49] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:33:52] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 0 ms to minimize.
[2024-05-31 03:33:52] [INFO ] Deduced a trap composed of 127 places in 144 ms of which 0 ms to minimize.
[2024-05-31 03:33:57] [INFO ] Deduced a trap composed of 124 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:33:57] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 0 ms to minimize.
[2024-05-31 03:33:58] [INFO ] Deduced a trap composed of 133 places in 191 ms of which 0 ms to minimize.
[2024-05-31 03:34:02] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 24100 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:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 03:34:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 03:34:02] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 11 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 412/412 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 8 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 03:34:02] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:34:02] [INFO ] Invariant cache hit.
[2024-05-31 03:34:02] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 03:34:02] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:34:02] [INFO ] Invariant cache hit.
[2024-05-31 03:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:34:03] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-05-31 03:34:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 03:34:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:34:03] [INFO ] Invariant cache hit.
[2024-05-31 03:34:04] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2255 ms. Remains : 412/412 places, 578/578 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 412 transition count 574
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 412 transition count 573
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 6 place count 411 transition count 573
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 411 transition count 568
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 406 transition count 568
Applied a total of 16 rules in 26 ms. Remains 406 /412 variables (removed 6) and now considering 568/578 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 568 rows 406 cols
[2024-05-31 03:34:04] [INFO ] Computed 77 invariants in 7 ms
[2024-05-31 03:34:04] [INFO ] [Real]Absence check using 70 positive place invariants in 18 ms returned sat
[2024-05-31 03:34:04] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 03:34:04] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:34:04] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2024-05-31 03:34:05] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 03:34:05] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:34:06] [INFO ] Deduced a trap composed of 157 places in 306 ms of which 1 ms to minimize.
[2024-05-31 03:34:06] [INFO ] Deduced a trap composed of 149 places in 257 ms of which 1 ms to minimize.
[2024-05-31 03:34:06] [INFO ] Deduced a trap composed of 155 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:34:06] [INFO ] Deduced a trap composed of 161 places in 179 ms of which 0 ms to minimize.
[2024-05-31 03:34:07] [INFO ] Deduced a trap composed of 123 places in 209 ms of which 0 ms to minimize.
[2024-05-31 03:34:07] [INFO ] Deduced a trap composed of 132 places in 225 ms of which 1 ms to minimize.
[2024-05-31 03:34:07] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 1 ms to minimize.
[2024-05-31 03:34:07] [INFO ] Deduced a trap composed of 132 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:34:08] [INFO ] Deduced a trap composed of 129 places in 229 ms of which 1 ms to minimize.
[2024-05-31 03:34:08] [INFO ] Deduced a trap composed of 129 places in 199 ms of which 1 ms to minimize.
[2024-05-31 03:34:08] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:34:08] [INFO ] Deduced a trap composed of 123 places in 185 ms of which 0 ms to minimize.
[2024-05-31 03:34:09] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 0 ms to minimize.
[2024-05-31 03:34:09] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 1 ms to minimize.
[2024-05-31 03:34:10] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 1 ms to minimize.
[2024-05-31 03:34:10] [INFO ] Deduced a trap composed of 120 places in 245 ms of which 1 ms to minimize.
[2024-05-31 03:34:10] [INFO ] Deduced a trap composed of 114 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:34:12] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 1 ms to minimize.
[2024-05-31 03:34:13] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 0 ms to minimize.
[2024-05-31 03:34:13] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 1 ms to minimize.
[2024-05-31 03:34:13] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 0 ms to minimize.
[2024-05-31 03:34:14] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 1 ms to minimize.
[2024-05-31 03:34:14] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 0 ms to minimize.
[2024-05-31 03:34:15] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 0 ms to minimize.
[2024-05-31 03:34:16] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 0 ms to minimize.
[2024-05-31 03:34:22] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2024-05-31 03:34:23] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 0 ms to minimize.
[2024-05-31 03:34:23] [INFO ] Deduced a trap composed of 129 places in 215 ms of which 0 ms to minimize.
[2024-05-31 03:34:23] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 1 ms to minimize.
[2024-05-31 03:34:24] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:34:28] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 0 ms to minimize.
[2024-05-31 03:34:28] [INFO ] Deduced a trap composed of 129 places in 182 ms of which 0 ms to minimize.
[2024-05-31 03:34:28] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 1 ms to minimize.
[2024-05-31 03:34:30] [INFO ] Deduced a trap composed of 126 places in 192 ms of which 0 ms to minimize.
[2024-05-31 03:34:31] [INFO ] Deduced a trap composed of 126 places in 248 ms of which 0 ms to minimize.
[2024-05-31 03:34:32] [INFO ] Deduced a trap composed of 132 places in 243 ms of which 0 ms to minimize.
[2024-05-31 03:34:32] [INFO ] Deduced a trap composed of 126 places in 223 ms of which 1 ms to minimize.
[2024-05-31 03:34:32] [INFO ] Deduced a trap composed of 126 places in 239 ms of which 0 ms to minimize.
[2024-05-31 03:34:33] [INFO ] Deduced a trap composed of 132 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:34:34] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 0 ms to minimize.
[2024-05-31 03:34:34] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 0 ms to minimize.
[2024-05-31 03:34:40] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 1 ms to minimize.
[2024-05-31 03:34:43] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:34:51] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 0 ms to minimize.
[2024-05-31 03:34:51] [INFO ] Deduced a trap composed of 126 places in 190 ms of which 1 ms to minimize.
[2024-05-31 03:34:52] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 0 ms to minimize.
[2024-05-31 03:34:52] [INFO ] Deduced a trap composed of 126 places in 208 ms of which 1 ms to minimize.
[2024-05-31 03:34:52] [INFO ] Deduced a trap composed of 123 places in 182 ms of which 0 ms to minimize.
[2024-05-31 03:34:52] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 1 ms to minimize.
[2024-05-31 03:34:53] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 0 ms to minimize.
[2024-05-31 03:35:02] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 56344 ms
[2024-05-31 03:35:06] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 0 ms to minimize.
[2024-05-31 03:35:15] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9183 ms
[2024-05-31 03:35:15] [INFO ] After 70041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 03:35:15] [INFO ] After 70193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 1927 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 412 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 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 11 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2024-05-31 03:35:17] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2024-05-31 03:35:17] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 03:35:17] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
[2024-05-31 03:35:17] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:35:17] [INFO ] Invariant cache hit.
[2024-05-31 03:35:18] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-31 03:35:18] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:35:18] [INFO ] Invariant cache hit.
[2024-05-31 03:35:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:35:19] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-31 03:35:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 03:35:19] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2024-05-31 03:35:19] [INFO ] Invariant cache hit.
[2024-05-31 03:35:19] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2499 ms. Remains : 412/412 places, 578/578 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Finished random walk after 78 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6561 reset in 458 ms.
Product exploration explored 100000 steps with 6508 reset in 459 ms.
Built C files in :
/tmp/ltsmin12177713967130213979
[2024-05-31 03:35:21] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2024-05-31 03:35:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:21] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2024-05-31 03:35:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:21] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2024-05-31 03:35:21] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:21] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12177713967130213979
Running compilation step : cd /tmp/ltsmin12177713967130213979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1412 ms.
Running link step : cd /tmp/ltsmin12177713967130213979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin12177713967130213979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7310857052320043213.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 412 transition count 577
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 577
Applied a total of 2 rules in 15 ms. Remains 411 /412 variables (removed 1) and now considering 577/578 (removed 1) transitions.
[2024-05-31 03:35:36] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:35:36] [INFO ] Computed 77 invariants in 9 ms
[2024-05-31 03:35:37] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2024-05-31 03:35:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:35:37] [INFO ] Invariant cache hit.
[2024-05-31 03:35:37] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-31 03:35:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:35:37] [INFO ] Invariant cache hit.
[2024-05-31 03:35:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:35:38] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2024-05-31 03:35:38] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 03:35:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:35:38] [INFO ] Invariant cache hit.
[2024-05-31 03:35:38] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/412 places, 577/578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2252 ms. Remains : 411/412 places, 577/578 transitions.
Built C files in :
/tmp/ltsmin15246632153329286241
[2024-05-31 03:35:38] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2024-05-31 03:35:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:38] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2024-05-31 03:35:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:38] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2024-05-31 03:35:38] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:35:38] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15246632153329286241
Running compilation step : cd /tmp/ltsmin15246632153329286241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1724 ms.
Running link step : cd /tmp/ltsmin15246632153329286241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15246632153329286241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5938566551523834989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 03:35:53] [INFO ] Flatten gal took : 27 ms
[2024-05-31 03:35:54] [INFO ] Flatten gal took : 24 ms
[2024-05-31 03:35:54] [INFO ] Time to serialize gal into /tmp/LTL15779128464710303959.gal : 5 ms
[2024-05-31 03:35:54] [INFO ] Time to serialize properties into /tmp/LTL7584007726165304534.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15779128464710303959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17556617933898179715.hoa' '-atoms' '/tmp/LTL7584007726165304534.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7584007726165304534.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17556617933898179715.hoa
Detected timeout of ITS tools.
[2024-05-31 03:36:09] [INFO ] Flatten gal took : 38 ms
[2024-05-31 03:36:09] [INFO ] Flatten gal took : 31 ms
[2024-05-31 03:36:09] [INFO ] Time to serialize gal into /tmp/LTL17765001051152168978.gal : 11 ms
[2024-05-31 03:36:09] [INFO ] Time to serialize properties into /tmp/LTL69034254913976261.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17765001051152168978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL69034254913976261.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F((("(place_523_0<4)")&&(X("(Perform_Work_E_0<1)")))||(("(Perform_Work_E_0<1)")&&(G("((place_782_0<1)||(cJobCnt_0<10))")))))))
Formula 0 simplified : FG((!"(place_523_0<4)" | X!"(Perform_Work_E_0<1)") & (!"(Perform_Work_E_0<1)" | F!"((place_782_0<1)||(cJobCnt_0<10))"))
Detected timeout of ITS tools.
[2024-05-31 03:36:24] [INFO ] Flatten gal took : 41 ms
[2024-05-31 03:36:24] [INFO ] Applying decomposition
[2024-05-31 03:36:24] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12737811003436602448.txt' '-o' '/tmp/graph12737811003436602448.bin' '-w' '/tmp/graph12737811003436602448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12737811003436602448.bin' '-l' '-1' '-v' '-w' '/tmp/graph12737811003436602448.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:36:24] [INFO ] Decomposing Gal with order
[2024-05-31 03:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:36:24] [INFO ] Removed a total of 544 redundant transitions.
[2024-05-31 03:36:24] [INFO ] Flatten gal took : 71 ms
[2024-05-31 03:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 245 labels/synchronizations in 20 ms.
[2024-05-31 03:36:24] [INFO ] Time to serialize gal into /tmp/LTL3144139837014712302.gal : 11 ms
[2024-05-31 03:36:24] [INFO ] Time to serialize properties into /tmp/LTL4834317166035441633.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3144139837014712302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4834317166035441633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i22.u10.place_523_0<4)")&&(X("(i1.u2.Perform_Work_E_0<1)")))||(("(i1.u2.Perform_Work_E_0<1)")&&(G("((i22.u34.place_782_0<1)...184
Formula 0 simplified : FG((!"(i22.u10.place_523_0<4)" | X!"(i1.u2.Perform_Work_E_0<1)") & (!"(i1.u2.Perform_Work_E_0<1)" | F!"((i22.u34.place_782_0<1)||(u3...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13044183238475142888
[2024-05-31 03:36:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13044183238475142888
Running compilation step : cd /tmp/ltsmin13044183238475142888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1103 ms.
Running link step : cd /tmp/ltsmin13044183238475142888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin13044183238475142888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp0==true)&&X((LTLAPp1==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-COL-S05J30-LTLFireability-05 finished in 232025 ms.
[2024-05-31 03:36:54] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9642633319580550260
[2024-05-31 03:36:54] [INFO ] Computing symmetric may disable matrix : 650 transitions.
[2024-05-31 03:36:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:36:54] [INFO ] Applying decomposition
[2024-05-31 03:36:54] [INFO ] Computing symmetric may enable matrix : 650 transitions.
[2024-05-31 03:36:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:36:54] [INFO ] Flatten gal took : 36 ms
[2024-05-31 03:36:55] [INFO ] Computing Do-Not-Accords matrix : 650 transitions.
[2024-05-31 03:36:55] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:36:55] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9642633319580550260
Running compilation step : cd /tmp/ltsmin9642633319580550260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15415830290931311142.txt' '-o' '/tmp/graph15415830290931311142.bin' '-w' '/tmp/graph15415830290931311142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15415830290931311142.bin' '-l' '-1' '-v' '-w' '/tmp/graph15415830290931311142.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:36:55] [INFO ] Decomposing Gal with order
[2024-05-31 03:36:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:36:55] [INFO ] Removed a total of 899 redundant transitions.
[2024-05-31 03:36:55] [INFO ] Flatten gal took : 84 ms
[2024-05-31 03:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2024-05-31 03:36:55] [INFO ] Time to serialize gal into /tmp/LTLFireability6381654273540480376.gal : 19 ms
[2024-05-31 03:36:55] [INFO ] Time to serialize properties into /tmp/LTLFireability11240434048146131100.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6381654273540480376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11240434048146131100.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(("((((((i15.u36.cSources_0<1)||(i22.u53.DataOnSrc_0<1))||((i1.i1.u4.TheSour_0<1)||(i15.u49.CanInjectEvent_0<1)))&&(((i15.u36.cS...640
Formula 0 simplified : G(F!"((i1.i1.u68.place_782_0<1)||(i0.u69.cJobCnt_0<10))" & FG!"((((((i15.u36.cSources_0<1)||(i22.u53.DataOnSrc_0<1))||((i1.i1.u4.The...633
Compilation finished in 1666 ms.
Running link step : cd /tmp/ltsmin9642633319580550260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9642633319580550260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.507: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.580: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.786: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.775: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.149: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.149: Initializing POR dependencies: labels 654, guards 650
pins2lts-mc-linux64( 1/ 8), 1.439: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.941: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 8.136: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 8.179: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 8.186: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 9.122: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 9.144: There are 655 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 9.144: State length is 490, there are 656 groups
pins2lts-mc-linux64( 0/ 8), 9.144: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 9.144: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 9.145: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 9.145: Visible groups: 0 / 656, labels: 2 / 655
pins2lts-mc-linux64( 0/ 8), 9.145: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 9.145: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 9.338: [Blue] ~65 levels ~960 states ~3488 transitions
pins2lts-mc-linux64( 5/ 8), 9.392: [Blue] ~65 levels ~1920 states ~5568 transitions
pins2lts-mc-linux64( 5/ 8), 9.552: [Blue] ~65 levels ~3840 states ~9864 transitions
pins2lts-mc-linux64( 6/ 8), 9.885: [Blue] ~64 levels ~7680 states ~15944 transitions
pins2lts-mc-linux64( 2/ 8), 10.702: [Blue] ~63 levels ~15360 states ~29632 transitions
pins2lts-mc-linux64( 5/ 8), 12.589: [Blue] ~65 levels ~30720 states ~57832 transitions
pins2lts-mc-linux64( 5/ 8), 15.662: [Blue] ~65 levels ~61440 states ~109240 transitions
pins2lts-mc-linux64( 2/ 8), 21.724: [Blue] ~63 levels ~122880 states ~215704 transitions
pins2lts-mc-linux64( 2/ 8), 31.970: [Blue] ~63 levels ~245760 states ~423264 transitions
pins2lts-mc-linux64( 2/ 8), 47.291: [Blue] ~63 levels ~491520 states ~841744 transitions
pins2lts-mc-linux64( 2/ 8), 77.125: [Blue] ~63 levels ~983040 states ~1665072 transitions
pins2lts-mc-linux64( 2/ 8), 117.047: [Blue] ~63 levels ~1966080 states ~3292208 transitions
pins2lts-mc-linux64( 2/ 8), 174.164: [Blue] ~63 levels ~3932160 states ~6611768 transitions
pins2lts-mc-linux64( 2/ 8), 289.122: [Blue] ~63 levels ~7864320 states ~13238400 transitions
pins2lts-mc-linux64( 2/ 8), 483.103: [Blue] ~63 levels ~15728640 states ~26679048 transitions
pins2lts-mc-linux64( 2/ 8), 1005.550: [Blue] ~63 levels ~31457280 states ~58101216 transitions
pins2lts-mc-linux64( 3/ 8), 1323.937: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1323.974:
pins2lts-mc-linux64( 0/ 8), 1323.974: Explored 36985809 states 72218749 transitions, fanout: 1.953
pins2lts-mc-linux64( 0/ 8), 1323.974: Total exploration time 1314.820 sec (1314.770 sec minimum, 1314.791 sec on average)
pins2lts-mc-linux64( 0/ 8), 1323.974: States per second: 28130, Transitions per second: 54927
pins2lts-mc-linux64( 0/ 8), 1323.974:
pins2lts-mc-linux64( 0/ 8), 1323.974: State space has 36984447 states, 98 are accepting
pins2lts-mc-linux64( 0/ 8), 1323.974: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1323.974: blue states: 36985809 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1323.974: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1323.974: all-red states: 297 (0.00%), bogus 24 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1323.974:
pins2lts-mc-linux64( 0/ 8), 1323.974: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1323.974:
pins2lts-mc-linux64( 0/ 8), 1323.974: Queue width: 8B, total height: 376, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1323.974: Tree memory: 538.2MB, 15.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1323.974: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1323.974: Stored 657 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1323.974: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1323.974: Est. total memory use: 538.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9642633319580550260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9642633319580550260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 04:01:28] [INFO ] Applying decomposition
[2024-05-31 04:01:28] [INFO ] Flatten gal took : 42 ms
[2024-05-31 04:01:28] [INFO ] Decomposing Gal with order
[2024-05-31 04:01:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:01:28] [INFO ] Removed a total of 2111 redundant transitions.
[2024-05-31 04:01:29] [INFO ] Flatten gal took : 109 ms
[2024-05-31 04:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-31 04:01:29] [INFO ] Time to serialize gal into /tmp/LTLFireability1907563026356897602.gal : 22 ms
[2024-05-31 04:01:29] [INFO ] Time to serialize properties into /tmp/LTLFireability8941235443742746139.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1907563026356897602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8941235443742746139.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("((((((cSources.cSources_0<1)||(Sources0.DataOnSrc_0<1))||((Sources0.TheSour_0<1)||(CanInjectEvent.CanInjectEvent_0<1)))&&(((c...692
Formula 0 simplified : G(F!"((place_782.place_782_0<1)||(cJobCnt.cJobCnt_0<10))" & FG!"((((((cSources.cSources_0<1)||(Sources0.DataOnSrc_0<1))||((Sources0....685
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 137724 kB
After kill :
MemTotal: 16393340 kB
MemFree: 10681828 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S05J30, 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 r307-tajo-171654460700233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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