Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678960137987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 09:48:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 09:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 09:48:59] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-16 09:48:59] [INFO ] Transformed 1189 places.
[2023-03-16 09:48:59] [INFO ] Transformed 2350 transitions.
[2023-03-16 09:48:59] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
[2023-03-16 09:48:59] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 09:48:59] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 359 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Applied a total of 0 rules in 94 ms. Remains 1189 /1189 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-16 09:49:01] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-16 09:49:01] [INFO ] Computed 182 place invariants in 130 ms
[2023-03-16 09:49:06] [INFO ] Dead Transitions using invariants and state equation in 4845 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.
[2023-03-16 09:49:06] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
// Phase 1: matrix 1596 rows 1189 cols
[2023-03-16 09:49:06] [INFO ] Computed 182 place invariants in 84 ms
[2023-03-16 09:49:08] [INFO ] Implicit Places using invariants in 2429 ms returned []
[2023-03-16 09:49:08] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
[2023-03-16 09:49:08] [INFO ] Invariant cache hit.
[2023-03-16 09:49:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:49:39] [INFO ] Performed 1007/1189 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:49:46] [INFO ] Implicit Places using invariants and state equation in 37989 ms returned []
Implicit Place search using SMT with State Equation took 40422 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1189/1189 places, 1600/1695 transitions.
Applied a total of 0 rules in 36 ms. Remains 1189 /1189 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45424 ms. Remains : 1189/1189 places, 1600/1695 transitions.
Support contains 359 out of 1189 places after structural reductions.
[2023-03-16 09:49:47] [INFO ] Flatten gal took : 224 ms
[2023-03-16 09:49:47] [INFO ] Flatten gal took : 137 ms
[2023-03-16 09:49:47] [INFO ] Input system was already deterministic with 1600 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-16 09:49:48] [INFO ] Flow matrix only has 1596 transitions (discarded 4 similar events)
[2023-03-16 09:49:48] [INFO ] Invariant cache hit.
[2023-03-16 09:49:48] [INFO ] [Real]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-16 09:49:48] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 52 ms returned sat
[2023-03-16 09:49:48] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 09:49:48] [INFO ] [Nat]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-16 09:49:48] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 49 ms returned sat
[2023-03-16 09:49:53] [INFO ] After 5167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 09:49:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:49:55] [INFO ] After 1667ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 09:49:57] [INFO ] Deduced a trap composed of 508 places in 476 ms of which 5 ms to minimize.
[2023-03-16 09:49:57] [INFO ] Deduced a trap composed of 505 places in 488 ms of which 2 ms to minimize.
[2023-03-16 09:49:58] [INFO ] Deduced a trap composed of 487 places in 452 ms of which 1 ms to minimize.
[2023-03-16 09:49:58] [INFO ] Deduced a trap composed of 505 places in 449 ms of which 2 ms to minimize.
[2023-03-16 09:49:59] [INFO ] Deduced a trap composed of 505 places in 427 ms of which 4 ms to minimize.
[2023-03-16 09:49:59] [INFO ] Deduced a trap composed of 493 places in 468 ms of which 1 ms to minimize.
[2023-03-16 09:50:00] [INFO ] Deduced a trap composed of 493 places in 458 ms of which 1 ms to minimize.
[2023-03-16 09:50:00] [INFO ] Deduced a trap composed of 493 places in 459 ms of which 3 ms to minimize.
[2023-03-16 09:50:01] [INFO ] Deduced a trap composed of 502 places in 462 ms of which 1 ms to minimize.
[2023-03-16 09:50:01] [INFO ] Deduced a trap composed of 484 places in 417 ms of which 1 ms to minimize.
[2023-03-16 09:50:02] [INFO ] Deduced a trap composed of 508 places in 430 ms of which 1 ms to minimize.
[2023-03-16 09:50:02] [INFO ] Deduced a trap composed of 505 places in 430 ms of which 1 ms to minimize.
[2023-03-16 09:50:03] [INFO ] Deduced a trap composed of 505 places in 442 ms of which 1 ms to minimize.
[2023-03-16 09:50:04] [INFO ] Deduced a trap composed of 496 places in 449 ms of which 1 ms to minimize.
[2023-03-16 09:50:04] [INFO ] Deduced a trap composed of 484 places in 416 ms of which 1 ms to minimize.
[2023-03-16 09:50:05] [INFO ] Deduced a trap composed of 487 places in 417 ms of which 1 ms to minimize.
[2023-03-16 09:50:05] [INFO ] Deduced a trap composed of 481 places in 429 ms of which 1 ms to minimize.
[2023-03-16 09:50:06] [INFO ] Deduced a trap composed of 493 places in 431 ms of which 1 ms to minimize.
[2023-03-16 09:50:06] [INFO ] Deduced a trap composed of 505 places in 428 ms of which 1 ms to minimize.
[2023-03-16 09:50:07] [INFO ] Deduced a trap composed of 505 places in 451 ms of which 1 ms to minimize.
[2023-03-16 09:50:08] [INFO ] Deduced a trap composed of 496 places in 426 ms of which 1 ms to minimize.
[2023-03-16 09:50:08] [INFO ] Deduced a trap composed of 493 places in 459 ms of which 1 ms to minimize.
[2023-03-16 09:50:09] [INFO ] Deduced a trap composed of 487 places in 434 ms of which 1 ms to minimize.
[2023-03-16 09:50:09] [INFO ] Deduced a trap composed of 484 places in 414 ms of which 0 ms to minimize.
[2023-03-16 09:50:10] [INFO ] Deduced a trap composed of 481 places in 410 ms of which 1 ms to minimize.
[2023-03-16 09:50:10] [INFO ] Deduced a trap composed of 490 places in 412 ms of which 1 ms to minimize.
[2023-03-16 09:50:11] [INFO ] Deduced a trap composed of 490 places in 414 ms of which 1 ms to minimize.
[2023-03-16 09:50:11] [INFO ] Deduced a trap composed of 496 places in 407 ms of which 1 ms to minimize.
[2023-03-16 09:50:12] [INFO ] Deduced a trap composed of 487 places in 453 ms of which 1 ms to minimize.
[2023-03-16 09:50:12] [INFO ] Deduced a trap composed of 526 places in 403 ms of which 1 ms to minimize.
[2023-03-16 09:50:13] [INFO ] Deduced a trap composed of 481 places in 416 ms of which 1 ms to minimize.
[2023-03-16 09:50:13] [INFO ] Deduced a trap composed of 517 places in 418 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 09:50:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:50:13] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 82 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1184 transition count 1595
Reduce places removed 5 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 86 rules applied. Total rules applied 96 place count 1179 transition count 1514
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 177 place count 1098 transition count 1514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 177 place count 1098 transition count 1510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 1094 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 1093 transition count 1509
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 1093 transition count 1509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 191 place count 1091 transition count 1507
Applied a total of 191 rules in 389 ms. Remains 1091 /1189 variables (removed 98) and now considering 1507/1600 (removed 93) transitions.
[2023-03-16 09:50:13] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
// Phase 1: matrix 1503 rows 1091 cols
[2023-03-16 09:50:14] [INFO ] Computed 177 place invariants in 47 ms
[2023-03-16 09:50:16] [INFO ] Dead Transitions using invariants and state equation in 2387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2780 ms. Remains : 1091/1189 places, 1507/1600 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98039 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98039 steps, saw 29325 distinct states, run finished after 3007 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 09:50:19] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 09:50:19] [INFO ] Invariant cache hit.
[2023-03-16 09:50:19] [INFO ] [Real]Absence check using 156 positive place invariants in 28 ms returned sat
[2023-03-16 09:50:19] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 51 ms returned sat
[2023-03-16 09:50:20] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 09:50:20] [INFO ] [Nat]Absence check using 156 positive place invariants in 27 ms returned sat
[2023-03-16 09:50:20] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 52 ms returned sat
[2023-03-16 09:50:32] [INFO ] After 12142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 09:50:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:50:32] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 09:50:32] [INFO ] Deduced a trap composed of 429 places in 403 ms of which 1 ms to minimize.
[2023-03-16 09:50:33] [INFO ] Deduced a trap composed of 399 places in 371 ms of which 1 ms to minimize.
[2023-03-16 09:50:33] [INFO ] Deduced a trap composed of 407 places in 400 ms of which 1 ms to minimize.
[2023-03-16 09:50:34] [INFO ] Deduced a trap composed of 395 places in 391 ms of which 1 ms to minimize.
[2023-03-16 09:50:34] [INFO ] Deduced a trap composed of 411 places in 377 ms of which 0 ms to minimize.
[2023-03-16 09:50:35] [INFO ] Deduced a trap composed of 410 places in 393 ms of which 1 ms to minimize.
[2023-03-16 09:50:35] [INFO ] Deduced a trap composed of 389 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:50:36] [INFO ] Deduced a trap composed of 399 places in 383 ms of which 2 ms to minimize.
[2023-03-16 09:50:36] [INFO ] Deduced a trap composed of 416 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:50:37] [INFO ] Deduced a trap composed of 410 places in 384 ms of which 0 ms to minimize.
[2023-03-16 09:50:37] [INFO ] Deduced a trap composed of 395 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:50:38] [INFO ] Deduced a trap composed of 386 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:50:38] [INFO ] Deduced a trap composed of 407 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:50:39] [INFO ] Deduced a trap composed of 408 places in 386 ms of which 1 ms to minimize.
[2023-03-16 09:50:39] [INFO ] Deduced a trap composed of 402 places in 382 ms of which 0 ms to minimize.
[2023-03-16 09:50:41] [INFO ] Deduced a trap composed of 416 places in 385 ms of which 1 ms to minimize.
[2023-03-16 09:50:41] [INFO ] Deduced a trap composed of 395 places in 402 ms of which 1 ms to minimize.
[2023-03-16 09:50:43] [INFO ] Deduced a trap composed of 414 places in 390 ms of which 1 ms to minimize.
[2023-03-16 09:50:43] [INFO ] Deduced a trap composed of 403 places in 380 ms of which 1 ms to minimize.
[2023-03-16 09:50:44] [INFO ] Deduced a trap composed of 417 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:50:45] [INFO ] Deduced a trap composed of 398 places in 396 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 09:50:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:50:45] [INFO ] After 25205ms 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 82 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 58 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 55 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
[2023-03-16 09:50:45] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 09:50:45] [INFO ] Invariant cache hit.
[2023-03-16 09:50:47] [INFO ] Implicit Places using invariants in 2515 ms returned []
[2023-03-16 09:50:47] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 09:50:47] [INFO ] Invariant cache hit.
[2023-03-16 09:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:51:18] [INFO ] Performed 905/1091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:51:23] [INFO ] Implicit Places using invariants and state equation in 35466 ms returned []
Implicit Place search using SMT with State Equation took 37987 ms to find 0 implicit places.
[2023-03-16 09:51:23] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-16 09:51:23] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-16 09:51:23] [INFO ] Invariant cache hit.
[2023-03-16 09:51:25] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40436 ms. Remains : 1091/1091 places, 1507/1507 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 1091 transition count 1503
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 1091 transition count 1502
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1090 transition count 1502
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1090 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1089 transition count 1501
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1089 transition count 1496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1084 transition count 1496
Applied a total of 18 rules in 179 ms. Remains 1084 /1091 variables (removed 7) and now considering 1496/1507 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1496 rows 1084 cols
[2023-03-16 09:51:25] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-16 09:51:26] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-16 09:51:26] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 54 ms returned sat
[2023-03-16 09:51:26] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 09:51:26] [INFO ] [Nat]Absence check using 156 positive place invariants in 30 ms returned sat
[2023-03-16 09:51:26] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-16 09:51:38] [INFO ] After 11729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 09:51:38] [INFO ] Deduced a trap composed of 414 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:51:39] [INFO ] Deduced a trap composed of 387 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:51:39] [INFO ] Deduced a trap composed of 405 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:51:39] [INFO ] Deduced a trap composed of 399 places in 394 ms of which 3 ms to minimize.
[2023-03-16 09:51:40] [INFO ] Deduced a trap composed of 414 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:51:40] [INFO ] Deduced a trap composed of 381 places in 403 ms of which 1 ms to minimize.
[2023-03-16 09:51:41] [INFO ] Deduced a trap composed of 393 places in 385 ms of which 1 ms to minimize.
[2023-03-16 09:51:42] [INFO ] Deduced a trap composed of 408 places in 391 ms of which 1 ms to minimize.
[2023-03-16 09:51:42] [INFO ] Deduced a trap composed of 429 places in 372 ms of which 1 ms to minimize.
[2023-03-16 09:51:42] [INFO ] Deduced a trap composed of 399 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:51:43] [INFO ] Deduced a trap composed of 390 places in 366 ms of which 2 ms to minimize.
[2023-03-16 09:51:43] [INFO ] Deduced a trap composed of 396 places in 365 ms of which 2 ms to minimize.
[2023-03-16 09:51:44] [INFO ] Deduced a trap composed of 393 places in 380 ms of which 1 ms to minimize.
[2023-03-16 09:51:45] [INFO ] Deduced a trap composed of 408 places in 373 ms of which 2 ms to minimize.
[2023-03-16 09:51:45] [INFO ] Deduced a trap composed of 414 places in 379 ms of which 0 ms to minimize.
[2023-03-16 09:51:46] [INFO ] Deduced a trap composed of 402 places in 389 ms of which 1 ms to minimize.
[2023-03-16 09:51:46] [INFO ] Deduced a trap composed of 411 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:51:46] [INFO ] Deduced a trap composed of 420 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:51:47] [INFO ] Deduced a trap composed of 411 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:51:50] [INFO ] Deduced a trap composed of 387 places in 374 ms of which 0 ms to minimize.
[2023-03-16 09:51:51] [INFO ] Deduced a trap composed of 396 places in 384 ms of which 1 ms to minimize.
[2023-03-16 09:51:51] [INFO ] Deduced a trap composed of 417 places in 404 ms of which 1 ms to minimize.
[2023-03-16 09:51:52] [INFO ] Deduced a trap composed of 411 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:51:52] [INFO ] Deduced a trap composed of 399 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:51:53] [INFO ] Deduced a trap composed of 399 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:51:54] [INFO ] Deduced a trap composed of 399 places in 377 ms of which 1 ms to minimize.
[2023-03-16 09:51:55] [INFO ] Deduced a trap composed of 387 places in 389 ms of which 1 ms to minimize.
[2023-03-16 09:51:55] [INFO ] Deduced a trap composed of 414 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:51:56] [INFO ] Deduced a trap composed of 414 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:51:56] [INFO ] Deduced a trap composed of 402 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:51:56] [INFO ] Deduced a trap composed of 405 places in 360 ms of which 1 ms to minimize.
[2023-03-16 09:51:57] [INFO ] Deduced a trap composed of 390 places in 390 ms of which 1 ms to minimize.
[2023-03-16 09:51:57] [INFO ] Deduced a trap composed of 402 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:51:58] [INFO ] Deduced a trap composed of 396 places in 382 ms of which 0 ms to minimize.
[2023-03-16 09:51:59] [INFO ] Deduced a trap composed of 384 places in 388 ms of which 1 ms to minimize.
[2023-03-16 09:51:59] [INFO ] Deduced a trap composed of 387 places in 375 ms of which 1 ms to minimize.
[2023-03-16 09:52:00] [INFO ] Deduced a trap composed of 405 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:52:00] [INFO ] Deduced a trap composed of 408 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:52:01] [INFO ] Deduced a trap composed of 405 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:52:01] [INFO ] Deduced a trap composed of 417 places in 399 ms of which 1 ms to minimize.
[2023-03-16 09:52:02] [INFO ] Deduced a trap composed of 384 places in 401 ms of which 1 ms to minimize.
[2023-03-16 09:52:03] [INFO ] Deduced a trap composed of 396 places in 376 ms of which 1 ms to minimize.
[2023-03-16 09:52:03] [INFO ] Deduced a trap composed of 381 places in 380 ms of which 0 ms to minimize.
[2023-03-16 09:52:04] [INFO ] Deduced a trap composed of 393 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:52:05] [INFO ] Deduced a trap composed of 384 places in 379 ms of which 1 ms to minimize.
[2023-03-16 09:52:07] [INFO ] Deduced a trap composed of 429 places in 401 ms of which 1 ms to minimize.
[2023-03-16 09:52:08] [INFO ] Deduced a trap composed of 411 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:52:08] [INFO ] Deduced a trap composed of 414 places in 389 ms of which 1 ms to minimize.
[2023-03-16 09:52:09] [INFO ] Deduced a trap composed of 417 places in 355 ms of which 1 ms to minimize.
[2023-03-16 09:52:09] [INFO ] Deduced a trap composed of 396 places in 393 ms of which 1 ms to minimize.
[2023-03-16 09:52:10] [INFO ] Deduced a trap composed of 405 places in 392 ms of which 1 ms to minimize.
[2023-03-16 09:52:11] [INFO ] Deduced a trap composed of 390 places in 382 ms of which 0 ms to minimize.
[2023-03-16 09:52:11] [INFO ] Deduced a trap composed of 408 places in 380 ms of which 1 ms to minimize.
[2023-03-16 09:52:12] [INFO ] Deduced a trap composed of 408 places in 364 ms of which 1 ms to minimize.
[2023-03-16 09:52:12] [INFO ] Deduced a trap composed of 399 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:52:13] [INFO ] Deduced a trap composed of 417 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:52:13] [INFO ] Deduced a trap composed of 396 places in 356 ms of which 0 ms to minimize.
[2023-03-16 09:52:14] [INFO ] Deduced a trap composed of 387 places in 390 ms of which 0 ms to minimize.
[2023-03-16 09:52:15] [INFO ] Deduced a trap composed of 390 places in 385 ms of which 0 ms to minimize.
[2023-03-16 09:52:16] [INFO ] Deduced a trap composed of 381 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:52:16] [INFO ] Deduced a trap composed of 402 places in 381 ms of which 1 ms to minimize.
[2023-03-16 09:52:17] [INFO ] Deduced a trap composed of 408 places in 402 ms of which 1 ms to minimize.
[2023-03-16 09:52:17] [INFO ] Deduced a trap composed of 393 places in 394 ms of which 1 ms to minimize.
[2023-03-16 09:52:18] [INFO ] Deduced a trap composed of 399 places in 384 ms of which 1 ms to minimize.
[2023-03-16 09:52:19] [INFO ] Deduced a trap composed of 405 places in 396 ms of which 1 ms to minimize.
[2023-03-16 09:52:19] [INFO ] Deduced a trap composed of 399 places in 381 ms of which 0 ms to minimize.
[2023-03-16 09:52:20] [INFO ] Deduced a trap composed of 399 places in 373 ms of which 1 ms to minimize.
[2023-03-16 09:52:20] [INFO ] Deduced a trap composed of 402 places in 399 ms of which 1 ms to minimize.
[2023-03-16 09:52:21] [INFO ] Deduced a trap composed of 411 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:52:21] [INFO ] Deduced a trap composed of 420 places in 385 ms of which 1 ms to minimize.
[2023-03-16 09:52:22] [INFO ] Deduced a trap composed of 384 places in 364 ms of which 0 ms to minimize.
[2023-03-16 09:52:23] [INFO ] Deduced a trap composed of 375 places in 366 ms of which 1 ms to minimize.
[2023-03-16 09:52:23] [INFO ] Deduced a trap composed of 396 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:52:24] [INFO ] Deduced a trap composed of 384 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:52:24] [INFO ] Deduced a trap composed of 393 places in 379 ms of which 0 ms to minimize.
[2023-03-16 09:52:24] [INFO ] Deduced a trap composed of 396 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:52:25] [INFO ] Deduced a trap composed of 417 places in 367 ms of which 0 ms to minimize.
[2023-03-16 09:52:25] [INFO ] Deduced a trap composed of 414 places in 374 ms of which 1 ms to minimize.
[2023-03-16 09:52:26] [INFO ] Deduced a trap composed of 399 places in 362 ms of which 1 ms to minimize.
[2023-03-16 09:52:26] [INFO ] Deduced a trap composed of 402 places in 363 ms of which 1 ms to minimize.
[2023-03-16 09:52:27] [INFO ] Deduced a trap composed of 396 places in 371 ms of which 0 ms to minimize.
[2023-03-16 09:52:28] [INFO ] Deduced a trap composed of 408 places in 367 ms of which 1 ms to minimize.
[2023-03-16 09:52:28] [INFO ] Deduced a trap composed of 399 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:52:29] [INFO ] Deduced a trap composed of 390 places in 358 ms of which 1 ms to minimize.
[2023-03-16 09:52:29] [INFO ] Deduced a trap composed of 390 places in 382 ms of which 1 ms to minimize.
[2023-03-16 09:52:30] [INFO ] Deduced a trap composed of 408 places in 387 ms of which 1 ms to minimize.
[2023-03-16 09:52:30] [INFO ] Deduced a trap composed of 408 places in 368 ms of which 0 ms to minimize.
[2023-03-16 09:52:31] [INFO ] Deduced a trap composed of 414 places in 358 ms of which 0 ms to minimize.
[2023-03-16 09:52:31] [INFO ] Deduced a trap composed of 408 places in 370 ms of which 1 ms to minimize.
[2023-03-16 09:52:31] [INFO ] Deduced a trap composed of 387 places in 365 ms of which 1 ms to minimize.
[2023-03-16 09:52:32] [INFO ] Deduced a trap composed of 420 places in 383 ms of which 1 ms to minimize.
[2023-03-16 09:52:33] [INFO ] Deduced a trap composed of 384 places in 388 ms of which 1 ms to minimize.
[2023-03-16 09:52:35] [INFO ] Deduced a trap composed of 399 places in 390 ms of which 1 ms to minimize.
[2023-03-16 09:52:36] [INFO ] Deduced a trap composed of 417 places in 374 ms of which 0 ms to minimize.
[2023-03-16 09:52:36] [INFO ] Deduced a trap composed of 393 places in 369 ms of which 1 ms to minimize.
[2023-03-16 09:52:37] [INFO ] Deduced a trap composed of 393 places in 365 ms of which 2 ms to minimize.
[2023-03-16 09:52:38] [INFO ] Deduced a trap composed of 381 places in 392 ms of which 1 ms to minimize.
[2023-03-16 09:52:38] [INFO ] Deduced a trap composed of 390 places in 378 ms of which 1 ms to minimize.
[2023-03-16 09:52:39] [INFO ] Deduced a trap composed of 399 places in 408 ms of which 1 ms to minimize.
[2023-03-16 09:52:48] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 70508 ms
[2023-03-16 09:52:48] [INFO ] After 82431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 09:52:48] [INFO ] After 82672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p1||X(p1)) U p2)||p0))))'
Support contains 82 out of 1189 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 54 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-16 09:52:49] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 09:52:49] [INFO ] Computed 177 place invariants in 34 ms
[2023-03-16 09:52:52] [INFO ] Dead Transitions using invariants and state equation in 3440 ms found 0 transitions.
[2023-03-16 09:52:52] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:52:52] [INFO ] Invariant cache hit.
[2023-03-16 09:52:55] [INFO ] Implicit Places using invariants in 2590 ms returned []
[2023-03-16 09:52:55] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:52:55] [INFO ] Invariant cache hit.
[2023-03-16 09:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:53:26] [INFO ] Performed 449/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:53:56] [INFO ] Performed 941/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 09:54:07] [INFO ] Implicit Places using invariants and state equation in 72538 ms returned []
Implicit Place search using SMT with State Equation took 75132 ms to find 0 implicit places.
[2023-03-16 09:54:07] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:54:07] [INFO ] Invariant cache hit.
[2023-03-16 09:54:11] [INFO ] Dead Transitions using invariants and state equation in 3489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82118 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s773 1) (GEQ s1 1) (GEQ s834 1) (GEQ s381 1) (GEQ s1171 1) (GEQ s895 1) (GEQ s571 1) (GEQ s75 1) (GEQ s1112 1) (GEQ s515 1) (GEQ s208 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-01 finished in 82469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1184 transition count 1516
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1100 transition count 1516
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1100 transition count 1432
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1016 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1015 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1015 transition count 1431
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 340 place count 1014 transition count 1430
Applied a total of 340 rules in 175 ms. Remains 1014 /1189 variables (removed 175) and now considering 1430/1600 (removed 170) transitions.
[2023-03-16 09:54:11] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-16 09:54:11] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-16 09:54:13] [INFO ] Dead Transitions using invariants and state equation in 1904 ms found 0 transitions.
[2023-03-16 09:54:13] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:54:13] [INFO ] Invariant cache hit.
[2023-03-16 09:54:16] [INFO ] Implicit Places using invariants in 2370 ms returned []
[2023-03-16 09:54:16] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:54:16] [INFO ] Invariant cache hit.
[2023-03-16 09:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:54:46] [INFO ] Performed 748/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:54:56] [INFO ] Implicit Places using invariants and state equation in 40091 ms returned []
Implicit Place search using SMT with State Equation took 42462 ms to find 0 implicit places.
[2023-03-16 09:54:56] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-16 09:54:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:54:56] [INFO ] Invariant cache hit.
[2023-03-16 09:54:58] [INFO ] Dead Transitions using invariants and state equation in 1948 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1189 places, 1430/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46579 ms. Remains : 1014/1189 places, 1430/1600 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-03 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 s739 1) (OR (LT s485 9) (LT s806 1) (LT s898 1)) (OR (LT s485 9) (LT s547 1) (LT s898 1)) (OR (LT s485 9) (LT s898 1) (LT s936 1)) (OR (LT s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5519 reset in 878 ms.
Product exploration explored 100000 steps with 5582 reset in 802 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-16 09:55:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:55:00] [INFO ] Invariant cache hit.
[2023-03-16 09:55:01] [INFO ] [Real]Absence check using 156 positive place invariants in 115 ms returned sat
[2023-03-16 09:55:01] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 95 ms returned sat
[2023-03-16 09:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:55:06] [INFO ] [Real]Absence check using state equation in 4767 ms returned sat
[2023-03-16 09:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:55:07] [INFO ] [Nat]Absence check using 156 positive place invariants in 160 ms returned sat
[2023-03-16 09:55:07] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 190 ms returned sat
[2023-03-16 09:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:55:13] [INFO ] [Nat]Absence check using state equation in 5852 ms returned sat
[2023-03-16 09:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2023-03-16 09:55:13] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 120 ms.
[2023-03-16 09:55:14] [INFO ] Added : 18 causal constraints over 4 iterations in 820 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 51 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 09:55:14] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:55:14] [INFO ] Invariant cache hit.
[2023-03-16 09:55:16] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
[2023-03-16 09:55:16] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:55:16] [INFO ] Invariant cache hit.
[2023-03-16 09:55:18] [INFO ] Implicit Places using invariants in 2417 ms returned []
[2023-03-16 09:55:18] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:55:18] [INFO ] Invariant cache hit.
[2023-03-16 09:55:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:55:49] [INFO ] Performed 694/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:56:00] [INFO ] Implicit Places using invariants and state equation in 41257 ms returned []
Implicit Place search using SMT with State Equation took 43675 ms to find 0 implicit places.
[2023-03-16 09:56:00] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 09:56:00] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:56:00] [INFO ] Invariant cache hit.
[2023-03-16 09:56:02] [INFO ] Dead Transitions using invariants and state equation in 2031 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47686 ms. Remains : 1014/1014 places, 1430/1430 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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-16 09:56:02] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:56:02] [INFO ] Invariant cache hit.
[2023-03-16 09:56:03] [INFO ] [Real]Absence check using 156 positive place invariants in 109 ms returned sat
[2023-03-16 09:56:03] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 92 ms returned sat
[2023-03-16 09:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:09] [INFO ] [Real]Absence check using state equation in 5310 ms returned sat
[2023-03-16 09:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:56:10] [INFO ] [Nat]Absence check using 156 positive place invariants in 167 ms returned sat
[2023-03-16 09:56:10] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 198 ms returned sat
[2023-03-16 09:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:56:16] [INFO ] [Nat]Absence check using state equation in 6016 ms returned sat
[2023-03-16 09:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2023-03-16 09:56:16] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 85 ms.
[2023-03-16 09:56:17] [INFO ] Added : 18 causal constraints over 4 iterations in 781 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5549 reset in 741 ms.
Product exploration explored 100000 steps with 5460 reset in 786 ms.
Built C files in :
/tmp/ltsmin6013359889922783826
[2023-03-16 09:56:19] [INFO ] Computing symmetric may disable matrix : 1430 transitions.
[2023-03-16 09:56:19] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:56:19] [INFO ] Computing symmetric may enable matrix : 1430 transitions.
[2023-03-16 09:56:19] [INFO ] Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:56:19] [INFO ] Computing Do-Not-Accords matrix : 1430 transitions.
[2023-03-16 09:56:19] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:56:19] [INFO ] Built C files in 450ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6013359889922783826
Running compilation step : cd /tmp/ltsmin6013359889922783826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6013359889922783826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6013359889922783826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 66 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 09:56:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:56:22] [INFO ] Invariant cache hit.
[2023-03-16 09:56:24] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
[2023-03-16 09:56:24] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:56:24] [INFO ] Invariant cache hit.
[2023-03-16 09:56:27] [INFO ] Implicit Places using invariants in 2369 ms returned []
[2023-03-16 09:56:27] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:56:27] [INFO ] Invariant cache hit.
[2023-03-16 09:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:56:58] [INFO ] Performed 838/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:57:05] [INFO ] Implicit Places using invariants and state equation in 38610 ms returned []
Implicit Place search using SMT with State Equation took 40983 ms to find 0 implicit places.
[2023-03-16 09:57:05] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-16 09:57:05] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 09:57:05] [INFO ] Invariant cache hit.
[2023-03-16 09:57:07] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45103 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin6196503613090514100
[2023-03-16 09:57:07] [INFO ] Computing symmetric may disable matrix : 1430 transitions.
[2023-03-16 09:57:07] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:57:07] [INFO ] Computing symmetric may enable matrix : 1430 transitions.
[2023-03-16 09:57:07] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:57:08] [INFO ] Computing Do-Not-Accords matrix : 1430 transitions.
[2023-03-16 09:57:08] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 09:57:08] [INFO ] Built C files in 463ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6196503613090514100
Running compilation step : cd /tmp/ltsmin6196503613090514100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6196503613090514100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6196503613090514100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 09:57:11] [INFO ] Flatten gal took : 120 ms
[2023-03-16 09:57:11] [INFO ] Flatten gal took : 91 ms
[2023-03-16 09:57:11] [INFO ] Time to serialize gal into /tmp/LTL1825558778133159081.gal : 21 ms
[2023-03-16 09:57:11] [INFO ] Time to serialize properties into /tmp/LTL4593786174658872823.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1825558778133159081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2985352398166985268.hoa' '-atoms' '/tmp/LTL4593786174658872823.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4593786174658872823.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2985352398166985268.hoa
Detected timeout of ITS tools.
[2023-03-16 09:57:26] [INFO ] Flatten gal took : 59 ms
[2023-03-16 09:57:27] [INFO ] Flatten gal took : 92 ms
[2023-03-16 09:57:27] [INFO ] Time to serialize gal into /tmp/LTL12992066756952645709.gal : 42 ms
[2023-03-16 09:57:27] [INFO ] Time to serialize properties into /tmp/LTL7573751892240457181.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12992066756952645709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7573751892240457181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((Schedule_Task_B_1<1)&&(((cSources<9)||(ModifiedSrc_4<1))||(place_500_1<1)))&&((((cSources<9)||(ModifiedSrc_2<1))||(place_5...335
Formula 0 simplified : GF!"((((Schedule_Task_B_1<1)&&(((cSources<9)||(ModifiedSrc_4<1))||(place_500_1<1)))&&((((cSources<9)||(ModifiedSrc_2<1))||(place_500...329
Detected timeout of ITS tools.
[2023-03-16 09:57:42] [INFO ] Flatten gal took : 55 ms
[2023-03-16 09:57:42] [INFO ] Applying decomposition
[2023-03-16 09:57:42] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12989640009197804778.txt' '-o' '/tmp/graph12989640009197804778.bin' '-w' '/tmp/graph12989640009197804778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12989640009197804778.bin' '-l' '-1' '-v' '-w' '/tmp/graph12989640009197804778.weights' '-q' '0' '-e' '0.001'
[2023-03-16 09:57:42] [INFO ] Decomposing Gal with order
[2023-03-16 09:57:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 09:57:42] [INFO ] Removed a total of 1717 redundant transitions.
[2023-03-16 09:57:43] [INFO ] Flatten gal took : 387 ms
[2023-03-16 09:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 41 ms.
[2023-03-16 09:57:43] [INFO ] Time to serialize gal into /tmp/LTL15583246774394352940.gal : 15 ms
[2023-03-16 09:57:43] [INFO ] Time to serialize properties into /tmp/LTL8566364050586374462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15583246774394352940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8566364050586374462.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i22.u61.Schedule_Task_B_1<1)&&(((i5.u9.cSources<9)||(i5.u9.ModifiedSrc_4<1))||(i5.u9.place_500_1<1)))&&((((i5.u9.cSources<...433
Formula 0 simplified : GF!"((((i22.u61.Schedule_Task_B_1<1)&&(((i5.u9.cSources<9)||(i5.u9.ModifiedSrc_4<1))||(i5.u9.place_500_1<1)))&&((((i5.u9.cSources<9)...427
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15190415221493163228
[2023-03-16 09:57:58] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15190415221493163228
Running compilation step : cd /tmp/ltsmin15190415221493163228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2807 ms.
Running link step : cd /tmp/ltsmin15190415221493163228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15190415221493163228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-03 finished in 241555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Support contains 96 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1188 transition count 1599
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1188 transition count 1599
Applied a total of 2 rules in 44 ms. Remains 1188 /1189 variables (removed 1) and now considering 1599/1600 (removed 1) transitions.
[2023-03-16 09:58:13] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-16 09:58:13] [INFO ] Computed 182 place invariants in 36 ms
[2023-03-16 09:58:17] [INFO ] Dead Transitions using invariants and state equation in 3686 ms found 0 transitions.
[2023-03-16 09:58:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:58:17] [INFO ] Invariant cache hit.
[2023-03-16 09:58:19] [INFO ] Implicit Places using invariants in 2606 ms returned []
[2023-03-16 09:58:19] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:58:19] [INFO ] Invariant cache hit.
[2023-03-16 09:58:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:58:50] [INFO ] Performed 547/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 09:59:20] [INFO ] Implicit Places using invariants and state equation in 60582 ms returned []
Implicit Place search using SMT with State Equation took 63191 ms to find 0 implicit places.
[2023-03-16 09:59:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:59:20] [INFO ] Invariant cache hit.
[2023-03-16 09:59:23] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1188/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70313 ms. Remains : 1188/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s406 1), p1:(AND (OR (LT s370 1) (LT s579 1) (LT s842 1) (LT s1072 1)) (OR (LT s579 1) (LT s675 1) (LT s842 1) (LT s1038 1)) (OR (LT s522 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10331 reset in 757 ms.
Product exploration explored 100000 steps with 10320 reset in 754 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 371 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1916 steps, including 131 resets, run visited all 4 properties in 25 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 09:59:26] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:59:26] [INFO ] Invariant cache hit.
[2023-03-16 09:59:28] [INFO ] [Real]Absence check using 155 positive place invariants in 120 ms returned sat
[2023-03-16 09:59:28] [INFO ] [Real]Absence check using 155 positive and 27 generalized place invariants in 165 ms returned sat
[2023-03-16 09:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 09:59:36] [INFO ] [Real]Absence check using state equation in 8182 ms returned sat
[2023-03-16 09:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 09:59:38] [INFO ] [Nat]Absence check using 155 positive place invariants in 152 ms returned sat
[2023-03-16 09:59:38] [INFO ] [Nat]Absence check using 155 positive and 27 generalized place invariants in 264 ms returned sat
[2023-03-16 09:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 09:59:45] [INFO ] [Nat]Absence check using state equation in 7671 ms returned sat
[2023-03-16 09:59:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 09:59:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 2718 ms returned sat
[2023-03-16 09:59:48] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 81 ms.
[2023-03-16 09:59:49] [INFO ] Added : 40 causal constraints over 8 iterations in 991 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 22 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 09:59:49] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:59:49] [INFO ] Invariant cache hit.
[2023-03-16 09:59:53] [INFO ] Dead Transitions using invariants and state equation in 3476 ms found 0 transitions.
[2023-03-16 09:59:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:59:53] [INFO ] Invariant cache hit.
[2023-03-16 09:59:55] [INFO ] Implicit Places using invariants in 2589 ms returned []
[2023-03-16 09:59:55] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 09:59:55] [INFO ] Invariant cache hit.
[2023-03-16 09:59:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:00:26] [INFO ] Performed 701/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:00:51] [INFO ] Implicit Places using invariants and state equation in 55961 ms returned []
Implicit Place search using SMT with State Equation took 58553 ms to find 0 implicit places.
[2023-03-16 10:00:51] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:00:51] [INFO ] Invariant cache hit.
[2023-03-16 10:00:55] [INFO ] Dead Transitions using invariants and state equation in 3316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65370 ms. Remains : 1188/1188 places, 1599/1599 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) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 90 steps, including 4 resets, run visited all 4 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 314 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 453 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 10:00:56] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:00:56] [INFO ] Invariant cache hit.
[2023-03-16 10:00:58] [INFO ] [Real]Absence check using 155 positive place invariants in 117 ms returned sat
[2023-03-16 10:00:58] [INFO ] [Real]Absence check using 155 positive and 27 generalized place invariants in 167 ms returned sat
[2023-03-16 10:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:01:06] [INFO ] [Real]Absence check using state equation in 8239 ms returned sat
[2023-03-16 10:01:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:01:08] [INFO ] [Nat]Absence check using 155 positive place invariants in 151 ms returned sat
[2023-03-16 10:01:08] [INFO ] [Nat]Absence check using 155 positive and 27 generalized place invariants in 250 ms returned sat
[2023-03-16 10:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:01:15] [INFO ] [Nat]Absence check using state equation in 7564 ms returned sat
[2023-03-16 10:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:01:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2624 ms returned sat
[2023-03-16 10:01:18] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 86 ms.
[2023-03-16 10:01:19] [INFO ] Added : 40 causal constraints over 8 iterations in 964 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10327 reset in 674 ms.
Product exploration explored 100000 steps with 10326 reset in 717 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1188 transition count 1600
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1188 transition count 1600
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1188 transition count 1600
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 1 ms
Applied a total of 335 rules in 257 ms. Remains 1105 /1188 variables (removed 83) and now considering 1517/1599 (removed 82) transitions.
[2023-03-16 10:01:21] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
// Phase 1: matrix 1513 rows 1105 cols
[2023-03-16 10:01:21] [INFO ] Computed 182 place invariants in 31 ms
[2023-03-16 10:01:23] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
[2023-03-16 10:01:23] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 10:01:23] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
[2023-03-16 10:01:23] [INFO ] Invariant cache hit.
[2023-03-16 10:01:25] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1105/1188 places, 1517/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4194 ms. Remains : 1105/1188 places, 1517/1599 transitions.
Built C files in :
/tmp/ltsmin11326318939143176151
[2023-03-16 10:01:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11326318939143176151
Running compilation step : cd /tmp/ltsmin11326318939143176151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11326318939143176151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11326318939143176151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 25 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-16 10:01:28] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-16 10:01:28] [INFO ] Computed 182 place invariants in 31 ms
[2023-03-16 10:01:32] [INFO ] Dead Transitions using invariants and state equation in 3462 ms found 0 transitions.
[2023-03-16 10:01:32] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:01:32] [INFO ] Invariant cache hit.
[2023-03-16 10:01:34] [INFO ] Implicit Places using invariants in 2651 ms returned []
[2023-03-16 10:01:34] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:01:34] [INFO ] Invariant cache hit.
[2023-03-16 10:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:02:05] [INFO ] Performed 625/1188 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:02:35] [INFO ] Performed 1186/1188 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 10:02:35] [INFO ] Implicit Places using invariants and state equation in 61058 ms returned []
Implicit Place search using SMT with State Equation took 63711 ms to find 0 implicit places.
[2023-03-16 10:02:35] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:02:35] [INFO ] Invariant cache hit.
[2023-03-16 10:02:39] [INFO ] Dead Transitions using invariants and state equation in 3525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70725 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Built C files in :
/tmp/ltsmin7586267073319807646
[2023-03-16 10:02:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7586267073319807646
Running compilation step : cd /tmp/ltsmin7586267073319807646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7586267073319807646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7586267073319807646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 10:02:42] [INFO ] Flatten gal took : 64 ms
[2023-03-16 10:02:42] [INFO ] Flatten gal took : 55 ms
[2023-03-16 10:02:42] [INFO ] Time to serialize gal into /tmp/LTL5690849337937311286.gal : 10 ms
[2023-03-16 10:02:42] [INFO ] Time to serialize properties into /tmp/LTL1533801612106581659.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5690849337937311286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2255486781913024940.hoa' '-atoms' '/tmp/LTL1533801612106581659.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1533801612106581659.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2255486781913024940.hoa
Detected timeout of ITS tools.
[2023-03-16 10:02:57] [INFO ] Flatten gal took : 58 ms
[2023-03-16 10:02:57] [INFO ] Flatten gal took : 56 ms
[2023-03-16 10:02:57] [INFO ] Time to serialize gal into /tmp/LTL13290330648644842434.gal : 9 ms
[2023-03-16 10:02:57] [INFO ] Time to serialize properties into /tmp/LTL13629336362002337897.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13290330648644842434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13629336362002337897.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Try_Check_Sources_B_1>=1)")||(G((F(G("((((((DataOnSrc_3<1)||(cSources<1))||((CanInjectEvent<1)||(TheSour_3<1)))&&(((cSources...3923
Formula 0 simplified : XG(!"(Try_Check_Sources_B_1>=1)" & F(GF!"((((((DataOnSrc_3<1)||(cSources<1))||((CanInjectEvent<1)||(TheSour_3<1)))&&(((cSources<1)||...3909
Detected timeout of ITS tools.
[2023-03-16 10:03:12] [INFO ] Flatten gal took : 65 ms
[2023-03-16 10:03:12] [INFO ] Applying decomposition
[2023-03-16 10:03:12] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17536488852806323549.txt' '-o' '/tmp/graph17536488852806323549.bin' '-w' '/tmp/graph17536488852806323549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17536488852806323549.bin' '-l' '-1' '-v' '-w' '/tmp/graph17536488852806323549.weights' '-q' '0' '-e' '0.001'
[2023-03-16 10:03:13] [INFO ] Decomposing Gal with order
[2023-03-16 10:03:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 10:03:13] [INFO ] Removed a total of 2399 redundant transitions.
[2023-03-16 10:03:13] [INFO ] Flatten gal took : 168 ms
[2023-03-16 10:03:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 54 ms.
[2023-03-16 10:03:13] [INFO ] Time to serialize gal into /tmp/LTL5383506225638457716.gal : 14 ms
[2023-03-16 10:03:13] [INFO ] Time to serialize properties into /tmp/LTL6969569354545112335.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5383506225638457716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6969569354545112335.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i20.i2.u58.Try_Check_Sources_B_1>=1)")||(G((F(G("((((((i20.i2.u11.DataOnSrc_3<1)||(i6.i1.u21.cSources<1))||((i6.i1.u142.CanI...6259
Formula 0 simplified : XG(!"(i20.i2.u58.Try_Check_Sources_B_1>=1)" & F(GF!"((((((i20.i2.u11.DataOnSrc_3<1)||(i6.i1.u21.cSources<1))||((i6.i1.u142.CanInject...6245
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5494522808424434146
[2023-03-16 10:03:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5494522808424434146
Running compilation step : cd /tmp/ltsmin5494522808424434146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5494522808424434146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5494522808424434146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-04 finished in 318392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1184 transition count 1515
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1099 transition count 1430
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1014 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1013 transition count 1429
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1013 transition count 1429
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 344 place count 1012 transition count 1428
Applied a total of 344 rules in 128 ms. Remains 1012 /1189 variables (removed 177) and now considering 1428/1600 (removed 172) transitions.
[2023-03-16 10:03:31] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2023-03-16 10:03:31] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-16 10:03:33] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
[2023-03-16 10:03:33] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 10:03:33] [INFO ] Invariant cache hit.
[2023-03-16 10:03:36] [INFO ] Implicit Places using invariants in 2360 ms returned []
[2023-03-16 10:03:36] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 10:03:36] [INFO ] Invariant cache hit.
[2023-03-16 10:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:04:06] [INFO ] Performed 787/1012 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:04:15] [INFO ] Implicit Places using invariants and state equation in 39086 ms returned []
Implicit Place search using SMT with State Equation took 41448 ms to find 0 implicit places.
[2023-03-16 10:04:15] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-16 10:04:15] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-16 10:04:15] [INFO ] Invariant cache hit.
[2023-03-16 10:04:17] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1189 places, 1428/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45575 ms. Remains : 1012/1189 places, 1428/1600 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s738 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 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-05 finished in 45630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(F(p1)&&G(F(p2)))))'
Support contains 171 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 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 4 rules applied. Total rules applied 4 place count 1184 transition count 1596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1180 transition count 1596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 1180 transition count 1593
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1177 transition count 1593
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1176 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1176 transition count 1592
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 20 place count 1174 transition count 1590
Applied a total of 20 rules in 135 ms. Remains 1174 /1189 variables (removed 15) and now considering 1590/1600 (removed 10) transitions.
[2023-03-16 10:04:17] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
// Phase 1: matrix 1586 rows 1174 cols
[2023-03-16 10:04:17] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-16 10:04:20] [INFO ] Dead Transitions using invariants and state equation in 2865 ms found 0 transitions.
[2023-03-16 10:04:20] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 10:04:20] [INFO ] Invariant cache hit.
[2023-03-16 10:04:22] [INFO ] Implicit Places using invariants in 2551 ms returned []
[2023-03-16 10:04:22] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 10:04:22] [INFO ] Invariant cache hit.
[2023-03-16 10:04:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:04:49] [INFO ] Implicit Places using invariants and state equation in 27184 ms returned []
Implicit Place search using SMT with State Equation took 29737 ms to find 0 implicit places.
[2023-03-16 10:04:50] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 10:04:50] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-16 10:04:50] [INFO ] Invariant cache hit.
[2023-03-16 10:04:52] [INFO ] Dead Transitions using invariants and state equation in 2863 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1174/1189 places, 1590/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35643 ms. Remains : 1174/1189 places, 1590/1600 transitions.
Stuttering acceptance computed with spot in 566 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s569 9) (LT s931 1) (LT s1041 1)) (OR (LT s569 9) (LT s640 1) (LT s1041 1)) (OR (LT s569 9) (LT s1041 1) (LT s1087 1)) (OR (LT s569 9) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-07 finished in 36239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1 U p2))))'
Support contains 6 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 77 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-16 10:04:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 10:04:53] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-16 10:04:57] [INFO ] Dead Transitions using invariants and state equation in 3578 ms found 0 transitions.
[2023-03-16 10:04:57] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:04:57] [INFO ] Invariant cache hit.
[2023-03-16 10:04:59] [INFO ] Implicit Places using invariants in 2632 ms returned []
[2023-03-16 10:04:59] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:04:59] [INFO ] Invariant cache hit.
[2023-03-16 10:05:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:05:30] [INFO ] Performed 700/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:05:54] [INFO ] Implicit Places using invariants and state equation in 54418 ms returned []
Implicit Place search using SMT with State Equation took 57052 ms to find 0 implicit places.
[2023-03-16 10:05:54] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:05:54] [INFO ] Invariant cache hit.
[2023-03-16 10:05:57] [INFO ] Dead Transitions using invariants and state equation in 3475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64207 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s636 1) (GEQ s885 1)), p1:(AND (GEQ s121 1) (GEQ s671 1) (GEQ s1095 1)), p0:(AND (GEQ s427 1) (GEQ s636 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 4 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-08 finished in 64384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (p2||G(p1)))))'
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1184 transition count 1518
Reduce places removed 82 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 85 rules applied. Total rules applied 167 place count 1102 transition count 1515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 170 place count 1099 transition count 1515
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 170 place count 1099 transition count 1432
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 336 place count 1016 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 340 place count 1014 transition count 1430
Applied a total of 340 rules in 116 ms. Remains 1014 /1189 variables (removed 175) and now considering 1430/1600 (removed 170) transitions.
[2023-03-16 10:05:57] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-16 10:05:58] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-16 10:05:59] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
[2023-03-16 10:05:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:05:59] [INFO ] Invariant cache hit.
[2023-03-16 10:06:02] [INFO ] Implicit Places using invariants in 2365 ms returned []
[2023-03-16 10:06:02] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:06:02] [INFO ] Invariant cache hit.
[2023-03-16 10:06:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:06:33] [INFO ] Performed 710/1014 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:06:44] [INFO ] Implicit Places using invariants and state equation in 42524 ms returned []
Implicit Place search using SMT with State Equation took 44896 ms to find 0 implicit places.
[2023-03-16 10:06:44] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 10:06:44] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:06:44] [INFO ] Invariant cache hit.
[2023-03-16 10:06:46] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1189 places, 1430/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48895 ms. Remains : 1014/1189 places, 1430/1600 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (LT s385 1) (LT s986 1)), p1:(LT s986 1), p0:(AND (GEQ s494 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-11 finished in 49049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 72 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-16 10:06:46] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 10:06:47] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-16 10:06:50] [INFO ] Dead Transitions using invariants and state equation in 3562 ms found 0 transitions.
[2023-03-16 10:06:50] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:06:50] [INFO ] Invariant cache hit.
[2023-03-16 10:06:53] [INFO ] Implicit Places using invariants in 2618 ms returned []
[2023-03-16 10:06:53] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:06:53] [INFO ] Invariant cache hit.
[2023-03-16 10:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:07:23] [INFO ] Performed 467/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:07:54] [INFO ] Performed 1012/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 10:08:03] [INFO ] Implicit Places using invariants and state equation in 70375 ms returned []
Implicit Place search using SMT with State Equation took 72996 ms to find 0 implicit places.
[2023-03-16 10:08:03] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:08:03] [INFO ] Invariant cache hit.
[2023-03-16 10:08:07] [INFO ] Dead Transitions using invariants and state equation in 3535 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80168 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s62 1) (GEQ s671 1) (GEQ s1095 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-13 finished in 80272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1184 transition count 1514
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 172 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 342 place count 1013 transition count 1429
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 1011 transition count 1427
Applied a total of 346 rules in 125 ms. Remains 1011 /1189 variables (removed 178) and now considering 1427/1600 (removed 173) transitions.
[2023-03-16 10:08:07] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 10:08:07] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-16 10:08:09] [INFO ] Dead Transitions using invariants and state equation in 1988 ms found 0 transitions.
[2023-03-16 10:08:09] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 10:08:09] [INFO ] Invariant cache hit.
[2023-03-16 10:08:11] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2023-03-16 10:08:11] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 10:08:11] [INFO ] Invariant cache hit.
[2023-03-16 10:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:08:42] [INFO ] Performed 675/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:08:53] [INFO ] Implicit Places using invariants and state equation in 42123 ms returned []
Implicit Place search using SMT with State Equation took 44604 ms to find 0 implicit places.
[2023-03-16 10:08:53] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-16 10:08:53] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 10:08:53] [INFO ] Invariant cache hit.
[2023-03-16 10:08:55] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1011/1189 places, 1427/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48673 ms. Remains : 1011/1189 places, 1427/1600 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-14 finished in 48762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1184 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1183 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1183 transition count 1599
Applied a total of 7 rules in 76 ms. Remains 1183 /1189 variables (removed 6) and now considering 1599/1600 (removed 1) transitions.
[2023-03-16 10:08:56] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-16 10:08:56] [INFO ] Computed 177 place invariants in 37 ms
[2023-03-16 10:08:59] [INFO ] Dead Transitions using invariants and state equation in 3524 ms found 0 transitions.
[2023-03-16 10:08:59] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:08:59] [INFO ] Invariant cache hit.
[2023-03-16 10:09:02] [INFO ] Implicit Places using invariants in 2656 ms returned []
[2023-03-16 10:09:02] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:09:02] [INFO ] Invariant cache hit.
[2023-03-16 10:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:09:32] [INFO ] Performed 436/1183 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-16 10:10:02] [INFO ] Performed 998/1183 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-16 10:10:16] [INFO ] Implicit Places using invariants and state equation in 74265 ms returned []
Implicit Place search using SMT with State Equation took 76923 ms to find 0 implicit places.
[2023-03-16 10:10:16] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-16 10:10:16] [INFO ] Invariant cache hit.
[2023-03-16 10:10:19] [INFO ] Dead Transitions using invariants and state equation in 3463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1189 places, 1599/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83988 ms. Remains : 1183/1189 places, 1599/1600 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s368 1), p1:(GEQ s967 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-15 finished in 84118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-PT-S05J80-LTLFireability-04
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1189/1189 places, 1600/1600 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1189 transition count 1517
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 1106 transition count 1517
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 166 place count 1106 transition count 1432
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 336 place count 1021 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1020 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1020 transition count 1431
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 340 place count 1019 transition count 1430
Applied a total of 340 rules in 121 ms. Remains 1019 /1189 variables (removed 170) and now considering 1430/1600 (removed 170) transitions.
[2023-03-16 10:10:20] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1019 cols
[2023-03-16 10:10:20] [INFO ] Computed 182 place invariants in 33 ms
[2023-03-16 10:10:22] [INFO ] Dead Transitions using invariants and state equation in 1988 ms found 0 transitions.
[2023-03-16 10:10:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:10:22] [INFO ] Invariant cache hit.
[2023-03-16 10:10:24] [INFO ] Implicit Places using invariants in 2330 ms returned []
[2023-03-16 10:10:24] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:10:24] [INFO ] Invariant cache hit.
[2023-03-16 10:10:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:11:54] [INFO ] Performed 32/1019 implicitness test of which 0 returned IMPLICIT in 88 seconds.
[2023-03-16 10:12:24] [INFO ] Performed 946/1019 implicitness test of which 0 returned IMPLICIT in 118 seconds.
[2023-03-16 10:12:25] [INFO ] Implicit Places using invariants and state equation in 120566 ms returned []
Implicit Place search using SMT with State Equation took 122897 ms to find 0 implicit places.
[2023-03-16 10:12:25] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:12:25] [INFO ] Invariant cache hit.
[2023-03-16 10:12:27] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1019/1189 places, 1430/1600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 126944 ms. Remains : 1019/1189 places, 1430/1600 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s345 1), p1:(AND (OR (LT s313 1) (LT s491 1) (LT s721 1) (LT s916 1)) (OR (LT s491 1) (LT s573 1) (LT s721 1) (LT s889 1)) (OR (LT s442 1) (LT s49...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14782 reset in 709 ms.
Product exploration explored 100000 steps with 14810 reset in 788 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 1060 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 339 steps, including 25 resets, run visited all 4 properties in 5 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 342 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 10:12:30] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:12:30] [INFO ] Invariant cache hit.
[2023-03-16 10:12:31] [INFO ] [Real]Absence check using 156 positive place invariants in 105 ms returned sat
[2023-03-16 10:12:32] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 165 ms returned sat
[2023-03-16 10:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:12:34] [INFO ] [Real]Absence check using state equation in 2683 ms returned sat
[2023-03-16 10:12:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:12:36] [INFO ] [Nat]Absence check using 156 positive place invariants in 127 ms returned sat
[2023-03-16 10:12:36] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 310 ms returned sat
[2023-03-16 10:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:12:48] [INFO ] [Nat]Absence check using state equation in 11911 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 19 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 10:12:48] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:12:48] [INFO ] Invariant cache hit.
[2023-03-16 10:12:50] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
[2023-03-16 10:12:50] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:12:50] [INFO ] Invariant cache hit.
[2023-03-16 10:12:52] [INFO ] Implicit Places using invariants in 2302 ms returned []
[2023-03-16 10:12:52] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:12:52] [INFO ] Invariant cache hit.
[2023-03-16 10:12:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:13:22] [INFO ] Implicit Places using invariants and state equation in 30114 ms returned []
Implicit Place search using SMT with State Equation took 32418 ms to find 0 implicit places.
[2023-03-16 10:13:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:22] [INFO ] Invariant cache hit.
[2023-03-16 10:13:24] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36368 ms. Remains : 1019/1019 places, 1430/1430 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) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 467 steps, including 32 resets, run visited all 4 properties in 8 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 409 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-16 10:13:25] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:25] [INFO ] Invariant cache hit.
[2023-03-16 10:13:27] [INFO ] [Real]Absence check using 156 positive place invariants in 116 ms returned sat
[2023-03-16 10:13:27] [INFO ] [Real]Absence check using 156 positive and 26 generalized place invariants in 169 ms returned sat
[2023-03-16 10:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 10:13:29] [INFO ] [Real]Absence check using state equation in 2672 ms returned sat
[2023-03-16 10:13:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 10:13:31] [INFO ] [Nat]Absence check using 156 positive place invariants in 136 ms returned sat
[2023-03-16 10:13:31] [INFO ] [Nat]Absence check using 156 positive and 26 generalized place invariants in 309 ms returned sat
[2023-03-16 10:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 10:13:43] [INFO ] [Nat]Absence check using state equation in 12077 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14815 reset in 699 ms.
Product exploration explored 100000 steps with 14807 reset in 728 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 41 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 10:13:45] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:45] [INFO ] Invariant cache hit.
[2023-03-16 10:13:47] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
[2023-03-16 10:13:47] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-16 10:13:47] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:47] [INFO ] Invariant cache hit.
[2023-03-16 10:13:49] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3928 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin7859907295681406423
[2023-03-16 10:13:49] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7859907295681406423
Running compilation step : cd /tmp/ltsmin7859907295681406423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7859907295681406423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7859907295681406423;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 23 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-16 10:13:52] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:52] [INFO ] Invariant cache hit.
[2023-03-16 10:13:54] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
[2023-03-16 10:13:54] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:54] [INFO ] Invariant cache hit.
[2023-03-16 10:13:56] [INFO ] Implicit Places using invariants in 2368 ms returned []
[2023-03-16 10:13:56] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:13:56] [INFO ] Invariant cache hit.
[2023-03-16 10:13:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 10:15:36] [INFO ] Performed 39/1019 implicitness test of which 0 returned IMPLICIT in 99 seconds.
[2023-03-16 10:15:59] [INFO ] Implicit Places using invariants and state equation in 122874 ms returned []
Implicit Place search using SMT with State Equation took 125244 ms to find 0 implicit places.
[2023-03-16 10:15:59] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-16 10:15:59] [INFO ] Invariant cache hit.
[2023-03-16 10:16:01] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129174 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Built C files in :
/tmp/ltsmin11850466565118348014
[2023-03-16 10:16:01] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11850466565118348014
Running compilation step : cd /tmp/ltsmin11850466565118348014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2954 ms.
Running link step : cd /tmp/ltsmin11850466565118348014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11850466565118348014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2069729509288695564.hoa' '--buchi-type=spotba'
LTSmin run took 709 ms.
Treatment of property PolyORBNT-PT-S05J80-LTLFireability-04 finished in 345305 ms.
FORMULA PolyORBNT-PT-S05J80-LTLFireability-04 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-16 10:16:05] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12511534616561317787
[2023-03-16 10:16:05] [INFO ] Too many transitions (1600) to apply POR reductions. Disabling POR matrices.
[2023-03-16 10:16:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12511534616561317787
Running compilation step : cd /tmp/ltsmin12511534616561317787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 10:16:05] [INFO ] Applying decomposition
[2023-03-16 10:16:05] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6455553023427848740.txt' '-o' '/tmp/graph6455553023427848740.bin' '-w' '/tmp/graph6455553023427848740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6455553023427848740.bin' '-l' '-1' '-v' '-w' '/tmp/graph6455553023427848740.weights' '-q' '0' '-e' '0.001'
[2023-03-16 10:16:05] [INFO ] Decomposing Gal with order
[2023-03-16 10:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 10:16:06] [INFO ] Removed a total of 2399 redundant transitions.
[2023-03-16 10:16:06] [INFO ] Flatten gal took : 129 ms
[2023-03-16 10:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 31 ms.
[2023-03-16 10:16:06] [INFO ] Time to serialize gal into /tmp/LTLFireability15394243551670262737.gal : 21 ms
[2023-03-16 10:16:06] [INFO ] Time to serialize properties into /tmp/LTLFireability96138268964341403.ltl : 267 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15394243551670262737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability96138268964341403.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i43.i3.u128.Schedule_Task_B_1<1)&&(((i22.u56.cSources<9)||(i22.u56.ModifiedSrc_4<1))||(i22.u56.place_500_1<1)))&&((((i22.u...467
Formula 0 simplified : GF!"((((i43.i3.u128.Schedule_Task_B_1<1)&&(((i22.u56.cSources<9)||(i22.u56.ModifiedSrc_4<1))||(i22.u56.place_500_1<1)))&&((((i22.u56...461
Compilation finished in 3630 ms.
Running link step : cd /tmp/ltsmin12511534616561317787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12511534616561317787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 10:45:27] [INFO ] Flatten gal took : 1613 ms
[2023-03-16 10:45:27] [INFO ] Time to serialize gal into /tmp/LTLFireability5031294008954898202.gal : 38 ms
[2023-03-16 10:45:27] [INFO ] Time to serialize properties into /tmp/LTLFireability9044546932567311403.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5031294008954898202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9044546932567311403.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((((Schedule_Task_B_1<1)&&(((cSources<9)||(ModifiedSrc_4<1))||(place_500_1<1)))&&((((cSources<9)||(ModifiedSrc_2<1))||(place_5...335
Formula 0 simplified : GF!"((((Schedule_Task_B_1<1)&&(((cSources<9)||(ModifiedSrc_4<1))||(place_500_1<1)))&&((((cSources<9)||(ModifiedSrc_2<1))||(place_500...329
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12088024 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15631344 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J80, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945800748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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