java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:04:51,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:04:51,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:04:51,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:04:51,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:04:51,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:04:51,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:04:51,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:04:51,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:04:51,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:04:51,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:04:51,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:04:51,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:04:51,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:04:51,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:04:51,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:04:51,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:04:51,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:04:51,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:04:51,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:04:51,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:04:51,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:04:51,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:04:51,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:04:51,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:04:51,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:04:51,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:04:51,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:04:51,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:04:51,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:04:51,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:04:51,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:04:51,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:04:51,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:04:51,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:04:51,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:04:51,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:04:51,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:04:51,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:04:51,800 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:04:51,800 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:04:51,800 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:04:51,800 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:04:51,800 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:04:51,801 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:04:51,801 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:04:51,801 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:04:51,801 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:04:51,801 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:04:51,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:04:51,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:04:51,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:04:51,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:04:51,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:04:51,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:04:51,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:04:51,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:04:51,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:04:51,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:04:51,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:04:51,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:04:51,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:04:51,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:04:51,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:04:51,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:04:51,807 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:04:51,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:04:51,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:04:51,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:04:51,808 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:04:51,808 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:04:51,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:04:51,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:04:51,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:04:51,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:04:51,888 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:04:51,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:04:51,952 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c3c1a051/e56896de57134ddaaee81f396681a751/FLAGff4a3f5b6 [2018-10-24 12:04:52,458 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:04:52,458 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:04:52,478 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c3c1a051/e56896de57134ddaaee81f396681a751/FLAGff4a3f5b6 [2018-10-24 12:04:52,502 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c3c1a051/e56896de57134ddaaee81f396681a751 [2018-10-24 12:04:52,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:04:52,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:04:52,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:04:52,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:04:52,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:04:52,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d755f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52, skipping insertion in model container [2018-10-24 12:04:52,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:04:52,574 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:04:52,749 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:04:52,753 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:04:52,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:04:52,806 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:04:52,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52 WrapperNode [2018-10-24 12:04:52,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:04:52,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:04:52,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:04:52,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:04:52,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:04:52,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:04:52,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:04:52,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:04:52,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... [2018-10-24 12:04:52,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:04:52,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:04:52,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:04:52,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:04:52,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:04:53,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:04:53,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:04:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:04:53,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:04:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:04:53,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:04:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:04:53,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:04:53,538 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:04:53,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:53 BoogieIcfgContainer [2018-10-24 12:04:53,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:04:53,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:04:53,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:04:53,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:04:53,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:04:52" (1/3) ... [2018-10-24 12:04:53,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dca6aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:53, skipping insertion in model container [2018-10-24 12:04:53,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:52" (2/3) ... [2018-10-24 12:04:53,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dca6aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:53, skipping insertion in model container [2018-10-24 12:04:53,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:53" (3/3) ... [2018-10-24 12:04:53,548 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-24 12:04:53,558 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:04:53,569 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:04:53,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:04:53,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:04:53,625 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:04:53,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:04:53,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:04:53,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:04:53,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:04:53,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:04:53,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:04:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-24 12:04:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 12:04:53,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:04:53,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:04:53,654 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:04:53,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:04:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-10-24 12:04:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:04:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:04:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:53,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:04:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:04:53,801 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-24 12:04:53,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:04:53,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:04:53,804 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:04:53,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:04:53,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:04:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:04:53,826 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-10-24 12:04:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:04:53,849 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-10-24 12:04:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:04:53,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-24 12:04:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:04:53,859 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:04:53,860 INFO L226 Difference]: Without dead ends: 28 [2018-10-24 12:04:53,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:04:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-24 12:04:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-24 12:04:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-24 12:04:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-24 12:04:53,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-10-24 12:04:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:04:53,904 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-24 12:04:53,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:04:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-10-24 12:04:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:04:53,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:04:53,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:04:53,906 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:04:53,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:04:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-10-24 12:04:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:04:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:53,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:04:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:53,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:04:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:04:54,161 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-24 12:04:54,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:04:54,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:04:54,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:04:54,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:04:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:04:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:04:54,165 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-10-24 12:04:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:04:54,370 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-10-24 12:04:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:04:54,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-24 12:04:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:04:54,372 INFO L225 Difference]: With dead ends: 52 [2018-10-24 12:04:54,372 INFO L226 Difference]: Without dead ends: 38 [2018-10-24 12:04:54,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:04:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-24 12:04:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-10-24 12:04:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 12:04:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-24 12:04:54,380 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-10-24 12:04:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:04:54,381 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-24 12:04:54,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:04:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-24 12:04:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:04:54,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:04:54,382 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:04:54,382 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:04:54,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:04:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-10-24 12:04:54,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:04:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:04:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:04:54,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:04:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:04:54,914 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-24 12:04:55,155 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 16 [2018-10-24 12:04:55,320 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-24 12:04:55,521 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2018-10-24 12:04:55,722 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2018-10-24 12:04:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:04:56,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:04:56,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:04:56,022 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-24 12:04:56,024 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:04:56,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:04:56,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:04:56,293 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:04:58,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:04:58,358 INFO L272 AbstractInterpreter]: Visited 22 different actions 166 times. Merged at 12 different actions 108 times. Widened at 3 different actions 15 times. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 12:04:58,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:04:58,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:04:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:04:58,419 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:04:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:04:58,433 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:04:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:04:58,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:04:59,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:04:59,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:04:59,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:04:59,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:04:59,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:04:59,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:04:59,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 12:04:59,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 12:04:59,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:04:59,275 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:04:59,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:04:59,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:04:59,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 12:04:59,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:04:59,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:04:59,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:04:59,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:04:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:04:59,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:04:59,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-24 12:05:00,078 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-24 12:05:00,106 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-10-24 12:05:00,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:00,127 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-10-24 12:05:00,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:00,143 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:00,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-24 12:05:00,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:00,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:00,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:00,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-24 12:05:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:00,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-24 12:05:00,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:00,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-24 12:05:00,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-24 12:05:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-10-24 12:05:00,255 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-10-24 12:05:00,579 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-24 12:05:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:01,543 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-10-24 12:05:01,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:05:01,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-24 12:05:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:01,548 INFO L225 Difference]: With dead ends: 99 [2018-10-24 12:05:01,548 INFO L226 Difference]: Without dead ends: 77 [2018-10-24 12:05:01,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:05:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-24 12:05:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2018-10-24 12:05:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:05:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-24 12:05:01,564 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 23 [2018-10-24 12:05:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:01,565 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-24 12:05:01,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-24 12:05:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-24 12:05:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 12:05:01,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:01,566 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:01,567 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:01,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:01,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1303070050, now seen corresponding path program 1 times [2018-10-24 12:05:01,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:01,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:01,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:01,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:01,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:01,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:05:01,637 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:01,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:05:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:05:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:05:01,638 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 5 states. [2018-10-24 12:05:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:01,732 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2018-10-24 12:05:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:05:01,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-24 12:05:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:01,736 INFO L225 Difference]: With dead ends: 137 [2018-10-24 12:05:01,737 INFO L226 Difference]: Without dead ends: 90 [2018-10-24 12:05:01,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:05:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-24 12:05:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-10-24 12:05:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-24 12:05:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-24 12:05:01,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2018-10-24 12:05:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:01,751 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-24 12:05:01,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:05:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-10-24 12:05:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:05:01,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:01,752 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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-24 12:05:01,752 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:01,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-10-24 12:05:01,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:01,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:02,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:02,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:02,339 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-24 12:05:02,339 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:05:02,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:02,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:02,348 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:05:05,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:05,560 INFO L272 AbstractInterpreter]: Visited 26 different actions 413 times. Merged at 16 different actions 288 times. Widened at 4 different actions 29 times. Found 61 fixpoints after 6 different actions. Largest state had 39 variables. [2018-10-24 12:05:05,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:05,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:05,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:05,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:05,627 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:05,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:05,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 12:05:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:05,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:05:05,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:05,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-10-24 12:05:06,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:06,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-24 12:05:06,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:06,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:06,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-24 12:05:06,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:05:06,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2018-10-24 12:05:06,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 12:05:06,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:06,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 12:05:06,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:06,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 12:05:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:06,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:18,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-24 12:05:18,121 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2018-10-24 12:05:18,384 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-24 12:05:18,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,392 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,395 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,396 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-24 12:05:18,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:18,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,423 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 83 [2018-10-24 12:05:18,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:18,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:18,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-10-24 12:05:18,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:18,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:18,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:18,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:18,526 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-24 12:05:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:20,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2018-10-24 12:05:20,710 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:20,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 12:05:20,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 12:05:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=982, Unknown=4, NotChecked=0, Total=1122 [2018-10-24 12:05:20,712 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 22 states. [2018-10-24 12:05:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:21,714 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-10-24 12:05:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:05:21,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-10-24 12:05:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:21,718 INFO L225 Difference]: With dead ends: 152 [2018-10-24 12:05:21,718 INFO L226 Difference]: Without dead ends: 150 [2018-10-24 12:05:21,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=217, Invalid=1419, Unknown=4, NotChecked=0, Total=1640 [2018-10-24 12:05:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-24 12:05:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 75. [2018-10-24 12:05:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-24 12:05:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-10-24 12:05:21,733 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 29 [2018-10-24 12:05:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:21,734 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-10-24 12:05:21,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-24 12:05:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-10-24 12:05:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-24 12:05:21,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:21,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:21,736 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:21,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-10-24 12:05:21,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:21,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:21,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:21,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:21,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:21,915 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-24 12:05:21,915 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-24 12:05:21,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:21,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:21,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:05:23,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:23,176 INFO L272 AbstractInterpreter]: Visited 27 different actions 370 times. Merged at 15 different actions 196 times. Widened at 4 different actions 28 times. Found 11 fixpoints after 2 different actions. Largest state had 39 variables. [2018-10-24 12:05:23,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:23,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:23,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:23,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:23,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:23,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:23,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:23,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:24,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:24,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-24 12:05:24,349 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:24,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:05:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:05:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:24,350 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 8 states. [2018-10-24 12:05:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:24,700 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-10-24 12:05:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:05:24,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-24 12:05:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:24,702 INFO L225 Difference]: With dead ends: 142 [2018-10-24 12:05:24,703 INFO L226 Difference]: Without dead ends: 123 [2018-10-24 12:05:24,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:05:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-24 12:05:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2018-10-24 12:05:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 12:05:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-24 12:05:24,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 32 [2018-10-24 12:05:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:24,731 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-24 12:05:24,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:05:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-24 12:05:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:05:24,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:24,734 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:24,734 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:24,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-10-24 12:05:24,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:24,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:25,620 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-10-24 12:05:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:25,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:25,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:25,884 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:25,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:25,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:25,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:25,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:25,902 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:25,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:05:25,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:25,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:26,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-24 12:05:26,115 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:26,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-10-24 12:05:26,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:05:26,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-10-24 12:05:26,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-10-24 12:05:26,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:26,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:26,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:26,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-10-24 12:05:26,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-24 12:05:26,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 12:05:26,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 12:05:26,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:26,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 12:05:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:26,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:29,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-10-24 12:05:29,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-10-24 12:05:29,187 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-10-24 12:05:29,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:29,217 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:05:29,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:29,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,221 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-24 12:05:29,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:29,254 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-10-24 12:05:29,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:29,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,352 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,367 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,405 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,433 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-10-24 12:05:29,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 81 [2018-10-24 12:05:29,449 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:29,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:29,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-10-24 12:05:29,482 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-24 12:05:29,484 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:05:29,485 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:29,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:05:29,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:05:29,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:05:29,607 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-24 12:05:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:29,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:29,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2018-10-24 12:05:29,880 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:29,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-24 12:05:29,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-24 12:05:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2018-10-24 12:05:29,882 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 20 states. [2018-10-24 12:05:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:30,963 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-10-24 12:05:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 12:05:30,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-24 12:05:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:30,966 INFO L225 Difference]: With dead ends: 194 [2018-10-24 12:05:30,966 INFO L226 Difference]: Without dead ends: 141 [2018-10-24 12:05:30,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-10-24 12:05:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-24 12:05:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2018-10-24 12:05:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-24 12:05:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-10-24 12:05:30,991 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 31 [2018-10-24 12:05:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:30,992 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-10-24 12:05:30,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-24 12:05:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-10-24 12:05:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 12:05:30,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:30,994 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:30,994 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:30,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash 982712326, now seen corresponding path program 2 times [2018-10-24 12:05:30,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:30,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:30,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:30,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:05:31,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:31,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:31,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:31,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:31,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:31,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:31,091 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:31,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:05:31,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:31,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:31,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 12:05:31,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:05:31,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-24 12:05:31,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-24 12:05:31,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,458 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-24 12:05:31,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:05:31,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-24 12:05:31,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-24 12:05:31,585 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:31,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:31,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:31,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-24 12:05:31,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:31,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:5 [2018-10-24 12:05:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:31,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:33,756 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_write~int_#value_9| Int)) (or (< c_main_~key~0 |v_main_write~int_#value_9|) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) |v_main_write~int_#value_9|))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))))) is different from false [2018-10-24 12:05:34,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-10-24 12:05:34,049 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2018-10-24 12:05:34,154 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-10-24 12:05:34,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,159 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,160 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,165 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 78 [2018-10-24 12:05:34,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:34,189 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:05:34,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,196 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:34,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 78 [2018-10-24 12:05:34,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:34,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-24 12:05:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2018-10-24 12:05:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:36,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 31 [2018-10-24 12:05:36,415 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:36,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:05:36,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:05:36,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=761, Unknown=2, NotChecked=56, Total=930 [2018-10-24 12:05:36,417 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 19 states. [2018-10-24 12:05:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:37,915 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2018-10-24 12:05:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 12:05:37,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-10-24 12:05:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:37,917 INFO L225 Difference]: With dead ends: 213 [2018-10-24 12:05:37,917 INFO L226 Difference]: Without dead ends: 134 [2018-10-24 12:05:37,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=387, Invalid=2371, Unknown=2, NotChecked=102, Total=2862 [2018-10-24 12:05:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-24 12:05:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-10-24 12:05:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-24 12:05:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-24 12:05:37,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 35 [2018-10-24 12:05:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:37,933 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-24 12:05:37,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:05:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-10-24 12:05:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:05:37,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:37,935 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:37,935 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-10-24 12:05:37,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:37,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:37,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:37,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:38,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:38,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:38,366 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-24 12:05:38,367 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:05:38,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:38,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:38,373 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:05:40,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:40,167 INFO L272 AbstractInterpreter]: Visited 25 different actions 284 times. Merged at 15 different actions 202 times. Widened at 4 different actions 27 times. Found 19 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-24 12:05:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:40,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:40,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:40,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:40,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:40,212 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:40,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:40,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:05:40,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:40,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:05:40,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:05:40,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 12:05:40,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 12:05:40,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:40,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:40,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 12:05:40,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:05:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:40,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:40,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-24 12:05:40,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-10-24 12:05:40,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:40,916 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-10-24 12:05:40,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,930 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:40,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-10-24 12:05:40,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:05:41,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:41,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-24 12:05:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:42,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:42,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2018-10-24 12:05:42,283 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:42,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:05:42,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:05:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-10-24 12:05:42,284 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 23 states. [2018-10-24 12:05:42,752 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-24 12:05:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:44,223 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-10-24 12:05:44,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-24 12:05:44,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-10-24 12:05:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:44,226 INFO L225 Difference]: With dead ends: 190 [2018-10-24 12:05:44,226 INFO L226 Difference]: Without dead ends: 147 [2018-10-24 12:05:44,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:05:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-24 12:05:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2018-10-24 12:05:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-24 12:05:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-24 12:05:44,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2018-10-24 12:05:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:44,241 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-24 12:05:44,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:05:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-24 12:05:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 12:05:44,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:44,243 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:44,243 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:44,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:44,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-10-24 12:05:44,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:44,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:44,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:45,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:45,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:45,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:05:45,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:45,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:05:45,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:45,190 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:45,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:45,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:45,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:45,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-24 12:05:45,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-24 12:05:45,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-24 12:05:45,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-24 12:05:45,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-10-24 12:05:45,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-24 12:05:45,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-10-24 12:05:45,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:05:45,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-24 12:05:45,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-24 12:05:45,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 61 [2018-10-24 12:05:45,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-10-24 12:05:45,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-24 12:05:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:05:45,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-24 12:05:45,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-24 12:05:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:05:46,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:06,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-10-24 12:06:06,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-24 12:06:06,016 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-10-24 12:06:06,088 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2018-10-24 12:06:06,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,135 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 46 [2018-10-24 12:06:06,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:06:06,149 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,149 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,166 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,167 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 85 [2018-10-24 12:06:06,227 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,235 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 83 [2018-10-24 12:06:06,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 85 [2018-10-24 12:06:06,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,329 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,343 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,412 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,420 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-10-24 12:06:06,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 83 [2018-10-24 12:06:06,437 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:06,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 52 [2018-10-24 12:06:06,459 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-24 12:06:06,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:06:06,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:06:06,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-24 12:06:06,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-24 12:06:06,845 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:77, output treesize:104 [2018-10-24 12:06:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 14 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:16,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-10-24 12:06:16,351 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:16,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-24 12:06:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-24 12:06:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1493, Unknown=14, NotChecked=0, Total=1722 [2018-10-24 12:06:16,354 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 26 states. [2018-10-24 12:06:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:17,178 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2018-10-24 12:06:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:06:17,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-10-24 12:06:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:17,180 INFO L225 Difference]: With dead ends: 119 [2018-10-24 12:06:17,180 INFO L226 Difference]: Without dead ends: 117 [2018-10-24 12:06:17,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=308, Invalid=2030, Unknown=14, NotChecked=0, Total=2352 [2018-10-24 12:06:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-24 12:06:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2018-10-24 12:06:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-24 12:06:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-24 12:06:17,194 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-10-24 12:06:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:17,194 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-24 12:06:17,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-24 12:06:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-10-24 12:06:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:06:17,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:17,196 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:17,196 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:17,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-10-24 12:06:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:17,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:06:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:17,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:17,813 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:17,813 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:06:17,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:06:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:17,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:06:17,822 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:06:17,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:06:17,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:06:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:18,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:06:18,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:18,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:06:18,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-24 12:06:18,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-24 12:06:18,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-24 12:06:18,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:18,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-24 12:06:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:18,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:20,683 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-24 12:06:22,746 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-24 12:06:22,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-10-24 12:06:22,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-10-24 12:06:22,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:22,822 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,823 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,825 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 52 [2018-10-24 12:06:22,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:06:22,841 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,841 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,843 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:22,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 52 [2018-10-24 12:06:22,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-24 12:06:22,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:22,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:06:22,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:22 [2018-10-24 12:06:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:23,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:23,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 43 [2018-10-24 12:06:23,230 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:23,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:06:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:06:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2018-10-24 12:06:23,232 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 32 states. [2018-10-24 12:06:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:36,807 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-24 12:06:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:06:36,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-24 12:06:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:36,810 INFO L225 Difference]: With dead ends: 136 [2018-10-24 12:06:36,810 INFO L226 Difference]: Without dead ends: 134 [2018-10-24 12:06:36,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=400, Invalid=2680, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:06:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-24 12:06:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-10-24 12:06:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-24 12:06:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-24 12:06:36,827 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2018-10-24 12:06:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:36,828 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-24 12:06:36,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:06:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-24 12:06:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:06:36,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:36,829 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:36,830 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:36,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1027358850, now seen corresponding path program 3 times [2018-10-24 12:06:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:36,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:06:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:36,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:37,171 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 12:06:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:37,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:37,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:37,814 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:06:37,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:06:37,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:37,814 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:06:37,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:06:37,832 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:06:37,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:06:37,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:06:37,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:38,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:06:38,020 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:06:38,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-24 12:06:38,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-24 12:06:38,140 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-10-24 12:06:38,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-24 12:06:38,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-10-24 12:06:38,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-10-24 12:06:38,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:13 [2018-10-24 12:06:38,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-24 12:06:38,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-24 12:06:38,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-10-24 12:06:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:38,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:21,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-10-24 12:07:21,794 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-10-24 12:07:21,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:21,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 92 [2018-10-24 12:07:22,268 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-10-24 12:07:22,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,374 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,375 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,385 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-10-24 12:07:22,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 95 [2018-10-24 12:07:22,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:22,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,429 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2018-10-24 12:07:22,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:22,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 95 [2018-10-24 12:07:22,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:22,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,506 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 50 [2018-10-24 12:07:22,513 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:22,522 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,532 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 97 [2018-10-24 12:07:22,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:22,581 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,582 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,583 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,585 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 83 [2018-10-24 12:07:22,607 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:22,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,619 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:22,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:07:22,668 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:23,188 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 142 [2018-10-24 12:07:23,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:07:23,300 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 39 xjuncts. [2018-10-24 12:07:23,329 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 98 [2018-10-24 12:07:23,384 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-10-24 12:07:23,389 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:23,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 97 [2018-10-24 12:07:23,452 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-10-24 12:07:24,644 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,652 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 99 [2018-10-24 12:07:24,697 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:24,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 59 [2018-10-24 12:07:24,724 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:24,727 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 51 [2018-10-24 12:07:24,751 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:24,760 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,768 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:24,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:07:24,811 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:26,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-24 12:07:26,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:07:26,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:07:26,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-10-24 12:07:26,528 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:76, output treesize:145 [2018-10-24 12:07:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2018-10-24 12:07:26,736 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:26,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-24 12:07:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-24 12:07:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1347, Unknown=19, NotChecked=0, Total=1560 [2018-10-24 12:07:26,740 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 28 states. [2018-10-24 12:07:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:28,475 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-10-24 12:07:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 12:07:28,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-10-24 12:07:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:28,477 INFO L225 Difference]: With dead ends: 202 [2018-10-24 12:07:28,477 INFO L226 Difference]: Without dead ends: 157 [2018-10-24 12:07:28,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=418, Invalid=2533, Unknown=19, NotChecked=0, Total=2970 [2018-10-24 12:07:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-24 12:07:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2018-10-24 12:07:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 12:07:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-10-24 12:07:28,497 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-10-24 12:07:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:28,497 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-10-24 12:07:28,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-24 12:07:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-10-24 12:07:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:07:28,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:28,498 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:28,498 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:28,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-10-24 12:07:28,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:28,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:28,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:07:28,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:28,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:29,156 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-24 12:07:29,639 WARN L179 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-10-24 12:07:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:30,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:30,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:07:30,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-24 12:07:30,322 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:07:30,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:07:30,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:07:30,331 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:07:31,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:07:31,827 INFO L272 AbstractInterpreter]: Visited 25 different actions 269 times. Merged at 15 different actions 191 times. Widened at 4 different actions 24 times. Found 17 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-24 12:07:31,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:31,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:07:31,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:31,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:07:31,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:07:31,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:07:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:31,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:07:32,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:07:32,174 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:07:32,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:32,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 12:07:32,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 12:07:32,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,394 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:07:32,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:32,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-10-24 12:07:32,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 12:07:32,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,591 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:07:32,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:32,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-24 12:07:32,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 12:07:32,690 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:32,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:32,694 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:32,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-10-24 12:07:32,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:07:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:07:32,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:33,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-10-24 12:07:33,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:33,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-10-24 12:07:33,817 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:33,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 79 [2018-10-24 12:07:34,176 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-24 12:07:34,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,186 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,198 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 126 [2018-10-24 12:07:34,259 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:07:34,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 39 xjuncts. [2018-10-24 12:07:34,275 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:07:34,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:34,279 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,283 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,286 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,294 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,295 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 124 [2018-10-24 12:07:34,349 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:07:34,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 39 xjuncts. [2018-10-24 12:07:34,383 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:07:34,384 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:34,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,405 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,406 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 126 [2018-10-24 12:07:34,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:07:34,482 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 39 xjuncts. [2018-10-24 12:07:34,487 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:07:34,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:34,491 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,495 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,506 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:34,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 124 [2018-10-24 12:07:34,565 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:07:34,577 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 39 xjuncts. [2018-10-24 12:07:35,993 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,001 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,003 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 92 [2018-10-24 12:07:36,046 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:36,260 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,270 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:36,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 97 [2018-10-24 12:07:36,318 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-24 12:07:36,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-24 12:07:36,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:07:36,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:07:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:07:36,556 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:76, output treesize:57 [2018-10-24 12:07:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:36,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 46 [2018-10-24 12:07:36,821 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:36,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:07:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:07:36,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1837, Unknown=0, NotChecked=0, Total=2070 [2018-10-24 12:07:36,824 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 31 states. [2018-10-24 12:07:39,806 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-10-24 12:07:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:40,872 INFO L93 Difference]: Finished difference Result 278 states and 325 transitions. [2018-10-24 12:07:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-24 12:07:40,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-24 12:07:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:40,876 INFO L225 Difference]: With dead ends: 278 [2018-10-24 12:07:40,876 INFO L226 Difference]: Without dead ends: 233 [2018-10-24 12:07:40,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=694, Invalid=4562, Unknown=0, NotChecked=0, Total=5256 [2018-10-24 12:07:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-24 12:07:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 140. [2018-10-24 12:07:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-24 12:07:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-10-24 12:07:40,909 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 45 [2018-10-24 12:07:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:40,909 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-10-24 12:07:40,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:07:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-10-24 12:07:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-24 12:07:40,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:40,911 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:40,911 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-10-24 12:07:40,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:07:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:40,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:41,353 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-24 12:07:41,645 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-24 12:07:41,930 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-10-24 12:07:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:42,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:42,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:07:42,397 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-24 12:07:42,397 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-24 12:07:42,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:07:42,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:07:42,406 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:07:45,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:07:45,164 INFO L272 AbstractInterpreter]: Visited 30 different actions 462 times. Merged at 18 different actions 289 times. Widened at 5 different actions 39 times. Found 32 fixpoints after 6 different actions. Largest state had 40 variables. [2018-10-24 12:07:45,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:45,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:07:45,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:45,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:07:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:07:45,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:07:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:45,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:07:45,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-24 12:07:45,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:45,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-24 12:07:45,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:45,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:45,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:45,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-24 12:07:45,976 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:45,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 12:07:45,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:45,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:45,984 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:45,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:45,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2018-10-24 12:07:45,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:46,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:37 [2018-10-24 12:07:46,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2018-10-24 12:07:46,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:46,575 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,578 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:46,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 78 [2018-10-24 12:07:46,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-10-24 12:07:46,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,678 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:46,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:46,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:46,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 150 [2018-10-24 12:07:46,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-24 12:07:46,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:46,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:91, output treesize:5 [2018-10-24 12:07:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:46,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:48,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-10-24 12:07:48,319 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-10-24 12:07:48,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-10-24 12:07:48,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,417 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,419 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,421 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-10-24 12:07:48,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,436 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-10-24 12:07:48,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-10-24 12:07:48,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:48,469 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,469 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,471 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,472 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,472 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-10-24 12:07:48,481 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,485 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,486 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,486 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-10-24 12:07:48,491 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,495 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,498 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,499 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,499 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,506 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,507 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:48,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-10-24 12:07:48,511 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:48,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:07:48,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:07:48,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:07:48,593 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-10-24 12:07:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:48,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:48,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 17] total 49 [2018-10-24 12:07:48,735 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:48,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-24 12:07:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-24 12:07:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2126, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 12:07:48,737 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 36 states. [2018-10-24 12:07:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:51,301 INFO L93 Difference]: Finished difference Result 282 states and 333 transitions. [2018-10-24 12:07:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-24 12:07:51,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-10-24 12:07:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:51,308 INFO L225 Difference]: With dead ends: 282 [2018-10-24 12:07:51,308 INFO L226 Difference]: Without dead ends: 237 [2018-10-24 12:07:51,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=594, Invalid=4956, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 12:07:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-24 12:07:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 181. [2018-10-24 12:07:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-24 12:07:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-10-24 12:07:51,340 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 46 [2018-10-24 12:07:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:51,340 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-10-24 12:07:51,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-24 12:07:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-10-24 12:07:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:07:51,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:51,342 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:51,342 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:51,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1700799956, now seen corresponding path program 2 times [2018-10-24 12:07:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:51,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:07:51,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:51,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:51,646 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 12:07:51,953 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-10-24 12:07:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:07:52,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:52,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:07:52,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:07:52,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:07:52,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:52,635 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:07:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:07:52,643 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:07:52,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:07:52,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:07:52,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:07:52,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:07:52,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:52,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:07:52,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:52,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:52,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:52,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-24 12:07:53,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-24 12:07:53,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:53,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:53,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 80 [2018-10-24 12:07:53,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:53,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:53,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:53,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-24 12:07:53,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-24 12:07:53,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:53,217 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-10-24 12:07:53,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:53,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:53,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:53,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-24 12:07:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:07:53,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:53,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-10-24 12:07:53,763 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2018-10-24 12:07:53,837 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,838 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,844 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,845 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,845 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,846 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 68 [2018-10-24 12:07:53,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:53,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:53,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,888 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-10-24 12:07:53,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,961 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,962 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,964 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:53,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 73 [2018-10-24 12:07:53,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:54,040 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:54,044 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 113 [2018-10-24 12:07:54,297 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2018-10-24 12:07:54,301 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,302 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,303 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,303 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,304 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,305 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 81 [2018-10-24 12:07:54,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:54,324 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,326 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,326 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,326 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,327 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,328 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 83 [2018-10-24 12:07:54,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:54,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,421 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,424 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 78 [2018-10-24 12:07:54,445 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:54,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,452 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:54,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-10-24 12:07:54,466 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:54,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:07:54,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:54,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:54,518 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:98, output treesize:13 [2018-10-24 12:07:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:07:54,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:07:54,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 44 [2018-10-24 12:07:54,628 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:07:54,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:07:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:07:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:07:54,629 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 31 states. [2018-10-24 12:07:56,552 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-10-24 12:07:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:59,365 INFO L93 Difference]: Finished difference Result 430 states and 510 transitions. [2018-10-24 12:07:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-24 12:07:59,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-24 12:07:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:59,369 INFO L225 Difference]: With dead ends: 430 [2018-10-24 12:07:59,369 INFO L226 Difference]: Without dead ends: 385 [2018-10-24 12:07:59,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1663, Invalid=8639, Unknown=0, NotChecked=0, Total=10302 [2018-10-24 12:07:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-24 12:07:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 213. [2018-10-24 12:07:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-24 12:07:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2018-10-24 12:07:59,418 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 45 [2018-10-24 12:07:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:59,418 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2018-10-24 12:07:59,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:07:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2018-10-24 12:07:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:07:59,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:59,419 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:59,419 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:59,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash -390828650, now seen corresponding path program 4 times [2018-10-24 12:07:59,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:59,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:07:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:59,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:00,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:00,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:00,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:08:00,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:08:00,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:00,355 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:00,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:00,365 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:08:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:00,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:00,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-24 12:08:00,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-24 12:08:00,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-24 12:08:00,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-24 12:08:00,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:26 [2018-10-24 12:08:00,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-24 12:08:00,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-24 12:08:00,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:00,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-10-24 12:08:00,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-24 12:08:00,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 85 [2018-10-24 12:08:00,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:01,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2018-10-24 12:08:01,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-24 12:08:01,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,301 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,303 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 85 [2018-10-24 12:08:01,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:01,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:35 [2018-10-24 12:08:01,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-24 12:08:01,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,494 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:01,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 51 [2018-10-24 12:08:01,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-10-24 12:08:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:01,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:08:02,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-10-24 12:08:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-10-24 12:08:02,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2018-10-24 12:08:02,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-10-24 12:08:02,851 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-10-24 12:08:02,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,859 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 64 [2018-10-24 12:08:02,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:02,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,876 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,878 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 62 [2018-10-24 12:08:02,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:02,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 50 [2018-10-24 12:08:02,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:02,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,909 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,911 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 65 [2018-10-24 12:08:02,923 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:02,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,930 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 64 [2018-10-24 12:08:02,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:02,945 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-10-24 12:08:02,947 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:02,950 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,951 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:02,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 62 [2018-10-24 12:08:02,965 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:03,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2018-10-24 12:08:03,141 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:03,146 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:03,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-10-24 12:08:03,166 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:03,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:03,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:03,177 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:03,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 84 [2018-10-24 12:08:03,212 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 11 xjuncts. [2018-10-24 12:08:03,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:08:03,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 84 [2018-10-24 12:08:04,278 WARN L179 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 165 [2018-10-24 12:08:04,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,311 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2018-10-24 12:08:04,350 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:04,353 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,360 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 109 [2018-10-24 12:08:04,392 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:04,401 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,407 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 107 [2018-10-24 12:08:04,440 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:04,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,446 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 59 [2018-10-24 12:08:04,459 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:04,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 75 [2018-10-24 12:08:04,485 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:04,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,492 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,497 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 109 [2018-10-24 12:08:04,531 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:04,534 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,540 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:04,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 110 [2018-10-24 12:08:04,572 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:06,043 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 98 [2018-10-24 12:08:06,091 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,096 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,108 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 137 [2018-10-24 12:08:06,167 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-24 12:08:06,183 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 68 xjuncts. [2018-10-24 12:08:06,187 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,192 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:06,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 91 [2018-10-24 12:08:06,229 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 16 xjuncts. [2018-10-24 12:08:08,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:08,910 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:08,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:08,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 135 [2018-10-24 12:08:08,986 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-24 12:08:09,020 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 120 xjuncts. [2018-10-24 12:08:09,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 96 [2018-10-24 12:08:09,126 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:08:09,134 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 64 xjuncts. [2018-10-24 12:08:09,138 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:09,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 89 [2018-10-24 12:08:09,190 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-10-24 12:08:09,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:09,195 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:09,207 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:09,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 137 [2018-10-24 12:08:09,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-24 12:08:09,316 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 120 xjuncts. [2018-10-24 12:08:16,931 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 [2018-10-24 12:08:16,945 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:16,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 52 [2018-10-24 12:08:16,961 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:16,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2018-10-24 12:08:16,973 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:16,976 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,977 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:16,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 67 [2018-10-24 12:08:16,991 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:18,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 52 [2018-10-24 12:08:18,072 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:18,087 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 111 [2018-10-24 12:08:18,209 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 11 xjuncts. [2018-10-24 12:08:18,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,226 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:18,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 109 [2018-10-24 12:08:18,266 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 11 xjuncts. [2018-10-24 12:08:18,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 79 [2018-10-24 12:08:18,305 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:19,543 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 [2018-10-24 12:08:19,562 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:19,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2018-10-24 12:08:19,592 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-10-24 12:08:19,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,602 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:19,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 102 [2018-10-24 12:08:19,634 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:20,371 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 28 xjuncts. [2018-10-24 12:08:20,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-10-24 12:08:21,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-24 12:08:21,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-24 12:08:21,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 18 xjuncts. [2018-10-24 12:08:21,867 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 9 variables, input treesize:103, output treesize:259 [2018-10-24 12:08:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:22,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:08:22,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2018-10-24 12:08:22,258 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:08:22,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-24 12:08:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-24 12:08:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2834, Unknown=0, NotChecked=0, Total=3192 [2018-10-24 12:08:22,260 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand 38 states. [2018-10-24 12:08:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:24,362 INFO L93 Difference]: Finished difference Result 361 states and 434 transitions. [2018-10-24 12:08:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 12:08:24,363 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-10-24 12:08:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:24,365 INFO L225 Difference]: With dead ends: 361 [2018-10-24 12:08:24,365 INFO L226 Difference]: Without dead ends: 272 [2018-10-24 12:08:24,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=653, Invalid=4459, Unknown=0, NotChecked=0, Total=5112 [2018-10-24 12:08:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-24 12:08:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2018-10-24 12:08:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-24 12:08:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2018-10-24 12:08:24,416 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 45 [2018-10-24 12:08:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:24,417 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2018-10-24 12:08:24,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-24 12:08:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2018-10-24 12:08:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-24 12:08:24,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:24,418 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:24,418 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:24,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1905129809, now seen corresponding path program 3 times [2018-10-24 12:08:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:24,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:08:25,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:25,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:25,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:08:25,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:08:25,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:25,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:08:25,072 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:08:25,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:08:25,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:08:25,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:08:25,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:08:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:08:25,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:08:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-10-24 12:08:25,447 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:08:25,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:08:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:08:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:08:25,448 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand 13 states. [2018-10-24 12:08:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:25,870 INFO L93 Difference]: Finished difference Result 307 states and 369 transitions. [2018-10-24 12:08:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:08:25,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-10-24 12:08:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:25,872 INFO L225 Difference]: With dead ends: 307 [2018-10-24 12:08:25,872 INFO L226 Difference]: Without dead ends: 275 [2018-10-24 12:08:25,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:08:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-24 12:08:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 217. [2018-10-24 12:08:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-24 12:08:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2018-10-24 12:08:25,916 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 49 [2018-10-24 12:08:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:25,916 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2018-10-24 12:08:25,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:08:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2018-10-24 12:08:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-24 12:08:25,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:25,917 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:25,917 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:25,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash -139141365, now seen corresponding path program 4 times [2018-10-24 12:08:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:25,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:08:25,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:25,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:26,377 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 5 [2018-10-24 12:08:26,717 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2018-10-24 12:08:26,945 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2018-10-24 12:08:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:27,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:27,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:27,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:08:27,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:08:27,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:27,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:27,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:27,334 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:08:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:27,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:27,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:08:27,473 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:08:27,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:27,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:48 [2018-10-24 12:08:27,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 12:08:27,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,612 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:08:27,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:27,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:36 [2018-10-24 12:08:27,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-24 12:08:27,898 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,899 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:27,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:27,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:27,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-10-24 12:08:27,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:27,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-10-24 12:08:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:28,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:08:28,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-10-24 12:08:28,514 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-10-24 12:08:28,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2018-10-24 12:08:28,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,622 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:08:28,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,646 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,647 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,648 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-10-24 12:08:28,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 63 [2018-10-24 12:08:28,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,703 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,703 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,708 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 98 [2018-10-24 12:08:28,729 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,734 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,740 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2018-10-24 12:08:28,928 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:28,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,944 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,949 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:28,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 99 [2018-10-24 12:08:28,968 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:29,079 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:08:29,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:29,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:29,141 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:64, output treesize:44 [2018-10-24 12:08:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:29,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:08:29,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 39 [2018-10-24 12:08:29,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:08:29,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-24 12:08:29,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-24 12:08:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-10-24 12:08:29,222 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand 32 states. [2018-10-24 12:08:30,954 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-24 12:08:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:31,598 INFO L93 Difference]: Finished difference Result 299 states and 352 transitions. [2018-10-24 12:08:31,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 12:08:31,598 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2018-10-24 12:08:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:31,601 INFO L225 Difference]: With dead ends: 299 [2018-10-24 12:08:31,601 INFO L226 Difference]: Without dead ends: 297 [2018-10-24 12:08:31,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2018-10-24 12:08:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-24 12:08:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 227. [2018-10-24 12:08:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-24 12:08:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2018-10-24 12:08:31,659 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 48 [2018-10-24 12:08:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:31,660 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2018-10-24 12:08:31,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-24 12:08:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2018-10-24 12:08:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 12:08:31,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:31,661 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:31,661 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:31,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -740834584, now seen corresponding path program 1 times [2018-10-24 12:08:31,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:31,663 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:32,008 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-24 12:08:32,539 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2018-10-24 12:08:32,800 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 15 [2018-10-24 12:08:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:33,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:33,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:33,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-24 12:08:33,505 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-24 12:08:33,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:08:33,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:08:33,509 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:08:34,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:08:34,925 INFO L272 AbstractInterpreter]: Visited 26 different actions 312 times. Merged at 16 different actions 214 times. Widened at 4 different actions 28 times. Found 32 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-24 12:08:34,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:34,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:08:34,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:34,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:34,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:34,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:08:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:34,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:35,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:08:35,177 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:08:35,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:35,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-24 12:08:35,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-24 12:08:35,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-24 12:08:35,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:35,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-24 12:08:35,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 12:08:35,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:35,443 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-24 12:08:35,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-24 12:08:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:08:35,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:08:35,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-10-24 12:08:35,827 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-10-24 12:08:35,903 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:35,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,922 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,922 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-10-24 12:08:35,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:35,948 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,948 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,951 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,951 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,952 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-24 12:08:35,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:35,977 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:35,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,979 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:35,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:35,982 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,983 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,987 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,987 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:35,988 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 81 [2018-10-24 12:08:36,010 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:36,012 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,016 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,017 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,018 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:36,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-10-24 12:08:36,041 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:36,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:36,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:36,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:36,098 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:62, output treesize:13 [2018-10-24 12:08:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:36,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:08:36,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 39 [2018-10-24 12:08:36,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:08:36,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-24 12:08:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-24 12:08:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-10-24 12:08:36,314 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand 29 states. [2018-10-24 12:08:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:40,229 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-10-24 12:08:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-24 12:08:40,230 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-10-24 12:08:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:40,233 INFO L225 Difference]: With dead ends: 433 [2018-10-24 12:08:40,233 INFO L226 Difference]: Without dead ends: 344 [2018-10-24 12:08:40,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=920, Invalid=5400, Unknown=0, NotChecked=0, Total=6320 [2018-10-24 12:08:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-24 12:08:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 176. [2018-10-24 12:08:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-24 12:08:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2018-10-24 12:08:40,290 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 51 [2018-10-24 12:08:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:40,291 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2018-10-24 12:08:40,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-24 12:08:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2018-10-24 12:08:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:08:40,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:40,292 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:40,292 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:40,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2124575766, now seen corresponding path program 1 times [2018-10-24 12:08:40,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:40,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:40,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:40,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:40,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:40,514 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 12:08:40,819 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-24 12:08:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:41,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:41,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:41,984 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-24 12:08:41,984 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-24 12:08:41,986 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:08:41,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:08:41,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:08:44,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:08:44,678 INFO L272 AbstractInterpreter]: Visited 31 different actions 562 times. Merged at 19 different actions 345 times. Widened at 5 different actions 38 times. Found 69 fixpoints after 9 different actions. Largest state had 40 variables. [2018-10-24 12:08:44,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:44,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:08:44,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:44,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:44,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:08:44,697 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:08:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:44,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:44,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-24 12:08:44,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:44,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-24 12:08:44,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:45,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-24 12:08:45,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-10-24 12:08:45,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:45,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 80 [2018-10-24 12:08:45,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:45,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-10-24 12:08:45,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-24 12:08:45,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,355 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 154 [2018-10-24 12:08:45,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:45,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:08:45,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-24 12:08:45,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:114 [2018-10-24 12:08:45,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-10-24 12:08:45,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,969 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,970 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:45,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 104 [2018-10-24 12:08:45,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:08:46,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:27 [2018-10-24 12:08:46,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-24 12:08:46,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:46,532 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:46,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-24 12:08:46,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:3 [2018-10-24 12:08:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:08:46,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:08:48,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 127 [2018-10-24 12:08:48,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 136 [2018-10-24 12:08:48,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 171 [2018-10-24 12:08:48,536 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:48,540 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,545 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:48,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 187 [2018-10-24 12:08:48,997 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2018-10-24 12:08:49,002 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:49,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:49,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,007 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,010 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,010 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,013 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,016 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,017 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,018 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,025 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,039 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 175 [2018-10-24 12:08:49,063 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:49,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,069 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,073 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,079 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,080 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 175 [2018-10-24 12:08:49,122 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:49,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,140 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,140 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,146 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 175 [2018-10-24 12:08:49,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:49,189 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:49,189 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:49,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,197 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,201 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,205 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,206 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,207 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,212 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 175 [2018-10-24 12:08:49,250 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-10-24 12:08:49,252 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:49,252 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:49,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,562 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,562 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,563 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,563 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,567 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 94 [2018-10-24 12:08:49,575 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:49,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,638 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,638 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,639 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:49,641 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,645 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 93 [2018-10-24 12:08:49,647 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:49,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:08:49,810 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,813 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,820 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,821 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:49,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 199 [2018-10-24 12:08:50,273 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-10-24 12:08:50,278 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:50,278 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:50,280 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:50,280 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:50,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,285 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,285 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,287 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,288 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,289 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,294 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 136 [2018-10-24 12:08:50,301 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,305 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,306 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,306 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,321 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 136 [2018-10-24 12:08:50,323 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:50,325 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:08:50,325 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:50,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,331 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,333 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,335 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,335 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,342 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,346 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 136 [2018-10-24 12:08:50,349 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:50,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,353 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,354 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,354 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,356 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,363 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 136 [2018-10-24 12:08:50,370 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:50,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,649 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,652 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,661 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,662 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,663 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,677 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,702 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 231 [2018-10-24 12:08:50,745 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 20 xjuncts. [2018-10-24 12:08:50,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,976 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,977 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:50,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,982 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,983 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,989 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:50,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 130 [2018-10-24 12:08:50,995 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:51,066 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:51,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:51,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:51,376 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:51,377 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:51,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 270 [2018-10-24 12:08:51,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 Received shutdown request... [2018-10-24 12:08:57,160 WARN L187 SmtUtils]: Removed 245 from assertion stack [2018-10-24 12:08:57,160 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:08:57,361 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:08:57,361 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:08:57,366 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:08:57,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:08:57 BoogieIcfgContainer [2018-10-24 12:08:57,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:08:57,368 INFO L168 Benchmark]: Toolchain (without parser) took 244850.65 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 12:08:57,368 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:08:57,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 12:08:57,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:08:57,369 INFO L168 Benchmark]: Boogie Preprocessor took 30.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:08:57,369 INFO L168 Benchmark]: RCFGBuilder took 653.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:08:57,369 INFO L168 Benchmark]: TraceAbstraction took 243826.51 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 889.7 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -427.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-24 12:08:57,371 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 653.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243826.51 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 889.7 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -427.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 6639. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 243.7s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 43.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 718 SDtfs, 2639 SDslu, 6208 SDs, 0 SdLazy, 8413 SolverSat, 1741 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1842 GetRequests, 896 SyntacticMatches, 80 SemanticMatches, 866 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 15723 ImplicationChecksByTransitivity, 146.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.1s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1143 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 165.7s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1302 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1897 ConstructedInterpolants, 360 QuantifiedInterpolants, 1230864 SizeOfPredicates, 480 NumberOfNonLiveVariables, 2957 ConjunctsInSsa, 787 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 230/1223 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown