java -Xmx20000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc03-18.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 22:32:14,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 22:32:14,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 22:32:14,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 22:32:14,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 22:32:14,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 22:32:14,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 22:32:14,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 22:32:14,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 22:32:14,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 22:32:14,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 22:32:14,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 22:32:14,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 22:32:14,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 22:32:14,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 22:32:14,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 22:32:14,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 22:32:14,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 22:32:14,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 22:32:14,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 22:32:14,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 22:32:14,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 22:32:14,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 22:32:14,798 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 22:32:14,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 22:32:14,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 22:32:14,800 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 22:32:14,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 22:32:14,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 22:32:14,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 22:32:14,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 22:32:14,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 22:32:14,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 22:32:14,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 22:32:14,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 22:32:14,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 22:32:14,806 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 22:32:14,816 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 22:32:14,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 22:32:14,817 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 22:32:14,817 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 22:32:14,817 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 22:32:14,817 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 22:32:14,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 22:32:14,818 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 22:32:14,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 22:32:14,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 22:32:14,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 22:32:14,819 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 22:32:14,819 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 22:32:14,820 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 22:32:14,820 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 22:32:14,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 22:32:14,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 22:32:14,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 22:32:14,879 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 22:32:14,879 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 22:32:14,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-18.bpl [2018-10-14 22:32:14,880 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-18.bpl' [2018-10-14 22:32:14,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 22:32:14,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 22:32:14,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 22:32:14,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 22:32:14,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 22:32:14,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:14,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:14,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:14,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:14,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:15,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:15,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... [2018-10-14 22:32:15,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 22:32:15,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 22:32:15,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 22:32:15,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 22:32:15,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 22:32:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 22:32:15,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 22:32:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-14 22:32:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-14 22:32:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-14 22:32:15,711 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 22:32:15,712 INFO L202 PluginConnector]: Adding new model speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:32:15 BoogieIcfgContainer [2018-10-14 22:32:15,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 22:32:15,713 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 22:32:15,713 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 22:32:15,714 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 22:32:15,718 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:32:15" (1/1) ... [2018-10-14 22:32:15,724 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 22:32:15,725 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 22:32:15,775 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 22:32:15,837 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 22:32:15,876 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 22:32:15,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 22:38:23,896 INFO L315 AbstractInterpreter]: Visited 96 different actions 1123 times. Merged at 58 different actions 704 times. Never widened. Found 341 fixpoints after 19 different actions. Largest state had 61 variables. [2018-10-14 22:38:23,904 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 22:38:23,914 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 22:38:24,506 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 22:38:24,506 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-14 22:38:24,507 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 22:38:24,507 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 36 [2018-10-14 22:38:24,507 INFO L248 HeapPartitionManager]: # location blocks :18 [2018-10-14 22:38:24,508 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 22:38:24,602 INFO L202 PluginConnector]: Adding new model speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:38:24 BasicIcfg [2018-10-14 22:38:24,603 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 22:38:24,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 22:38:24,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 22:38:24,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 22:38:24,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 10:32:14" (1/3) ... [2018-10-14 22:38:24,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645fe33 and model type speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:38:24, skipping insertion in model container [2018-10-14 22:38:24,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:32:15" (2/3) ... [2018-10-14 22:38:24,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645fe33 and model type speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:38:24, skipping insertion in model container [2018-10-14 22:38:24,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 10:38:24" (3/3) ... [2018-10-14 22:38:24,614 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 22:38:24,625 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 22:38:24,632 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-10-14 22:38:24,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-10-14 22:38:24,672 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 22:38:24,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 22:38:24,673 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 22:38:24,673 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 22:38:24,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 22:38:24,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 22:38:24,673 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 22:38:24,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 22:38:24,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 22:38:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-10-14 22:38:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-14 22:38:24,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:24,694 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:24,696 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:24,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1688143946, now seen corresponding path program 1 times [2018-10-14 22:38:24,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:25,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:25,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,113 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2018-10-14 22:38:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:25,235 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2018-10-14 22:38:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:25,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-14 22:38:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:25,257 INFO L225 Difference]: With dead ends: 116 [2018-10-14 22:38:25,257 INFO L226 Difference]: Without dead ends: 110 [2018-10-14 22:38:25,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-14 22:38:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-10-14 22:38:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:25,313 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 38 [2018-10-14 22:38:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:25,313 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:25,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-14 22:38:25,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:25,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:25,316 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:25,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -792854341, now seen corresponding path program 1 times [2018-10-14 22:38:25,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:25,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:25,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:25,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,453 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:25,537 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:25,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-14 22:38:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:25,541 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:25,542 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:25,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2018-10-14 22:38:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-14 22:38:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 153 transitions. [2018-10-14 22:38:25,560 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 153 transitions. Word has length 39 [2018-10-14 22:38:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:25,561 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 153 transitions. [2018-10-14 22:38:25,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 153 transitions. [2018-10-14 22:38:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-14 22:38:25,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:25,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:25,563 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:25,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1191317107, now seen corresponding path program 1 times [2018-10-14 22:38:25,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:25,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:25,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:25,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:25,674 INFO L87 Difference]: Start difference. First operand 81 states and 153 transitions. Second operand 4 states. [2018-10-14 22:38:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:25,754 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:25,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-10-14 22:38:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:25,756 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:25,756 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:25,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:25,765 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 40 [2018-10-14 22:38:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:25,766 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:25,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-14 22:38:25,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:25,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:25,768 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:25,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1191319640, now seen corresponding path program 1 times [2018-10-14 22:38:25,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:25,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:25,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:25,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:25,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,888 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:25,910 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-14 22:38:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:25,916 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:25,916 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:25,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-10-14 22:38:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-14 22:38:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 155 transitions. [2018-10-14 22:38:25,933 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 155 transitions. Word has length 40 [2018-10-14 22:38:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:25,934 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 155 transitions. [2018-10-14 22:38:25,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 155 transitions. [2018-10-14 22:38:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 22:38:25,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:25,935 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:25,936 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:25,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1723873953, now seen corresponding path program 1 times [2018-10-14 22:38:25,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:26,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:26,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:26,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,031 INFO L87 Difference]: Start difference. First operand 83 states and 155 transitions. Second operand 4 states. [2018-10-14 22:38:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:26,082 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:26,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-14 22:38:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:26,084 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:26,084 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:26,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:26,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 41 [2018-10-14 22:38:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:26,092 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:26,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 22:38:26,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:26,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:26,094 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:26,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1723796387, now seen corresponding path program 1 times [2018-10-14 22:38:26,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:26,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:26,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:26,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:26,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:26,197 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:26,214 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:26,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-14 22:38:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:26,216 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:26,216 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:26,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2018-10-14 22:38:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-14 22:38:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 157 transitions. [2018-10-14 22:38:26,223 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 157 transitions. Word has length 41 [2018-10-14 22:38:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:26,223 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 157 transitions. [2018-10-14 22:38:26,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 157 transitions. [2018-10-14 22:38:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 22:38:26,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:26,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:26,225 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:26,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1900454765, now seen corresponding path program 1 times [2018-10-14 22:38:26,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:26,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:26,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,345 INFO L87 Difference]: Start difference. First operand 85 states and 157 transitions. Second operand 4 states. [2018-10-14 22:38:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:26,370 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:26,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:26,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-10-14 22:38:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:26,373 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:26,373 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:26,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:26,378 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 42 [2018-10-14 22:38:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:26,379 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:26,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 22:38:26,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:26,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:26,381 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:26,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1898080006, now seen corresponding path program 1 times [2018-10-14 22:38:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:26,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:26,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:26,467 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:26,546 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:26,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:26,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-14 22:38:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:26,548 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:26,548 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:26,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-10-14 22:38:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 22:38:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2018-10-14 22:38:26,562 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 42 [2018-10-14 22:38:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:26,567 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2018-10-14 22:38:26,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2018-10-14 22:38:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-14 22:38:26,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:26,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:26,569 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:26,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1216368387, now seen corresponding path program 1 times [2018-10-14 22:38:26,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:26,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:26,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:26,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,767 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 4 states. [2018-10-14 22:38:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:26,919 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:26,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-14 22:38:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:26,921 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:26,923 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:26,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:26,929 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 43 [2018-10-14 22:38:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:26,929 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:26,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-14 22:38:26,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:26,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:26,932 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:26,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1289062399, now seen corresponding path program 1 times [2018-10-14 22:38:26,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:27,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,049 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,084 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:27,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-14 22:38:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,085 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:27,085 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:27,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2018-10-14 22:38:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-14 22:38:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 161 transitions. [2018-10-14 22:38:27,092 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 161 transitions. Word has length 43 [2018-10-14 22:38:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,093 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 161 transitions. [2018-10-14 22:38:27,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 161 transitions. [2018-10-14 22:38:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 22:38:27,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,098 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,099 INFO L82 PathProgramCache]: Analyzing trace with hash -918656077, now seen corresponding path program 1 times [2018-10-14 22:38:27,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:27,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,222 INFO L87 Difference]: Start difference. First operand 89 states and 161 transitions. Second operand 4 states. [2018-10-14 22:38:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,342 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:27,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-14 22:38:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,344 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:27,344 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:27,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:27,347 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 44 [2018-10-14 22:38:27,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,348 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:27,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 22:38:27,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,349 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1306229148, now seen corresponding path program 1 times [2018-10-14 22:38:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:27,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:27,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,422 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,490 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:27,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-14 22:38:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,492 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:27,492 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:27,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2018-10-14 22:38:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 22:38:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-10-14 22:38:27,495 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 44 [2018-10-14 22:38:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,496 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-10-14 22:38:27,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-10-14 22:38:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 22:38:27,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,497 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,498 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1821030489, now seen corresponding path program 1 times [2018-10-14 22:38:27,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:27,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:27,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,617 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 4 states. [2018-10-14 22:38:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,639 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:27,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-14 22:38:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,641 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:27,641 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:27,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:27,645 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 45 [2018-10-14 22:38:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,645 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:27,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-14 22:38:27,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,647 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1838398369, now seen corresponding path program 1 times [2018-10-14 22:38:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:27,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:27,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:27,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:27,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,706 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,741 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:27,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:27,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-14 22:38:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,742 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:27,742 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:27,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2018-10-14 22:38:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-14 22:38:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2018-10-14 22:38:27,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 45 [2018-10-14 22:38:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,746 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2018-10-14 22:38:27,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2018-10-14 22:38:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-14 22:38:27,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,748 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1125440467, now seen corresponding path program 1 times [2018-10-14 22:38:27,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:27,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:27,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,877 INFO L87 Difference]: Start difference. First operand 93 states and 165 transitions. Second operand 4 states. [2018-10-14 22:38:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:27,903 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:27,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-14 22:38:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:27,905 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:27,905 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:27,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:27,911 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 46 [2018-10-14 22:38:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:27,912 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:27,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-14 22:38:27,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:27,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:27,913 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:27,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1155775038, now seen corresponding path program 1 times [2018-10-14 22:38:27,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:27,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:27,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:27,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:27,984 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,018 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:28,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-14 22:38:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,019 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:28,020 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:28,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-10-14 22:38:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-14 22:38:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 167 transitions. [2018-10-14 22:38:28,025 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 167 transitions. Word has length 46 [2018-10-14 22:38:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,025 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 167 transitions. [2018-10-14 22:38:28,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 167 transitions. [2018-10-14 22:38:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-14 22:38:28,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,034 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1278537909, now seen corresponding path program 1 times [2018-10-14 22:38:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:28,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,189 INFO L87 Difference]: Start difference. First operand 95 states and 167 transitions. Second operand 4 states. [2018-10-14 22:38:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,259 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:28,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-14 22:38:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,263 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:28,263 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:28,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:28,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 47 [2018-10-14 22:38:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,269 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:28,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-14 22:38:28,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,271 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1469288259, now seen corresponding path program 1 times [2018-10-14 22:38:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:28,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:28,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:28,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:28,366 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,437 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:28,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-14 22:38:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,438 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:28,438 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:28,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-10-14 22:38:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 22:38:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 169 transitions. [2018-10-14 22:38:28,442 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 169 transitions. Word has length 47 [2018-10-14 22:38:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,442 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 169 transitions. [2018-10-14 22:38:28,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 169 transitions. [2018-10-14 22:38:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-14 22:38:28,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,443 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1176482573, now seen corresponding path program 1 times [2018-10-14 22:38:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:28,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:28,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:28,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:28,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:28,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,602 INFO L87 Difference]: Start difference. First operand 97 states and 169 transitions. Second operand 4 states. [2018-10-14 22:38:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,635 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:28,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:28,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-14 22:38:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,637 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:28,637 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:28,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:28,641 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 48 [2018-10-14 22:38:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,642 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:28,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-14 22:38:28,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,643 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1696703776, now seen corresponding path program 1 times [2018-10-14 22:38:28,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:28,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:28,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:28,720 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,784 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:28,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:28,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-10-14 22:38:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,788 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:28,788 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:28,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-10-14 22:38:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-14 22:38:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-10-14 22:38:28,792 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 48 [2018-10-14 22:38:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,793 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-10-14 22:38:28,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-10-14 22:38:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-14 22:38:28,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,794 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 386794991, now seen corresponding path program 1 times [2018-10-14 22:38:28,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:28,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:28,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:28,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:28,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:28,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,860 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 4 states. [2018-10-14 22:38:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:28,939 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:28,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-14 22:38:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:28,940 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:28,940 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:28,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:28,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 49 [2018-10-14 22:38:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:28,944 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:28,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-14 22:38:28,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:28,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:28,945 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:28,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1058209051, now seen corresponding path program 1 times [2018-10-14 22:38:28,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:29,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:29,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,018 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:29,087 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:29,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:29,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-10-14 22:38:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:29,089 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:29,089 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:29,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-10-14 22:38:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-14 22:38:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 173 transitions. [2018-10-14 22:38:29,092 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 173 transitions. Word has length 49 [2018-10-14 22:38:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:29,093 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 173 transitions. [2018-10-14 22:38:29,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 173 transitions. [2018-10-14 22:38:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 22:38:29,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:29,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:29,094 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:29,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -765173997, now seen corresponding path program 1 times [2018-10-14 22:38:29,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:29,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:29,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:29,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:29,247 INFO L87 Difference]: Start difference. First operand 101 states and 173 transitions. Second operand 4 states. [2018-10-14 22:38:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:29,393 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:29,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-14 22:38:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:29,395 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:29,395 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:29,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:29,398 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 50 [2018-10-14 22:38:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:29,399 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:29,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 22:38:29,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:29,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:29,400 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:29,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1555258242, now seen corresponding path program 1 times [2018-10-14 22:38:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:29,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:29,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:29,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,483 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:29,560 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:29,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-14 22:38:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:29,561 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:29,561 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:29,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-10-14 22:38:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 22:38:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 175 transitions. [2018-10-14 22:38:29,564 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 175 transitions. Word has length 50 [2018-10-14 22:38:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:29,565 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 175 transitions. [2018-10-14 22:38:29,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 175 transitions. [2018-10-14 22:38:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-14 22:38:29,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:29,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:29,566 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:29,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1756007315, now seen corresponding path program 1 times [2018-10-14 22:38:29,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:29,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:29,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:29,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:29,679 INFO L87 Difference]: Start difference. First operand 103 states and 175 transitions. Second operand 4 states. [2018-10-14 22:38:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:29,751 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:29,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-14 22:38:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:29,752 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:29,753 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:29,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:29,755 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 51 [2018-10-14 22:38:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:29,756 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:29,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-14 22:38:29,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:29,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:29,757 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:29,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash 968365703, now seen corresponding path program 1 times [2018-10-14 22:38:29,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:29,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:29,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:29,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,830 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:29,902 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:29,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-14 22:38:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:29,904 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:29,904 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:29,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-10-14 22:38:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-14 22:38:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 177 transitions. [2018-10-14 22:38:29,908 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 177 transitions. Word has length 51 [2018-10-14 22:38:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:29,908 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 177 transitions. [2018-10-14 22:38:29,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 177 transitions. [2018-10-14 22:38:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-14 22:38:29,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:29,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:29,909 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:29,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1903906253, now seen corresponding path program 1 times [2018-10-14 22:38:29,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:30,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,016 INFO L87 Difference]: Start difference. First operand 105 states and 177 transitions. Second operand 4 states. [2018-10-14 22:38:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,102 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:30,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-14 22:38:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,104 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:30,104 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:30,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:30,107 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 52 [2018-10-14 22:38:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,107 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:30,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-14 22:38:30,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,109 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -45433820, now seen corresponding path program 1 times [2018-10-14 22:38:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:30,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:30,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:30,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:30,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,188 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,266 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:30,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-14 22:38:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,268 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:30,268 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:30,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2018-10-14 22:38:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-14 22:38:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 179 transitions. [2018-10-14 22:38:30,271 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 179 transitions. Word has length 52 [2018-10-14 22:38:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,272 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 179 transitions. [2018-10-14 22:38:30,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 179 transitions. [2018-10-14 22:38:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 22:38:30,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,273 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1678966729, now seen corresponding path program 1 times [2018-10-14 22:38:30,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:30,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:30,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:30,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,407 INFO L87 Difference]: Start difference. First operand 107 states and 179 transitions. Second operand 4 states. [2018-10-14 22:38:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,431 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:30,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-10-14 22:38:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,432 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:30,432 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:30,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:30,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 53 [2018-10-14 22:38:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,436 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:30,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 22:38:30,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,437 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1408447959, now seen corresponding path program 1 times [2018-10-14 22:38:30,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:30,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,495 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,513 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:30,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:30,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-14 22:38:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,514 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:30,514 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:30,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2018-10-14 22:38:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 22:38:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 181 transitions. [2018-10-14 22:38:30,518 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 181 transitions. Word has length 53 [2018-10-14 22:38:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,519 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 181 transitions. [2018-10-14 22:38:30,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 181 transitions. [2018-10-14 22:38:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-14 22:38:30,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,520 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1018894765, now seen corresponding path program 1 times [2018-10-14 22:38:30,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:30,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,631 INFO L87 Difference]: Start difference. First operand 109 states and 181 transitions. Second operand 4 states. [2018-10-14 22:38:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,739 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:30,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:30,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-10-14 22:38:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,741 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:30,741 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:30,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:30,745 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 54 [2018-10-14 22:38:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,746 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:30,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-14 22:38:30,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,749 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash -712213306, now seen corresponding path program 1 times [2018-10-14 22:38:30,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:30,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,828 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:30,907 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:30,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-14 22:38:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:30,908 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:30,908 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 22:38:30,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 22:38:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-14 22:38:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-14 22:38:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 183 transitions. [2018-10-14 22:38:30,912 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 183 transitions. Word has length 54 [2018-10-14 22:38:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:30,912 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 183 transitions. [2018-10-14 22:38:30,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 183 transitions. [2018-10-14 22:38:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-14 22:38:30,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:30,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:30,913 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:30,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash -167656485, now seen corresponding path program 1 times [2018-10-14 22:38:30,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:31,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:31,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:31,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:31,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,050 INFO L87 Difference]: Start difference. First operand 111 states and 183 transitions. Second operand 4 states. [2018-10-14 22:38:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:31,196 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2018-10-14 22:38:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:31,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-10-14 22:38:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:31,197 INFO L225 Difference]: With dead ends: 115 [2018-10-14 22:38:31,197 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 22:38:31,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 22:38:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2018-10-14 22:38:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-14 22:38:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2018-10-14 22:38:31,200 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 55 [2018-10-14 22:38:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:31,201 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2018-10-14 22:38:31,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2018-10-14 22:38:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-14 22:38:31,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:31,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:31,202 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:31,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -603775541, now seen corresponding path program 1 times [2018-10-14 22:38:31,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 22:38:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-14 22:38:31,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 22:38:31,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 22:38:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:31,265 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2018-10-14 22:38:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:31,314 INFO L93 Difference]: Finished difference Result 114 states and 184 transitions. [2018-10-14 22:38:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 22:38:31,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-10-14 22:38:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:31,315 INFO L225 Difference]: With dead ends: 114 [2018-10-14 22:38:31,315 INFO L226 Difference]: Without dead ends: 97 [2018-10-14 22:38:31,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 22:38:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-14 22:38:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-14 22:38:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-14 22:38:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 166 transitions. [2018-10-14 22:38:31,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 166 transitions. Word has length 55 [2018-10-14 22:38:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:31,318 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 166 transitions. [2018-10-14 22:38:31,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 22:38:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 166 transitions. [2018-10-14 22:38:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-14 22:38:31,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:31,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:31,320 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:31,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1899455629, now seen corresponding path program 1 times [2018-10-14 22:38:31,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:31,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:31,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:31,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,475 INFO L87 Difference]: Start difference. First operand 96 states and 166 transitions. Second operand 4 states. [2018-10-14 22:38:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:31,618 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2018-10-14 22:38:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:31,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-10-14 22:38:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:31,620 INFO L225 Difference]: With dead ends: 97 [2018-10-14 22:38:31,620 INFO L226 Difference]: Without dead ends: 81 [2018-10-14 22:38:31,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-14 22:38:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2018-10-14 22:38:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-14 22:38:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 93 transitions. [2018-10-14 22:38:31,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 93 transitions. Word has length 56 [2018-10-14 22:38:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:31,622 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 93 transitions. [2018-10-14 22:38:31,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 93 transitions. [2018-10-14 22:38:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-14 22:38:31,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 22:38:31,623 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 22:38:31,623 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT]=== [2018-10-14 22:38:31,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 22:38:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 401946239, now seen corresponding path program 1 times [2018-10-14 22:38:31,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 22:38:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 22:38:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 22:38:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 22:38:31,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-14 22:38:31,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 22:38:31,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 22:38:31,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,774 INFO L87 Difference]: Start difference. First operand 59 states and 93 transitions. Second operand 4 states. [2018-10-14 22:38:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 22:38:31,870 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2018-10-14 22:38:31,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 22:38:31,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-10-14 22:38:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 22:38:31,871 INFO L225 Difference]: With dead ends: 58 [2018-10-14 22:38:31,871 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 22:38:31,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-14 22:38:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 22:38:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 22:38:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 22:38:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 22:38:31,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-10-14 22:38:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 22:38:31,873 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 22:38:31,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 22:38:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 22:38:31,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 22:38:31,877 INFO L202 PluginConnector]: Adding new model speedup-poc03-18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:38:31 BasicIcfg [2018-10-14 22:38:31,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 22:38:31,878 INFO L168 Benchmark]: Toolchain (without parser) took 376935.33 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 842.0 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -430.4 MB). Peak memory consumption was 411.6 MB. Max. memory is 17.8 GB. [2018-10-14 22:38:31,879 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:38:31,879 INFO L168 Benchmark]: Boogie Preprocessor took 68.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-14 22:38:31,880 INFO L168 Benchmark]: RCFGBuilder took 699.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 17.8 GB. [2018-10-14 22:38:31,881 INFO L168 Benchmark]: IcfgTransformer took 368890.04 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 354.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -271.5 MB). Peak memory consumption was 82.9 MB. Max. memory is 17.8 GB. [2018-10-14 22:38:31,881 INFO L168 Benchmark]: TraceAbstraction took 7273.04 ms. Allocated memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: 487.6 MB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -190.6 MB). Peak memory consumption was 297.0 MB. Max. memory is 17.8 GB. [2018-10-14 22:38:31,885 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * Boogie Preprocessor took 68.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 699.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 17.8 GB. * IcfgTransformer took 368890.04 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 354.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -271.5 MB). Peak memory consumption was 82.9 MB. Max. memory is 17.8 GB. * TraceAbstraction took 7273.04 ms. Allocated memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: 487.6 MB). Free memory was 1.7 GB in the beginning and 1.9 GB in the end (delta: -190.6 MB). Peak memory consumption was 297.0 MB. Max. memory is 17.8 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 78 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1610 LocStat_NO_SUPPORTING_DISEQUALITIES : 40222 LocStat_NO_DISJUNCTIONS : -156 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 98 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 131 TransStat_NO_SUPPORTING_DISEQUALITIES : 18 TransStat_NO_DISJUNCTIONS : 98 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 360098.14 APPLY_RETURN(MILLISECONDS) : 398.74 #APPLY_NORMAL : 1103 #APPLY_RETURN : 20 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 96 different actions 1123 times. Merged at 58 different actions 704 times. Never widened. Found 341 fixpoints after 19 different actions. Largest state had 61 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 18 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : null COUNT_ARRAY_READS for [#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 98]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 103]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 97]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 111]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 108]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 112]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 99]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 109]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 114]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 102]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 110]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 113]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 100]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 106]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 107]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 101]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 104]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 105]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 18 error locations. SAFE Result, 7.2s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3652 SDtfs, 2027 SDslu, 3885 SDs, 0 SdLazy, 301 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 969 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1710 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1674 ConstructedInterpolants, 0 QuantifiedInterpolants, 215334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-18.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_22-38-31-900.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-18.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_22-38-31-900.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-18.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_22-38-31-900.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...