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/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:05:23,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:05:23,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:05:23,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:05:23,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:05:23,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:05:23,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:05:23,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:05:23,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:05:23,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:05:23,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:05:23,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:05:23,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:05:23,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:05:23,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:05:23,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:05:23,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:05:23,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:05:23,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:05:23,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:05:23,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:05:23,610 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:05:23,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:05:23,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:05:23,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:05:23,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:05:23,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:05:23,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:05:23,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:05:23,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:05:23,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:05:23,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:05:23,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:05:23,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:05:23,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:05:23,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:05:23,641 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:05:23,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:05:23,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:05:23,670 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:05:23,670 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:05:23,670 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:05:23,670 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:05:23,671 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:05:23,671 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:05:23,671 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:05:23,671 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:05:23,671 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:05:23,672 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:05:23,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:05:23,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:05:23,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:05:23,673 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:05:23,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:05:23,673 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:05:23,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:05:23,674 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:05:23,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:05:23,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:05:23,674 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:05:23,675 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:05:23,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:05:23,675 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:05:23,675 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:05:23,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:05:23,676 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:05:23,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:05:23,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:05:23,676 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:05:23,677 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:05:23,677 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:05:23,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:05:23,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:05:23,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:05:23,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:05:23,766 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:05:23,767 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-24 12:05:23,828 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dd2553c8/c06f44ec57864816a6775b5be9276be6/FLAG8df949ff0 [2018-10-24 12:05:24,361 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:05:24,362 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-24 12:05:24,372 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dd2553c8/c06f44ec57864816a6775b5be9276be6/FLAG8df949ff0 [2018-10-24 12:05:24,392 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9dd2553c8/c06f44ec57864816a6775b5be9276be6 [2018-10-24 12:05:24,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:05:24,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:05:24,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:24,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:05:24,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:05:24,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52735c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24, skipping insertion in model container [2018-10-24 12:05:24,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:05:24,455 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:05:24,655 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:24,659 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:05:24,685 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:05:24,708 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:05:24,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24 WrapperNode [2018-10-24 12:05:24,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:05:24,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:24,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:05:24,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:05:24,720 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:05:24" (1/1) ... [2018-10-24 12:05:24,730 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:05:24" (1/1) ... [2018-10-24 12:05:24,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:05:24,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:05:24,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:05:24,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:05:24,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (1/1) ... [2018-10-24 12:05:24,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:05:24,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:05:24,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:05:24,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:05:24,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (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:05:24,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:05:24,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:05:24,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:05:24,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:05:24,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:05:24,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:05:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:05:24,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:05:25,429 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:05:25,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:25 BoogieIcfgContainer [2018-10-24 12:05:25,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:05:25,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:05:25,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:05:25,434 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:05:25,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:05:24" (1/3) ... [2018-10-24 12:05:25,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46da4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:25, skipping insertion in model container [2018-10-24 12:05:25,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:05:24" (2/3) ... [2018-10-24 12:05:25,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46da4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:05:25, skipping insertion in model container [2018-10-24 12:05:25,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:05:25" (3/3) ... [2018-10-24 12:05:25,438 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-10-24 12:05:25,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:05:25,458 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:05:25,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:05:25,512 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:05:25,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:05:25,512 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:05:25,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:05:25,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:05:25,513 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:05:25,513 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:05:25,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:05:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-24 12:05:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:05:25,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:25,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:25,543 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:25,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-24 12:05:25,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:25,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:25,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:25,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:25,713 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:05:25,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:25,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:05:25,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:25,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:05:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:05:25,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:05:25,740 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-24 12:05:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:25,766 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-24 12:05:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:05:25,768 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-24 12:05:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:25,781 INFO L225 Difference]: With dead ends: 51 [2018-10-24 12:05:25,781 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 12:05:25,786 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:05:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 12:05:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-24 12:05:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 12:05:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-24 12:05:25,827 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-24 12:05:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:25,827 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-24 12:05:25,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:05:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-24 12:05:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:05:25,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:25,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:25,829 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:25,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-24 12:05:25,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:25,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:25,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:26,144 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:05:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:05:26,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:05:26,145 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:26,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:05:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:05:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:05:26,148 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-10-24 12:05:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:26,297 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-24 12:05:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:05:26,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-24 12:05:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:26,299 INFO L225 Difference]: With dead ends: 40 [2018-10-24 12:05:26,300 INFO L226 Difference]: Without dead ends: 28 [2018-10-24 12:05:26,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:05:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-24 12:05:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-24 12:05:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-24 12:05:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-24 12:05:26,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-24 12:05:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:26,308 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-24 12:05:26,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:05:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-24 12:05:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:05:26,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:26,310 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] [2018-10-24 12:05:26,310 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:26,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-24 12:05:26,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:26,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:26,698 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2018-10-24 12:05:26,779 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:26,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:26,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:26,781 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:05:26,783 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-24 12:05:26,845 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:26,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:26,980 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:05:27,060 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 12:05:27,062 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 36 variables. [2018-10-24 12:05:27,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:27,090 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 12:05:27,197 INFO L232 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 86.81% of their original sizes. [2018-10-24 12:05:27,198 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 12:05:27,233 INFO L413 sIntCurrentIteration]: We have 20 unified AI predicates [2018-10-24 12:05:27,234 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 12:05:27,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 12:05:27,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-24 12:05:27,235 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:05:27,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:05:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:05:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:05:27,237 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-10-24 12:05:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:27,576 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-10-24 12:05:27,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:05:27,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-24 12:05:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:27,578 INFO L225 Difference]: With dead ends: 48 [2018-10-24 12:05:27,578 INFO L226 Difference]: Without dead ends: 30 [2018-10-24 12:05:27,579 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:05:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-24 12:05:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-24 12:05:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-24 12:05:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-24 12:05:27,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-24 12:05:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:27,598 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-24 12:05:27,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:05:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-24 12:05:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:05:27,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:27,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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:27,603 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:27,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-24 12:05:27,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:27,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:27,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:28,330 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-24 12:05:28,514 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-10-24 12:05:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:28,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:28,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:28,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-24 12:05:28,570 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-24 12:05:28,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:05:28,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:05:28,581 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:05:31,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:05:31,941 INFO L272 AbstractInterpreter]: Visited 22 different actions 257 times. Merged at 11 different actions 182 times. Widened at 2 different actions 36 times. Found 41 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-24 12:05:31,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:31,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:05:31,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:31,985 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:05:32,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:32,005 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:32,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:32,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:05:32,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:05:32,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 42 treesize of output 39 [2018-10-24 12:05:32,517 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 14 treesize of output 13 [2018-10-24 12:05:32,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,604 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:32,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:32,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:87, output treesize:35 [2018-10-24 12:05:33,166 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-24 12:05:33,410 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-10-24 12:05:33,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2018-10-24 12:05:33,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:33,465 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-24 12:05:33,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:33,500 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:33,501 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-24 12:05:33,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:33,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:33,533 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:05:33,534 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:3 [2018-10-24 12:05:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:33,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:34,206 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 12:05:34,534 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-10-24 12:05:34,560 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 45 treesize of output 47 [2018-10-24 12:05:34,707 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-24 12:05:34,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-24 12:05:34,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,801 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 39 treesize of output 38 [2018-10-24 12:05:34,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:34,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:35,063 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 44 treesize of output 46 [2018-10-24 12:05:35,151 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 36 treesize of output 35 [2018-10-24 12:05:35,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:35,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 31 [2018-10-24 12:05:35,228 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:35,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:35,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:05:35,391 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-24 12:05:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:35,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:35,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-24 12:05:35,531 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:35,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:05:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:05:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:05:35,535 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-10-24 12:05:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:36,466 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-24 12:05:36,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:05:36,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-24 12:05:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:36,468 INFO L225 Difference]: With dead ends: 45 [2018-10-24 12:05:36,468 INFO L226 Difference]: Without dead ends: 33 [2018-10-24 12:05:36,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-10-24 12:05:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-24 12:05:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-24 12:05:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-24 12:05:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-24 12:05:36,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-10-24 12:05:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:36,477 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-24 12:05:36,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:05:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-24 12:05:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 12:05:36,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:36,479 INFO L375 BasicCegarLoop]: trace histogram [3, 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:36,479 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:36,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1179396881, now seen corresponding path program 2 times [2018-10-24 12:05:36,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:36,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:36,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:05:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:36,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:36,691 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:36,691 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:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:36,691 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:36,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:36,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:36,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:05:36,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:36,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:36,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 12 [2018-10-24 12:05:37,155 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:37,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:05:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:05:37,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:05:37,157 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-10-24 12:05:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:37,675 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-10-24 12:05:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:05:37,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-24 12:05:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:37,680 INFO L225 Difference]: With dead ends: 79 [2018-10-24 12:05:37,680 INFO L226 Difference]: Without dead ends: 58 [2018-10-24 12:05:37,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:05:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-24 12:05:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-10-24 12:05:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-24 12:05:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-10-24 12:05:37,695 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-10-24 12:05:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:37,696 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-10-24 12:05:37,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:05:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-10-24 12:05:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 12:05:37,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:37,697 INFO L375 BasicCegarLoop]: trace histogram [4, 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:05:37,697 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:37,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 3 times [2018-10-24 12:05:37,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:37,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:37,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:38,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:38,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:38,176 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:38,176 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:38,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:38,176 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:38,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:38,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:38,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:38,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:38,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:38,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:05:38,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-24 12:05:38,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:05:38,621 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 16 treesize of output 15 [2018-10-24 12:05:38,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,645 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:38,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:38,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-24 12:05:38,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-24 12:05:39,005 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:39,006 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:05:39,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:39,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:39,134 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:05:39,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:39,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:39,153 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:05:39,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-24 12:05:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:05:39,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:39,715 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 45 treesize of output 47 [2018-10-24 12:05:39,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-24 12:05:39,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:39,849 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 39 treesize of output 38 [2018-10-24 12:05:39,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:39,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:39,989 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 44 treesize of output 46 [2018-10-24 12:05:40,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 31 [2018-10-24 12:05:40,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,148 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 36 treesize of output 35 [2018-10-24 12:05:40,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:40,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:40,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:05:40,249 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-24 12:05:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:40,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 32 [2018-10-24 12:05:40,765 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:40,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:05:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:05:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-24 12:05:40,769 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 21 states. [2018-10-24 12:05:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:42,862 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-10-24 12:05:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:05:42,866 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-24 12:05:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:42,867 INFO L225 Difference]: With dead ends: 73 [2018-10-24 12:05:42,868 INFO L226 Difference]: Without dead ends: 61 [2018-10-24 12:05:42,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:05:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-24 12:05:42,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2018-10-24 12:05:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-24 12:05:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-24 12:05:42,880 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2018-10-24 12:05:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:42,880 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-24 12:05:42,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:05:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-24 12:05:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 12:05:42,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:42,882 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:42,882 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2091215382, now seen corresponding path program 4 times [2018-10-24 12:05:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:42,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:42,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:43,558 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-10-24 12:05:43,887 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-24 12:05:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:44,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:44,094 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:44,095 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:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:44,095 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:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:44,109 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:44,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:44,267 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:05:44,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:05:44,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:05:44,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:05:44,845 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 16 treesize of output 15 [2018-10-24 12:05:44,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,862 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:44,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:44,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-24 12:05:45,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-24 12:05:45,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:45,552 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:05:45,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,590 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:45,591 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:05:45,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:45,611 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:05:45,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-24 12:05:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:45,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:46,013 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 45 treesize of output 47 [2018-10-24 12:05:46,101 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 39 treesize of output 38 [2018-10-24 12:05:46,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:46,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-24 12:05:46,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:46,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:46,273 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 46 treesize of output 48 [2018-10-24 12:05:46,364 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 42 treesize of output 41 [2018-10-24 12:05:46,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:46,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 33 [2018-10-24 12:05:46,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:46,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:46,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:05:46,575 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-24 12:05:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:05:47,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:47,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 36 [2018-10-24 12:05:47,125 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:47,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:05:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:05:47,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-10-24 12:05:47,129 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 23 states. [2018-10-24 12:05:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:49,517 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-10-24 12:05:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 12:05:49,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-24 12:05:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:49,520 INFO L225 Difference]: With dead ends: 75 [2018-10-24 12:05:49,520 INFO L226 Difference]: Without dead ends: 63 [2018-10-24 12:05:49,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 12:05:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-24 12:05:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-10-24 12:05:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-24 12:05:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-24 12:05:49,533 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-10-24 12:05:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:49,533 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-24 12:05:49,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:05:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-24 12:05:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-24 12:05:49,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:49,535 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:49,536 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1817864972, now seen corresponding path program 5 times [2018-10-24 12:05:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:49,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:49,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:49,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:49,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:49,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:49,742 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:49,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:49,742 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:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:05:49,751 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:05:49,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:05:49,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:49,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:49,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:49,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:49,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-24 12:05:49,991 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:49,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:05:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:05:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:49,993 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 8 states. [2018-10-24 12:05:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:50,133 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-10-24 12:05:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:05:50,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-24 12:05:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:50,144 INFO L225 Difference]: With dead ends: 78 [2018-10-24 12:05:50,145 INFO L226 Difference]: Without dead ends: 48 [2018-10-24 12:05:50,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:05:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-24 12:05:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-24 12:05:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-24 12:05:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-24 12:05:50,166 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-10-24 12:05:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:50,166 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-24 12:05:50,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:05:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-24 12:05:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-24 12:05:50,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:50,171 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:50,171 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:50,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 905430727, now seen corresponding path program 6 times [2018-10-24 12:05:50,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:50,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:50,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:50,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:05:50,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:50,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:50,450 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:50,450 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:50,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:50,450 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:50,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:05:50,462 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:05:50,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:05:50,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:05:50,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:50,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:05:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:50,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:50,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-24 12:05:51,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:05:51,062 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 16 treesize of output 15 [2018-10-24 12:05:51,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,079 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:51,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,094 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-24 12:05:51,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-24 12:05:51,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:51,421 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:05:51,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:51,439 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:05:51,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:51,457 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:05:51,458 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-24 12:05:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:05:51,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:51,950 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 45 treesize of output 47 [2018-10-24 12:05:52,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-24 12:05:52,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:52,166 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 39 treesize of output 38 [2018-10-24 12:05:52,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:52,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:52,266 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 44 treesize of output 46 [2018-10-24 12:05:52,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 [2018-10-24 12:05:52,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:52,453 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 40 treesize of output 39 [2018-10-24 12:05:52,455 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:52,491 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:52,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:05:52,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-24 12:05:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 12:05:53,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:53,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 18] total 40 [2018-10-24 12:05:53,346 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:53,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:05:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:05:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2018-10-24 12:05:53,349 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 25 states. [2018-10-24 12:05:54,476 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-10-24 12:05:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:05:55,061 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-10-24 12:05:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 12:05:55,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-10-24 12:05:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:05:55,062 INFO L225 Difference]: With dead ends: 104 [2018-10-24 12:05:55,063 INFO L226 Difference]: Without dead ends: 74 [2018-10-24 12:05:55,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-10-24 12:05:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-24 12:05:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-24 12:05:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-24 12:05:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-10-24 12:05:55,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 42 [2018-10-24 12:05:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:05:55,076 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-10-24 12:05:55,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:05:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-10-24 12:05:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-24 12:05:55,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:05:55,077 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:05:55,078 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:05:55,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:05:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash -907144054, now seen corresponding path program 7 times [2018-10-24 12:05:55,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:05:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:55,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:05:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:05:55,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:05:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:55,260 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 12:05:55,419 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 12:05:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 12:05:55,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:55,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:05:55,720 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:05:55,720 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:55,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:05:55,720 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:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:05:55,731 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:05:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:05:55,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:05:55,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:05:55,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:55,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:55,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:05:56,395 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:05:56,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:05:56,408 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 16 treesize of output 15 [2018-10-24 12:05:56,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-24 12:05:56,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-24 12:05:56,780 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:56,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-24 12:05:56,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,796 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:05:56,797 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:05:56,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:05:56,816 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:05:56,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-24 12:05:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 12:05:56,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:05:57,749 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-24 12:05:57,764 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 43 treesize of output 45 [2018-10-24 12:05:57,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 38 [2018-10-24 12:05:57,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:57,944 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 37 treesize of output 36 [2018-10-24 12:05:57,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:57,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:58,046 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 44 treesize of output 46 [2018-10-24 12:05:58,134 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 36 treesize of output 35 [2018-10-24 12:05:58,136 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:58,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 35 [2018-10-24 12:05:58,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:05:58,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:05:58,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:05:58,339 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-24 12:05:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 12:05:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:05:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 20] total 44 [2018-10-24 12:05:59,481 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:05:59,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:05:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:05:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1676, Unknown=0, NotChecked=0, Total=1892 [2018-10-24 12:05:59,484 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 27 states. [2018-10-24 12:06:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:02,346 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-10-24 12:06:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:06:02,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-10-24 12:06:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:02,350 INFO L225 Difference]: With dead ends: 124 [2018-10-24 12:06:02,351 INFO L226 Difference]: Without dead ends: 83 [2018-10-24 12:06:02,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2018-10-24 12:06:02,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-24 12:06:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-10-24 12:06:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-24 12:06:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-24 12:06:02,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 48 [2018-10-24 12:06:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:02,371 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-24 12:06:02,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:06:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-24 12:06:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-24 12:06:02,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:02,373 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:06:02,373 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:02,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2053536857, now seen corresponding path program 8 times [2018-10-24 12:06:02,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:02,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:02,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:02,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:06:02,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:02,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:02,937 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:06:02,938 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:02,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:02,938 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:02,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:06:02,950 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:06:03,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 12:06:03,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:06:03,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:03,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:06:03,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:03,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:03,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:06:03,903 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-24 12:06:04,564 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:06:04,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:04,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:06:04,581 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 16 treesize of output 15 [2018-10-24 12:06:04,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:04,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:04,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:04,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-24 12:06:05,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-24 12:06:05,255 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:05,256 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:06:05,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:05,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:05,270 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:06:05,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:05,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:05,288 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:06:05,288 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-24 12:06:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:06:05,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:05,818 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-10-24 12:06:05,830 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 45 treesize of output 47 [2018-10-24 12:06:05,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 33 [2018-10-24 12:06:05,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:06,005 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 39 treesize of output 38 [2018-10-24 12:06:06,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:06,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:06,098 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 44 treesize of output 46 [2018-10-24 12:06:06,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 31 [2018-10-24 12:06:06,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:06,268 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 36 treesize of output 35 [2018-10-24 12:06:06,269 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:06,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:06,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:06:06,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-24 12:06:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:06:07,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 22] total 50 [2018-10-24 12:06:07,470 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:07,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-24 12:06:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-24 12:06:07,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2018-10-24 12:06:07,473 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 31 states. [2018-10-24 12:06:09,673 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-10-24 12:06:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:06:10,239 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-10-24 12:06:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 12:06:10,242 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-10-24 12:06:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:06:10,243 INFO L225 Difference]: With dead ends: 103 [2018-10-24 12:06:10,243 INFO L226 Difference]: Without dead ends: 77 [2018-10-24 12:06:10,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=652, Invalid=3638, Unknown=0, NotChecked=0, Total=4290 [2018-10-24 12:06:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-24 12:06:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-10-24 12:06:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:06:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-24 12:06:10,262 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-10-24 12:06:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:06:10,262 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-24 12:06:10,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-24 12:06:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-24 12:06:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 12:06:10,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:06:10,264 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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:06:10,264 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:06:10,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash 824594169, now seen corresponding path program 1 times [2018-10-24 12:06:10,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:06:10,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:10,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:06:10,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:06:10,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:06:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:10,845 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 12:06:11,242 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-24 12:06:12,030 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-10-24 12:06:12,272 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-10-24 12:06:12,929 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2018-10-24 12:06:13,112 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-10-24 12:06:13,283 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-24 12:06:13,462 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-10-24 12:06:13,715 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-10-24 12:06:14,039 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2018-10-24 12:06:14,582 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2018-10-24 12:06:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:06:15,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:15,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:06:15,222 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-24 12:06:15,223 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-24 12:06:15,226 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:06:15,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:06:15,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:06:21,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:06:21,639 INFO L272 AbstractInterpreter]: Visited 27 different actions 882 times. Merged at 14 different actions 463 times. Widened at 4 different actions 90 times. Found 45 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-24 12:06:21,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:06:21,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:06:21,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:06:21,676 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:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:06:21,689 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:06:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:06:21,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:06:21,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:06:21,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:21,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:21,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-24 12:06:22,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:06:22,822 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 16 treesize of output 15 [2018-10-24 12:06:22,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:22,839 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,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 43 [2018-10-24 12:06:22,853 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 16 treesize of output 15 [2018-10-24 12:06:22,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:22,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:22,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:22,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:93, output treesize:85 [2018-10-24 12:06:23,157 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:06:23,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:23,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 29 [2018-10-24 12:06:23,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:23,192 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 25 treesize of output 34 [2018-10-24 12:06:23,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:23,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:23,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:23,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:43 [2018-10-24 12:06:26,366 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (main_~max~0 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= .cse0 4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ .cse0 (- 3))) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (<= 4 .cse0)))) is different from true [2018-10-24 12:06:30,470 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-24 12:06:33,591 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 12:06:34,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 37 [2018-10-24 12:06:34,386 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:34,387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-24 12:06:34,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:34,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:34,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:06:34,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:34,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:34,417 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:06:34,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2018-10-24 12:06:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 1 not checked. [2018-10-24 12:06:36,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:06:37,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-24 12:06:37,901 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-24 12:06:37,998 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:37,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,007 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-24 12:06:38,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,018 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 35 treesize of output 31 [2018-10-24 12:06:38,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,022 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,023 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,036 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 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 12:06:38,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,040 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,042 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,046 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,050 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 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-24 12:06:38,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,069 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 40 treesize of output 59 [2018-10-24 12:06:38,070 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-24 12:06:38,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,075 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,083 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 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-24 12:06:38,084 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:38,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:38,165 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 105 treesize of output 99 [2018-10-24 12:06:38,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,175 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 0 case distinctions, treesize of input 91 treesize of output 84 [2018-10-24 12:06:38,319 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-10-24 12:06:38,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,335 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 35 treesize of output 31 [2018-10-24 12:06:38,336 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,342 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 0 case distinctions, treesize of input 43 treesize of output 46 [2018-10-24 12:06:38,344 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,357 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-10-24 12:06:38,358 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,363 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,364 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,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, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2018-10-24 12:06:38,378 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,381 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,382 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,387 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 0 case distinctions, treesize of input 41 treesize of output 60 [2018-10-24 12:06:38,388 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:38,397 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 0 case distinctions, treesize of input 53 treesize of output 63 [2018-10-24 12:06:38,398 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,471 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,518 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-24 12:06:38,530 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 31 treesize of output 35 [2018-10-24 12:06:38,560 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-10-24 12:06:38,560 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,593 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,610 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:38,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 27 [2018-10-24 12:06:38,612 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,681 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:38,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2018-10-24 12:06:38,717 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,814 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:06:38,954 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-24 12:06:38,959 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-24 12:06:39,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 59 [2018-10-24 12:06:39,072 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-10-24 12:06:39,076 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,077 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,083 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 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-24 12:06:39,084 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,090 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,096 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 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-24 12:06:39,097 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,120 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-24 12:06:39,121 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,131 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 35 treesize of output 31 [2018-10-24 12:06:39,132 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:06:39,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,145 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 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-24 12:06:39,146 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,188 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:39,213 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:39,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-24 12:06:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:06:39,224 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 31 treesize of output 32 [2018-10-24 12:06:39,226 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:06:39,246 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 23 treesize of output 27 [2018-10-24 12:06:39,282 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-24 12:06:39,283 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,286 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-24 12:06:39,286 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-24 12:06:39,301 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:39,331 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:06:39,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-24 12:06:39,457 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:147, output treesize:192 [2018-10-24 12:06:39,735 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-24 12:06:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:06:40,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:06:40,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 22] total 63 [2018-10-24 12:06:40,849 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:06:40,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-24 12:06:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-24 12:06:40,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3340, Unknown=4, NotChecked=120, Total=3906 [2018-10-24 12:06:40,853 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2018-10-24 12:06:43,631 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 36 [2018-10-24 12:06:43,936 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 29 [2018-10-24 12:06:44,205 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2018-10-24 12:06:48,758 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-24 12:06:49,074 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 32 [2018-10-24 12:06:49,587 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 40 [2018-10-24 12:06:49,889 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 43 [2018-10-24 12:07:16,537 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 39 [2018-10-24 12:07:28,200 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2018-10-24 12:07:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:07:28,644 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-10-24 12:07:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-24 12:07:28,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2018-10-24 12:07:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:07:28,646 INFO L225 Difference]: With dead ends: 89 [2018-10-24 12:07:28,646 INFO L226 Difference]: Without dead ends: 87 [2018-10-24 12:07:28,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=1057, Invalid=6771, Unknown=8, NotChecked=174, Total=8010 [2018-10-24 12:07:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-24 12:07:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-10-24 12:07:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-24 12:07:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-24 12:07:28,662 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 57 [2018-10-24 12:07:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:07:28,662 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-24 12:07:28,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-24 12:07:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-24 12:07:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 12:07:28,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:07:28,664 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:07:28,664 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:07:28,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:07:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -925373209, now seen corresponding path program 2 times [2018-10-24 12:07:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:07:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:07:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:07:28,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:07:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:07:29,064 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 12:07:29,250 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-24 12:07:29,867 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2018-10-24 12:07:30,087 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2018-10-24 12:07:30,230 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2018-10-24 12:07:30,379 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-24 12:07:30,584 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-10-24 12:07:30,785 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-24 12:07:30,949 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2018-10-24 12:07:31,111 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2018-10-24 12:07:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:07:32,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:32,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:07:32,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:07:32,098 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:32,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:07:32,098 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:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:07:32,106 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:07:32,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:07:32,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:07:32,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:07:32,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:07:32,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-10-24 12:07:32,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 21 [2018-10-24 12:07:32,862 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 16 treesize of output 15 [2018-10-24 12:07:32,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,869 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,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:32,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-10-24 12:07:33,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 29 [2018-10-24 12:07:33,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:33,081 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 25 treesize of output 34 [2018-10-24 12:07:33,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:33,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:33,120 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:33,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-24 12:07:33,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 29 [2018-10-24 12:07:33,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:33,319 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 25 treesize of output 34 [2018-10-24 12:07:33,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:33,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:33,356 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:33,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-10-24 12:07:41,180 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|))))) is different from true [2018-10-24 12:07:43,625 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_4| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_4|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_4|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_4| |v_main_~#str1~0.base_BEFORE_CALL_4|))))) is different from true [2018-10-24 12:07:47,727 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-24 12:07:52,106 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-24 12:07:52,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 30 [2018-10-24 12:07:52,542 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:52,543 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-24 12:07:52,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:52,575 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:52,576 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:07:52,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:52,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:07:52,599 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:07:52,599 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:3 [2018-10-24 12:07:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2018-10-24 12:07:54,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:07:57,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-24 12:07:57,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:57,197 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 38 [2018-10-24 12:07:57,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-24 12:07:57,219 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 29 treesize of output 33 [2018-10-24 12:07:57,225 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,228 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 33 treesize of output 44 [2018-10-24 12:07:57,260 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,273 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2018-10-24 12:07:57,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:57,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,279 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-10-24 12:07:57,280 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:57,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:07:57,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:07:57,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:07:57,595 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 123 treesize of output 117 [2018-10-24 12:07:57,599 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 112 treesize of output 97 [2018-10-24 12:07:57,602 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,604 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 81 treesize of output 80 [2018-10-24 12:07:57,726 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-10-24 12:07:57,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,744 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,765 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 68 treesize of output 111 [2018-10-24 12:07:57,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 6 xjuncts. [2018-10-24 12:07:57,773 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,778 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,785 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,808 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 108 [2018-10-24 12:07:57,811 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 6 xjuncts. [2018-10-24 12:07:57,814 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,819 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,826 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,847 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 109 [2018-10-24 12:07:57,849 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 6 xjuncts. [2018-10-24 12:07:57,852 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,865 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,887 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 105 [2018-10-24 12:07:57,889 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 6 xjuncts. [2018-10-24 12:07:57,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,914 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 44 treesize of output 56 [2018-10-24 12:07:57,915 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:57,918 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:57,932 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 71 [2018-10-24 12:07:57,933 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:58,108 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-24 12:07:58,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:07:58,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,419 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 0 case distinctions, treesize of input 109 treesize of output 102 [2018-10-24 12:07:58,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,445 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 90 [2018-10-24 12:07:58,680 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-24 12:07:58,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,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, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-10-24 12:07:58,692 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,695 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,700 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 0 case distinctions, treesize of input 72 treesize of output 70 [2018-10-24 12:07:58,700 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,725 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-10-24 12:07:58,728 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,736 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 0 case distinctions, treesize of input 65 treesize of output 72 [2018-10-24 12:07:58,736 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,739 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:07:58,739 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,748 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-10-24 12:07:58,748 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:58,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,911 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 2 case distinctions, treesize of input 52 treesize of output 85 [2018-10-24 12:07:58,913 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 3 xjuncts. [2018-10-24 12:07:58,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:58,921 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,937 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-24 12:07:58,938 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:58,974 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,980 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:58,994 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 1 case distinctions, treesize of input 56 treesize of output 82 [2018-10-24 12:07:58,995 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:59,081 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:07:59,147 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:07:59,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:07:59,351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-24 12:07:59,357 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-24 12:07:59,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,384 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-24 12:07:59,568 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-24 12:07:59,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,575 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 0 case distinctions, treesize of input 49 treesize of output 49 [2018-10-24 12:07:59,576 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,580 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-10-24 12:07:59,580 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,584 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-24 12:07:59,585 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-24 12:07:59,591 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,593 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:07:59,594 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,600 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-10-24 12:07:59,600 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-24 12:07:59,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,706 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,711 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,734 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 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-24 12:07:59,736 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 3 xjuncts. [2018-10-24 12:07:59,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,742 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,768 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 49 treesize of output 93 [2018-10-24 12:07:59,770 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-10-24 12:07:59,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:07:59,778 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:07:59,794 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-24 12:07:59,795 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-10-24 12:07:59,914 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-24 12:07:59,973 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:08:00,047 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-24 12:08:00,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-24 12:08:00,270 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-24 12:08:00,277 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,294 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-24 12:08:00,470 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-24 12:08:00,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,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, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-24 12:08:00,497 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:00,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,504 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,509 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,532 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 3 case distinctions, treesize of input 62 treesize of output 90 [2018-10-24 12:08:00,534 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-10-24 12:08:00,538 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,545 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,546 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,571 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 3 case distinctions, treesize of input 50 treesize of output 87 [2018-10-24 12:08:00,572 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 3 xjuncts. [2018-10-24 12:08:00,576 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,579 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,635 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 3 case distinctions, treesize of input 59 treesize of output 91 [2018-10-24 12:08:00,637 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-10-24 12:08:00,641 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,643 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,674 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-24 12:08:00,675 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-10-24 12:08:00,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,683 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,708 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 49 treesize of output 93 [2018-10-24 12:08:00,710 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 4 xjuncts. [2018-10-24 12:08:00,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:00,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:00,874 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 0 case distinctions, treesize of input 44 treesize of output 44 [2018-10-24 12:08:00,874 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:00,930 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:00,983 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:01,052 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:01,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-24 12:08:01,061 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 37 treesize of output 41 [2018-10-24 12:08:01,064 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,066 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 41 treesize of output 52 [2018-10-24 12:08:01,100 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,102 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-10-24 12:08:01,102 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:08:01,118 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 53 [2018-10-24 12:08:01,120 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-10-24 12:08:01,179 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-24 12:08:01,220 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-24 12:08:01,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 25 [2018-10-24 12:08:01,268 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 29 [2018-10-24 12:08:01,272 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,300 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:01,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-10-24 12:08:01,554 INFO L202 ElimStorePlain]: Needed 56 recursive calls to eliminate 6 variables, input treesize:171, output treesize:457 [2018-10-24 12:08:02,051 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-24 12:08:02,554 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-10-24 12:08:02,889 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-24 12:08:03,189 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-24 12:08:03,492 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-24 12:08:03,869 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-10-24 12:08:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-24 12:08:03,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:08:03,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 23] total 68 [2018-10-24 12:08:03,943 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:08:03,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-24 12:08:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-24 12:08:03,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=3908, Unknown=9, NotChecked=258, Total=4556 [2018-10-24 12:08:03,946 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 50 states. [2018-10-24 12:08:05,412 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-10-24 12:08:05,764 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-10-24 12:08:07,306 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-24 12:08:13,836 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-24 12:08:15,481 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-10-24 12:08:16,308 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2018-10-24 12:08:22,469 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-24 12:08:26,621 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-10-24 12:08:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:08:41,064 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-24 12:08:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-24 12:08:41,068 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-10-24 12:08:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:08:41,069 INFO L225 Difference]: With dead ends: 93 [2018-10-24 12:08:41,069 INFO L226 Difference]: Without dead ends: 91 [2018-10-24 12:08:41,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=933, Invalid=7806, Unknown=11, NotChecked=370, Total=9120 [2018-10-24 12:08:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-24 12:08:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-10-24 12:08:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-24 12:08:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-24 12:08:41,086 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 66 [2018-10-24 12:08:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:08:41,087 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-24 12:08:41,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-24 12:08:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-24 12:08:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-24 12:08:41,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:08:41,088 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:08:41,088 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:08:41,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:08:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1861098169, now seen corresponding path program 3 times [2018-10-24 12:08:41,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:08:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:41,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:08:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:08:41,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:08:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:08:41,418 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 12:08:41,766 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-24 12:08:41,892 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2018-10-24 12:08:42,041 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2018-10-24 12:08:42,228 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-10-24 12:08:42,452 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-24 12:08:42,638 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-24 12:08:42,818 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-10-24 12:08:43,004 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2018-10-24 12:08:43,502 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-10-24 12:08:43,655 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-10-24 12:08:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:08:44,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:44,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:08:44,247 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:08:44,247 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:44,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:08:44,247 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:08:44,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:08:44,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:08:44,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:08:44,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:08:44,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:08:44,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-24 12:08:44,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-24 12:08:44,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 49 treesize of output 46 [2018-10-24 12:08:44,794 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 16 treesize of output 15 [2018-10-24 12:08:44,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 49 treesize of output 46 [2018-10-24 12:08:44,821 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 16 treesize of output 15 [2018-10-24 12:08:44,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:44,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:08:44,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2018-10-24 12:08:45,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 66 treesize of output 61 [2018-10-24 12:08:45,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,132 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 30 [2018-10-24 12:08:45,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,156 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,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 66 treesize of output 61 [2018-10-24 12:08:45,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,229 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 30 [2018-10-24 12:08:45,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:08:45,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:133, output treesize:97 [2018-10-24 12:08:45,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 54 [2018-10-24 12:08:45,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,589 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 25 treesize of output 34 [2018-10-24 12:08:45,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,612 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,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 59 treesize of output 54 [2018-10-24 12:08:45,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:45,680 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 25 treesize of output 34 [2018-10-24 12:08:45,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:08:45,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-24 12:08:45,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:93 [2018-10-24 12:08:46,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 57 [2018-10-24 12:08:46,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-24 12:08:46,046 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 30 [2018-10-24 12:08:46,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,071 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,089 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-24 12:08:46,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:08:46,146 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:08:46,146 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:46 [2018-10-24 12:09:31,151 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-24 12:09:31,543 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-24 12:09:33,885 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_8| Int) (main_~max~0 Int) (|v_main_~#str2~0.base_BEFORE_CALL_8| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_8|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_8|) (+ .cse0 (- 1)))) (<= .cse0 2147483647) (< .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_8| |v_main_~#str1~0.base_BEFORE_CALL_8|)) (<= 4 .cse0)))) is different from true [2018-10-24 12:09:36,232 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_9| Int) (main_~max~0 Int) (|v_main_~#str2~0.base_BEFORE_CALL_9| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_9|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_9|) (+ .cse0 (- 1)))) (<= .cse0 2147483647) (< .cse0 5) (not (= |v_main_~#str2~0.base_BEFORE_CALL_9| |v_main_~#str1~0.base_BEFORE_CALL_9|)) (<= 4 .cse0)))) is different from true [2018-10-24 12:09:36,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 34 [2018-10-24 12:09:36,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:09:36,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:09:36,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:09:36,599 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:09:36,600 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:09:36,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:09:36,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:09:36,616 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:09:36,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:3 [2018-10-24 12:09:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 7 trivial. 16 not checked. [2018-10-24 12:09:37,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-10-24 12:09:42,991 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:09:43,192 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:09:43,192 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:09:43,198 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:09:43,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:09:43 BoogieIcfgContainer [2018-10-24 12:09:43,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:09:43,199 INFO L168 Benchmark]: Toolchain (without parser) took 258792.42 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:43,199 INFO L168 Benchmark]: CDTParser took 0.19 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:09:43,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.11 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:09:43,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.17 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:09:43,200 INFO L168 Benchmark]: Boogie Preprocessor took 36.92 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:09:43,200 INFO L168 Benchmark]: RCFGBuilder took 633.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-24 12:09:43,200 INFO L168 Benchmark]: TraceAbstraction took 257767.50 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 96.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-24 12:09:43,202 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.19 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. * CACSL2BoogieTranslator took 301.11 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 48.17 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 36.92 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 633.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257767.50 ms. Allocated memory was 2.3 GB in the beginning and 3.3 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 96.6 MB). Peak memory consumption was 1.2 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 76 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 257.6s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 98.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 374 SDtfs, 621 SDslu, 3853 SDs, 0 SdLazy, 6346 SolverSat, 534 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1119 GetRequests, 611 SyntacticMatches, 22 SemanticMatches, 486 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7048 ImplicationChecksByTransitivity, 119.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.1s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9733333333333333 AbsIntWeakeningRatio, 2.15 AbsIntAvgWeakeningVarsNumRemoved, 20.85 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 140 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 83.7s InterpolantComputationTime, 907 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1300 ConstructedInterpolants, 56 QuantifiedInterpolants, 1611151 SizeOfPredicates, 259 NumberOfNonLiveVariables, 2457 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 701/1664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown