java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:42:18,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:42:18,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:42:18,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:42:18,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:42:18,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:42:18,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:42:18,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:42:18,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:42:18,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:42:18,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:42:18,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:42:18,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:42:18,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:42:18,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:42:18,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:42:18,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:42:18,724 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:42:18,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:42:18,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:42:18,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:42:18,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:42:18,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:42:18,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:42:18,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:42:18,734 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:42:18,735 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:42:18,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:42:18,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:42:18,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:42:18,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:42:18,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:42:18,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:42:18,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:42:18,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:42:18,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:42:18,741 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:42:18,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:42:18,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:42:18,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:42:18,763 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:42:18,763 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:42:18,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:42:18,763 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:42:18,763 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:42:18,764 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:42:18,764 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:42:18,764 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:42:18,764 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:42:18,764 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:42:18,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:42:18,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:42:18,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:42:18,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:42:18,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:42:18,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:42:18,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:42:18,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:42:18,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:42:18,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:42:18,767 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:42:18,767 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:42:18,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:42:18,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:42:18,768 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:42:18,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:42:18,768 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:42:18,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:42:18,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:42:18,769 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:42:18,769 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:42:18,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:42:18,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:42:18,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:42:18,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:42:18,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:42:18,826 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:42:18,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i [2018-11-12 20:42:18,886 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c8666c2/db8922a4078f487282a2cdf78d607372/FLAG8edf419ed [2018-11-12 20:42:19,344 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:42:19,344 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i [2018-11-12 20:42:19,351 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c8666c2/db8922a4078f487282a2cdf78d607372/FLAG8edf419ed [2018-11-12 20:42:19,368 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c8666c2/db8922a4078f487282a2cdf78d607372 [2018-11-12 20:42:19,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:42:19,384 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:42:19,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:42:19,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:42:19,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:42:19,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f34b7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19, skipping insertion in model container [2018-11-12 20:42:19,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:42:19,430 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:42:19,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:42:19,682 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:42:19,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:42:19,729 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:42:19,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19 WrapperNode [2018-11-12 20:42:19,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:42:19,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:42:19,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:42:19,731 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:42:19,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:42:19,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:42:19,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:42:19,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:42:19,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... [2018-11-12 20:42:19,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:42:19,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:42:19,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:42:19,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:42:19,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-11-12 20:42:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:42:19,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:42:19,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:42:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:42:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:42:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:42:19,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:42:19,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:42:20,278 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:42:20,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:42:20 BoogieIcfgContainer [2018-11-12 20:42:20,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:42:20,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:42:20,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:42:20,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:42:20,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:42:19" (1/3) ... [2018-11-12 20:42:20,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329b175b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:42:20, skipping insertion in model container [2018-11-12 20:42:20,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:42:19" (2/3) ... [2018-11-12 20:42:20,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329b175b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:42:20, skipping insertion in model container [2018-11-12 20:42:20,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:42:20" (3/3) ... [2018-11-12 20:42:20,288 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2018-11-12 20:42:20,298 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:42:20,306 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:42:20,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:42:20,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:42:20,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:42:20,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:42:20,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:42:20,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:42:20,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:42:20,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:42:20,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:42:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-12 20:42:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:42:20,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,387 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -702630595, now seen corresponding path program 1 times [2018-11-12 20:42:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:42:20,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:20,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:42:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:42:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:42:20,548 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-12 20:42:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:20,570 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-12 20:42:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:42:20,571 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-12 20:42:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:20,581 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:42:20,581 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:42:20,585 INFO L604 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-11-12 20:42:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:42:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:42:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:42:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-12 20:42:20,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-11-12 20:42:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:20,625 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-12 20:42:20,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:42:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-12 20:42:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:42:20,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash -972126638, now seen corresponding path program 1 times [2018-11-12 20:42:20,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:20,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:20,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:42:20,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:42:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:42:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:42:20,723 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-11-12 20:42:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:20,814 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-12 20:42:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:42:20,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-12 20:42:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:20,816 INFO L225 Difference]: With dead ends: 29 [2018-11-12 20:42:20,817 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:42:20,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:42:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:42:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-12 20:42:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:42:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-12 20:42:20,825 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-12 20:42:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:20,825 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-12 20:42:20,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:42:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-12 20:42:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:42:20,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:20,827 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:20,827 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:20,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1998515670, now seen corresponding path program 1 times [2018-11-12 20:42:20,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:20,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:20,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:20,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:42:20,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:20,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:42:20,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:42:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:42:20,898 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-11-12 20:42:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:21,002 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-12 20:42:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:42:21,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-12 20:42:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:21,003 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:42:21,003 INFO L226 Difference]: Without dead ends: 23 [2018-11-12 20:42:21,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:42:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-12 20:42:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-12 20:42:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-12 20:42:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-12 20:42:21,010 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-11-12 20:42:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:21,011 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-12 20:42:21,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:42:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-12 20:42:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:42:21,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:21,012 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:21,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:21,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1293803971, now seen corresponding path program 1 times [2018-11-12 20:42:21,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:21,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:21,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:21,161 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-12 20:42:21,163 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [21], [25], [28], [30], [32], [36], [43], [46], [48], [54], [55], [56], [58] [2018-11-12 20:42:21,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:42:21,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:42:21,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:42:21,587 INFO L272 AbstractInterpreter]: Visited 19 different actions 111 times. Merged at 8 different actions 61 times. Widened at 3 different actions 11 times. Performed 328 root evaluator evaluations with a maximum evaluation depth of 3. Performed 328 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 3 different actions. Largest state had 10 variables. [2018-11-12 20:42:21,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:21,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:42:21,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:21,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:21,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:21,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:21,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:22,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:22,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-12 20:42:22,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:22,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:42:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:42:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:42:22,074 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-11-12 20:42:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:22,149 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-12 20:42:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:42:22,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-12 20:42:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:22,153 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:42:22,153 INFO L226 Difference]: Without dead ends: 26 [2018-11-12 20:42:22,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:42:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-12 20:42:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-12 20:42:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-12 20:42:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-12 20:42:22,166 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-12 20:42:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:22,167 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-12 20:42:22,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:42:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-12 20:42:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:42:22,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:22,169 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:22,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:22,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1379909750, now seen corresponding path program 2 times [2018-11-12 20:42:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:22,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:42:22,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:22,297 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:22,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:22,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:22,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:22,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:42:22,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:22,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:42:22,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:42:22,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-11-12 20:42:22,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:22,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:42:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:42:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:42:22,681 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-11-12 20:42:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:23,379 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-12 20:42:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:42:23,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-12 20:42:23,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:23,382 INFO L225 Difference]: With dead ends: 73 [2018-11-12 20:42:23,382 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:42:23,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:42:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-12 20:42:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-12 20:42:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-12 20:42:23,393 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2018-11-12 20:42:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:23,393 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-12 20:42:23,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:42:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-12 20:42:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:42:23,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:23,395 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:23,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:23,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1699386968, now seen corresponding path program 3 times [2018-11-12 20:42:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:42:23,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:23,529 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:23,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:23,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:23,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:23,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:23,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:23,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:23,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:42:23,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:42:23,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:23,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-12 20:42:23,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:23,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:42:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:42:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:42:23,889 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-11-12 20:42:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:23,961 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-12 20:42:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:42:23,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-12 20:42:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:23,963 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:42:23,963 INFO L226 Difference]: Without dead ends: 50 [2018-11-12 20:42:23,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:42:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-12 20:42:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-12 20:42:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:42:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-12 20:42:23,973 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-11-12 20:42:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-12 20:42:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:42:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-12 20:42:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:42:23,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:23,975 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:23,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1734727982, now seen corresponding path program 4 times [2018-11-12 20:42:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:23,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 20:42:24,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:24,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:24,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:24,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:24,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:24,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:24,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:24,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 20:42:24,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 20:42:24,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:24,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-12 20:42:24,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:24,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:42:24,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:42:24,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:24,377 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-11-12 20:42:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:24,449 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-12 20:42:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:42:24,450 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-12 20:42:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:24,451 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:42:24,451 INFO L226 Difference]: Without dead ends: 56 [2018-11-12 20:42:24,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-12 20:42:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-12 20:42:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-12 20:42:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-12 20:42:24,461 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-11-12 20:42:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:24,462 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-12 20:42:24,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:42:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-12 20:42:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:42:24,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:24,464 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:24,464 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:24,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2050902056, now seen corresponding path program 5 times [2018-11-12 20:42:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:24,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:42:24,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:24,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:24,604 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:24,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:24,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:24,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:24,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:24,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:42:24,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:24,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-12 20:42:24,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-12 20:42:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:24,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-11-12 20:42:24,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:24,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:42:24,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:42:24,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:42:24,826 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 13 states. [2018-11-12 20:42:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:26,017 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-11-12 20:42:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:42:26,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-12 20:42:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:26,020 INFO L225 Difference]: With dead ends: 136 [2018-11-12 20:42:26,021 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:42:26,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=649, Invalid=1331, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:42:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:42:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2018-11-12 20:42:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-12 20:42:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-11-12 20:42:26,038 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 53 [2018-11-12 20:42:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:26,039 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-11-12 20:42:26,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:42:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-12 20:42:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-12 20:42:26,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:26,042 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:26,043 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:26,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:26,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1138844106, now seen corresponding path program 6 times [2018-11-12 20:42:26,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:26,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:26,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-12 20:42:26,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:26,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:26,392 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:26,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:26,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:26,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:26,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:26,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:26,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:26,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:26,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-12 20:42:26,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-12 20:42:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:27,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-11-12 20:42:27,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:27,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:42:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:42:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:27,054 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 17 states. [2018-11-12 20:42:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:27,125 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-11-12 20:42:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:42:27,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-11-12 20:42:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:27,126 INFO L225 Difference]: With dead ends: 149 [2018-11-12 20:42:27,126 INFO L226 Difference]: Without dead ends: 95 [2018-11-12 20:42:27,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-12 20:42:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-12 20:42:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:42:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-11-12 20:42:27,140 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2018-11-12 20:42:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:27,140 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-11-12 20:42:27,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:42:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-12 20:42:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-12 20:42:27,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:27,142 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:27,142 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:27,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2009672909, now seen corresponding path program 7 times [2018-11-12 20:42:27,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:27,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:27,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:27,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-12 20:42:27,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:27,272 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:27,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:27,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:27,272 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:27,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:27,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:27,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-12 20:42:27,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-12 20:42:27,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:27,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-11-12 20:42:27,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:27,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:27,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:27,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:42:27,916 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 19 states. [2018-11-12 20:42:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:28,143 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-11-12 20:42:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:42:28,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-11-12 20:42:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:28,145 INFO L225 Difference]: With dead ends: 164 [2018-11-12 20:42:28,145 INFO L226 Difference]: Without dead ends: 104 [2018-11-12 20:42:28,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:42:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-12 20:42:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-12 20:42:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-12 20:42:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-11-12 20:42:28,162 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 91 [2018-11-12 20:42:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:28,162 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-11-12 20:42:28,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-11-12 20:42:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-12 20:42:28,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:28,164 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:28,165 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:28,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1289095638, now seen corresponding path program 8 times [2018-11-12 20:42:28,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:28,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:28,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 458 proven. 100 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-12 20:42:28,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:28,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:28,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:28,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:28,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:28,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:28,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:28,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:28,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:42:28,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:28,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 460 proven. 100 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-12 20:42:28,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-11-12 20:42:30,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:30,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-12 20:42:30,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:30,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:42:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:42:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:30,613 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 21 states. [2018-11-12 20:42:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:31,146 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-11-12 20:42:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:42:31,147 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-11-12 20:42:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:31,148 INFO L225 Difference]: With dead ends: 179 [2018-11-12 20:42:31,148 INFO L226 Difference]: Without dead ends: 113 [2018-11-12 20:42:31,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-12 20:42:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-11-12 20:42:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-12 20:42:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-11-12 20:42:31,162 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 100 [2018-11-12 20:42:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:31,162 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-11-12 20:42:31,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:42:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-12 20:42:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:42:31,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:31,165 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 27, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:31,165 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:31,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -340366701, now seen corresponding path program 9 times [2018-11-12 20:42:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:31,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:31,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:31,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-12 20:42:31,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:31,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:31,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:31,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:31,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:31,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:31,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:31,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:31,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:31,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-12 20:42:31,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-11-12 20:42:32,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:32,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-11-12 20:42:32,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:32,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:42:32,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:42:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:32,202 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 23 states. [2018-11-12 20:42:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:32,473 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-11-12 20:42:32,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:42:32,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2018-11-12 20:42:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:32,474 INFO L225 Difference]: With dead ends: 194 [2018-11-12 20:42:32,474 INFO L226 Difference]: Without dead ends: 122 [2018-11-12 20:42:32,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-12 20:42:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-11-12 20:42:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:42:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-11-12 20:42:32,489 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 109 [2018-11-12 20:42:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:32,489 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-11-12 20:42:32,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:42:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-11-12 20:42:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 20:42:32,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:32,492 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 30, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:32,492 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:32,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2030161270, now seen corresponding path program 10 times [2018-11-12 20:42:32,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:32,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:32,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-12 20:42:32,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:32,659 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:32,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:32,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:32,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-12 20:42:32,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-12 20:42:32,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-12 20:42:32,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:32,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:42:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:42:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:42:32,989 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-11-12 20:42:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:33,135 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-11-12 20:42:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:42:33,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-11-12 20:42:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:33,138 INFO L225 Difference]: With dead ends: 192 [2018-11-12 20:42:33,138 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:42:33,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:42:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:42:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-11-12 20:42:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:42:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-11-12 20:42:33,162 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 118 [2018-11-12 20:42:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:33,163 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-11-12 20:42:33,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:42:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-12 20:42:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-12 20:42:33,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:33,166 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 40, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:33,166 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:33,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash -969563822, now seen corresponding path program 11 times [2018-11-12 20:42:33,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:33,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:33,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-12 20:42:33,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:33,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:33,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:33,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:33,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:33,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 20:42:33,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:33,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:33,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-12 20:42:33,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:33,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-12 20:42:33,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-11-12 20:42:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-12 20:42:34,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:34,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:42:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:42:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:34,067 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 13 states. [2018-11-12 20:42:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:34,201 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-11-12 20:42:34,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:42:34,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-11-12 20:42:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:34,202 INFO L225 Difference]: With dead ends: 227 [2018-11-12 20:42:34,203 INFO L226 Difference]: Without dead ends: 222 [2018-11-12 20:42:34,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:42:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-12 20:42:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-11-12 20:42:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-12 20:42:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-11-12 20:42:34,220 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 153 [2018-11-12 20:42:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:34,221 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-11-12 20:42:34,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:42:34,221 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-11-12 20:42:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-12 20:42:34,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:34,223 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:34,224 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:34,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1779605514, now seen corresponding path program 12 times [2018-11-12 20:42:34,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:34,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:34,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:34,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:34,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-12 20:42:34,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:34,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:34,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:34,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:34,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:34,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:34,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:34,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:34,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:34,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:34,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-12 20:42:34,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-11-12 20:42:35,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:35,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-11-12 20:42:35,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:42:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:42:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:42:35,775 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 15 states. [2018-11-12 20:42:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:36,053 INFO L93 Difference]: Finished difference Result 262 states and 269 transitions. [2018-11-12 20:42:36,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:42:36,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2018-11-12 20:42:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:36,055 INFO L225 Difference]: With dead ends: 262 [2018-11-12 20:42:36,055 INFO L226 Difference]: Without dead ends: 257 [2018-11-12 20:42:36,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:42:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-12 20:42:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2018-11-12 20:42:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-12 20:42:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-11-12 20:42:36,081 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 188 [2018-11-12 20:42:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:36,082 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-11-12 20:42:36,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:42:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-11-12 20:42:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-12 20:42:36,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:36,085 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 60, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:36,086 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 388824786, now seen corresponding path program 13 times [2018-11-12 20:42:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:36,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-12 20:42:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:37,078 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:37,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:37,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:37,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:37,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-12 20:42:37,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-11-12 20:42:37,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:37,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-11-12 20:42:37,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:42:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:42:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:37,663 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 17 states. [2018-11-12 20:42:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:37,886 INFO L93 Difference]: Finished difference Result 297 states and 305 transitions. [2018-11-12 20:42:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:42:37,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 223 [2018-11-12 20:42:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:37,888 INFO L225 Difference]: With dead ends: 297 [2018-11-12 20:42:37,888 INFO L226 Difference]: Without dead ends: 292 [2018-11-12 20:42:37,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:42:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-12 20:42:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2018-11-12 20:42:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-12 20:42:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 266 transitions. [2018-11-12 20:42:37,911 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 266 transitions. Word has length 223 [2018-11-12 20:42:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:37,912 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 266 transitions. [2018-11-12 20:42:37,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:42:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 266 transitions. [2018-11-12 20:42:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-12 20:42:37,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:37,916 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 70, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:37,916 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:37,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1062399370, now seen corresponding path program 14 times [2018-11-12 20:42:37,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:37,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:37,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-12 20:42:38,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:38,739 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:38,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:38,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:38,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:38,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-11-12 20:42:38,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:38,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-12 20:42:39,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-12 20:42:39,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:39,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-11-12 20:42:39,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:39,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:42:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:42:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:42:39,631 INFO L87 Difference]: Start difference. First operand 259 states and 266 transitions. Second operand 19 states. [2018-11-12 20:42:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:39,731 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-11-12 20:42:39,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:42:39,731 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2018-11-12 20:42:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:39,734 INFO L225 Difference]: With dead ends: 332 [2018-11-12 20:42:39,734 INFO L226 Difference]: Without dead ends: 327 [2018-11-12 20:42:39,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 500 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:42:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-12 20:42:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 294. [2018-11-12 20:42:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-12 20:42:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 302 transitions. [2018-11-12 20:42:39,762 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 302 transitions. Word has length 258 [2018-11-12 20:42:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:39,762 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 302 transitions. [2018-11-12 20:42:39,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:42:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 302 transitions. [2018-11-12 20:42:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-12 20:42:39,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:39,766 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 80, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:39,766 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:39,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -790873006, now seen corresponding path program 15 times [2018-11-12 20:42:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:39,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:39,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-12 20:42:40,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:40,106 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:40,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:40,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:40,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:40,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:40,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:40,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:40,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:40,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-12 20:42:40,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-11-12 20:42:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:40,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-12 20:42:40,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:42:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:42:40,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:40,829 INFO L87 Difference]: Start difference. First operand 294 states and 302 transitions. Second operand 21 states. [2018-11-12 20:42:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:41,014 INFO L93 Difference]: Finished difference Result 367 states and 377 transitions. [2018-11-12 20:42:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:42:41,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-11-12 20:42:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:41,017 INFO L225 Difference]: With dead ends: 367 [2018-11-12 20:42:41,017 INFO L226 Difference]: Without dead ends: 362 [2018-11-12 20:42:41,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-12 20:42:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 329. [2018-11-12 20:42:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-12 20:42:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 338 transitions. [2018-11-12 20:42:41,056 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 338 transitions. Word has length 293 [2018-11-12 20:42:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:41,057 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 338 transitions. [2018-11-12 20:42:41,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:42:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 338 transitions. [2018-11-12 20:42:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-12 20:42:41,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:41,061 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 90, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:41,062 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:41,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash 547939574, now seen corresponding path program 16 times [2018-11-12 20:42:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:41,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:41,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-12 20:42:41,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:41,441 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:41,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:41,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:41,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:41,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:41,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-12 20:42:41,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-12 20:42:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-11-12 20:42:42,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:42,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:42:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:42:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:42:42,167 INFO L87 Difference]: Start difference. First operand 329 states and 338 transitions. Second operand 23 states. [2018-11-12 20:42:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:42,364 INFO L93 Difference]: Finished difference Result 402 states and 413 transitions. [2018-11-12 20:42:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:42:42,365 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 328 [2018-11-12 20:42:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:42,367 INFO L225 Difference]: With dead ends: 402 [2018-11-12 20:42:42,367 INFO L226 Difference]: Without dead ends: 397 [2018-11-12 20:42:42,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 636 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:42:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-12 20:42:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 364. [2018-11-12 20:42:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-12 20:42:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-11-12 20:42:42,413 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 328 [2018-11-12 20:42:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:42,413 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-11-12 20:42:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:42:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-11-12 20:42:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-12 20:42:42,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:42,416 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 100, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:42,416 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1390107090, now seen corresponding path program 17 times [2018-11-12 20:42:42,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:42,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:42,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:42,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:42,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17095 backedges. 17077 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:42:48,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:42:48,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2018-11-12 20:42:48,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:42:48,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-11-12 20:42:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-11-12 20:42:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2018-11-12 20:42:48,889 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 105 states. [2018-11-12 20:42:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:52,393 INFO L93 Difference]: Finished difference Result 14899 states and 15359 transitions. [2018-11-12 20:42:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-11-12 20:42:52,393 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 363 [2018-11-12 20:42:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:52,394 INFO L225 Difference]: With dead ends: 14899 [2018-11-12 20:42:52,394 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:42:52,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2018-11-12 20:42:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:42:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:42:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:42:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:42:52,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2018-11-12 20:42:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:52,417 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:42:52,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-11-12 20:42:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:42:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:42:52,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:42:54,483 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-11-12 20:42:58,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:00,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:01,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:02,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:03,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:04,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:05,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:05,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:05,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:05,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:05,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:06,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:07,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:08,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:08,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:08,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:08,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:08,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:09,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:09,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:09,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:09,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:10,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:10,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:10,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:11,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:11,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:11,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:11,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:11,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:12,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:13,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:13,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:13,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:13,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:14,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:14,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:15,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:16,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:16,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:17,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:18,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:18,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:19,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:19,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:19,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:20,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:20,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:20,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:20,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:21,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:21,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:21,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:21,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:22,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:22,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:22,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:22,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:23,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:23,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:23,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:24,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:24,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:25,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:25,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:27,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:27,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:27,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:27,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:29,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:29,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:30,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:30,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:30,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:31,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:31,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:31,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:32,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:33,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:34,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:35,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:35,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:35,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:35,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:36,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:37,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:37,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:38,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:39,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:40,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:41,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:42,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:43,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:45,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:45,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:46,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:46,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:46,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:46,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:47,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:48,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:49,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:52,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:58,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:43:59,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:01,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:03,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:03,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:03,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:04,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:04,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:08,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:08,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:44:22,966 WARN L179 SmtUtils]: Spent 1.47 m on a formula simplification. DAG size of input: 5167 DAG size of output: 2220 [2018-11-12 20:44:29,605 WARN L179 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-11-12 20:46:05,684 WARN L179 SmtUtils]: Spent 1.60 m on a formula simplification. DAG size of input: 2199 DAG size of output: 362 [2018-11-12 20:46:05,689 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-12 20:46:05,689 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:46:05,689 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:46:05,690 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:46:05,690 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:46:05,690 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:46:05,690 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2018-11-12 20:46:05,690 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-12 20:46:05,690 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-12 20:46:05,690 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-12 20:46:05,691 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 main_~m~0)) (.cse1 (<= 10 main_~n~0))) (or (and (<= 30 main_~k~0) (<= main_~i~0 3) .cse0 .cse1) (and .cse0 (<= 100 main_~k~0) .cse1) (and .cse0 (<= 40 main_~k~0) (<= main_~i~0 4) .cse1) (and .cse0 (<= 0 main_~k~0) (<= main_~i~0 0) .cse1) (and .cse0 (<= 60 main_~k~0) (<= main_~i~0 6) .cse1) (and .cse0 (<= 10 main_~k~0) (<= main_~i~0 1) .cse1) (and (<= 80 main_~k~0) .cse0 (<= main_~i~0 8) .cse1) (and (<= 50 main_~k~0) .cse0 (<= main_~i~0 5) .cse1) (and .cse0 (<= main_~i~0 9) .cse1 (<= 90 main_~k~0)) (and (<= 70 main_~k~0) .cse0 (<= main_~i~0 7) .cse1) (and .cse0 (<= 20 main_~k~0) (<= main_~i~0 2) .cse1))) [2018-11-12 20:46:05,691 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2018-11-12 20:46:05,691 INFO L421 ceAbstractionStarter]: At program point L17-5(lines 17 21) the Hoare annotation is: (and (<= 10 main_~m~0) (<= 100 main_~k~0) (<= 10 main_~n~0)) [2018-11-12 20:46:05,691 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2018-11-12 20:46:05,691 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 20:46:05,691 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2018-11-12 20:46:05,692 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-12 20:46:05,692 INFO L425 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2018-11-12 20:46:05,693 INFO L421 ceAbstractionStarter]: At program point L18-4(lines 18 20) the Hoare annotation is: (let ((.cse27 (<= main_~j~0 4)) (.cse40 (<= main_~j~0 5)) (.cse37 (<= main_~j~0 2)) (.cse25 (<= main_~j~0 6)) (.cse8 (<= main_~j~0 0)) (.cse31 (<= main_~j~0 1)) (.cse30 (<= main_~j~0 9)) (.cse10 (<= main_~j~0 7)) (.cse15 (<= main_~j~0 8)) (.cse4 (<= 10 main_~n~0)) (.cse3 (<= 10 main_~m~0)) (.cse12 (<= main_~j~0 3))) (let ((.cse36 (<= 10 main_~k~0)) (.cse38 (<= 30 main_~k~0)) (.cse16 (<= main_~i~0 0)) (.cse23 (<= 70 main_~k~0)) (.cse14 (and .cse3 .cse12)) (.cse7 (<= 60 main_~k~0)) (.cse35 (<= 90 main_~k~0)) (.cse32 (<= 20 main_~k~0)) (.cse20 (and .cse15 .cse3 .cse4)) (.cse6 (and .cse3 .cse10 .cse4)) (.cse29 (<= 50 main_~k~0)) (.cse18 (and .cse3 .cse30)) (.cse24 (<= main_~i~0 7)) (.cse0 (and .cse3 .cse31 .cse4)) (.cse39 (<= 80 main_~k~0)) (.cse5 (<= main_~i~0 8)) (.cse34 (and .cse3 .cse8 .cse4)) (.cse11 (<= main_~i~0 3)) (.cse26 (and .cse3 .cse4 .cse25)) (.cse19 (and .cse3 .cse37)) (.cse9 (<= main_~i~0 1)) (.cse28 (<= main_~i~0 2)) (.cse13 (<= main_~i~0 5)) (.cse21 (and .cse40 .cse3)) (.cse1 (<= main_~i~0 6)) (.cse2 (<= (+ main_~i~0 1) main_~n~0)) (.cse17 (and .cse3 .cse27)) (.cse33 (<= 40 main_~k~0)) (.cse22 (<= main_~i~0 4))) (or (and .cse0 .cse1 (<= 61 main_~k~0)) (and (<= 100 main_~k~0) (and .cse2 .cse3 .cse4)) (and .cse5 .cse6 (<= 87 main_~k~0)) (and .cse3 .cse7 .cse8 .cse1 .cse4) (and .cse3 .cse9 (<= 17 main_~k~0) .cse10 .cse4) (and (<= 33 main_~k~0) .cse11 .cse3 .cse12 .cse4) (and (<= 53 main_~k~0) .cse13 .cse14 .cse4) (and .cse13 .cse0 (<= 51 main_~k~0)) (and .cse15 .cse3 (<= 8 main_~k~0) .cse16 .cse4) (and (<= 64 main_~k~0) .cse1 .cse4 .cse17) (and (<= 99 main_~k~0) (and .cse2 .cse18 .cse4)) (and (<= 82 main_~k~0) .cse19 .cse5 .cse4) (and (<= 89 main_~k~0) .cse18 .cse5 .cse4) (and (<= 69 main_~k~0) .cse18 .cse1 .cse4) (and .cse3 .cse12 (<= 3 main_~k~0) .cse16 .cse4) (and .cse20 .cse5 (<= 88 main_~k~0)) (and .cse21 (<= 45 main_~k~0) .cse22 .cse4) (and .cse23 .cse3 .cse8 .cse24 .cse4) (and .cse3 (<= 6 main_~k~0) .cse16 .cse4 .cse25) (and (and .cse2 .cse26) (<= 96 main_~k~0)) (and (<= 63 main_~k~0) .cse14 .cse1 .cse4) (and .cse3 (<= 0 main_~k~0) .cse8 .cse16 .cse4) (and .cse11 .cse3 .cse27 (<= 34 main_~k~0) .cse4) (and .cse15 (<= 28 main_~k~0) .cse3 .cse28 .cse4) (and .cse13 (<= 52 main_~k~0) .cse19 .cse4) (and .cse29 .cse22 .cse3 .cse4) (and .cse3 (<= 9 main_~k~0) .cse30 .cse16 .cse4) (and (<= 21 main_~k~0) .cse3 .cse31 .cse28 .cse4) (and .cse22 .cse26 (<= 46 main_~k~0)) (and .cse11 .cse3 (<= 39 main_~k~0) .cse30 .cse4) (and (<= 67 main_~k~0) .cse6 .cse1) (and .cse22 .cse19 (<= 42 main_~k~0) .cse4) (and .cse3 .cse12 .cse9 (<= 13 main_~k~0) .cse4) (and .cse22 (<= 43 main_~k~0) .cse14 .cse4) (and .cse3 .cse32 .cse9 .cse4) (and (<= 97 main_~k~0) (and .cse2 .cse6)) (and .cse11 (<= 32 main_~k~0) .cse19 .cse4) (and (<= 58 main_~k~0) .cse13 .cse20) (and .cse11 .cse3 .cse33 .cse4) (and .cse19 .cse24 (<= 72 main_~k~0) .cse4) (and (and .cse2 .cse34) .cse35) (and .cse3 .cse36 .cse16 .cse4) (and .cse3 .cse31 .cse16 .cse4 (<= 1 main_~k~0)) (and .cse3 (<= 22 main_~k~0) .cse28 .cse37 .cse4) (and (<= 11 main_~k~0) .cse3 .cse31 .cse9 .cse4) (and .cse38 .cse11 .cse3 .cse8 .cse4) (and .cse39 .cse3 .cse24 .cse4) (and .cse40 .cse3 (<= 5 main_~k~0) .cse16 .cse4) (and (<= 75 main_~k~0) .cse21 .cse24 .cse4) (and .cse3 (<= 29 main_~k~0) .cse28 .cse30 .cse4) (and .cse40 .cse3 (<= 25 main_~k~0) .cse28 .cse4) (and .cse3 (<= 26 main_~k~0) .cse28 .cse4 .cse25) (and .cse3 .cse36 .cse9 .cse8 .cse4) (and .cse11 .cse0 (<= 31 main_~k~0)) (and (<= 66 main_~k~0) .cse26 .cse1) (and (<= 83 main_~k~0) .cse5 .cse14 .cse4) (and .cse3 .cse22 .cse27 (<= 44 main_~k~0) .cse4) (and .cse3 (<= 7 main_~k~0) .cse10 .cse16 .cse4) (and .cse22 .cse6 (<= 47 main_~k~0)) (and (<= 2 main_~k~0) .cse3 .cse37 .cse16 .cse4) (and .cse24 .cse14 .cse4 (<= 73 main_~k~0)) (and .cse26 .cse24 (<= 76 main_~k~0)) (and (<= 23 main_~k~0) .cse3 .cse12 .cse28 .cse4) (and (<= 78 main_~k~0) .cse20 .cse24) (and .cse3 .cse22 .cse30 (<= 49 main_~k~0) .cse4) (and .cse3 .cse28 .cse27 .cse4 (<= 24 main_~k~0)) (and (<= 84 main_~k~0) .cse5 .cse4 .cse17) (and .cse38 .cse3 .cse28 .cse4) (and .cse11 .cse3 (<= 36 main_~k~0) .cse4 .cse25) (and .cse3 .cse27 .cse16 (<= 4 main_~k~0) .cse4) (and .cse23 .cse3 .cse1 .cse4) (and (and .cse2 .cse14 .cse4) (<= 93 main_~k~0)) (and (<= 37 main_~k~0) .cse11 .cse3 .cse10 .cse4) (and .cse13 .cse6 (<= 57 main_~k~0)) (and (<= 95 main_~k~0) (and .cse2 .cse21 .cse4)) (and .cse0 (<= 81 main_~k~0) .cse5) (and (<= 68 main_~k~0) .cse20 .cse1) (and .cse7 .cse3 .cse13 .cse4) (and .cse20 .cse22 (<= 48 main_~k~0)) (and (<= 59 main_~k~0) .cse13 .cse18 .cse4) (and .cse5 .cse3 .cse4 .cse35) (and .cse3 .cse9 .cse37 (<= 12 main_~k~0) .cse4) (and .cse11 .cse40 .cse3 (<= 35 main_~k~0) .cse4) (and .cse3 .cse32 .cse28 .cse8 .cse4) (and (and .cse2 .cse20) (<= 98 main_~k~0)) (and .cse6 .cse24 (<= 77 main_~k~0)) (and .cse29 .cse3 .cse13 .cse8 .cse4) (and (<= 85 main_~k~0) .cse21 .cse5 .cse4) (and .cse22 .cse0 (<= 41 main_~k~0)) (and .cse3 .cse9 .cse30 .cse4 (<= 19 main_~k~0)) (and .cse40 .cse3 (<= 15 main_~k~0) .cse9 .cse4) (and .cse18 .cse24 (<= 79 main_~k~0) .cse4) (and (<= 54 main_~k~0) .cse13 .cse4 .cse17) (and (<= 74 main_~k~0) .cse24 .cse4 .cse17) (and .cse0 (<= 71 main_~k~0) .cse24) (and (<= 86 main_~k~0) .cse5 .cse26) (and (and .cse2 .cse19 .cse4) (<= 92 main_~k~0)) (and .cse15 .cse3 (<= 18 main_~k~0) .cse9 .cse4) (and (<= 91 main_~k~0) (and .cse2 .cse0)) (and .cse39 .cse5 .cse34) (and (<= 16 main_~k~0) .cse3 .cse9 .cse4 .cse25) (and .cse11 .cse15 .cse3 (<= 38 main_~k~0) .cse4) (and (<= 56 main_~k~0) .cse26 .cse13) (and .cse19 (<= 62 main_~k~0) .cse1 .cse4) (and (<= 14 main_~k~0) .cse3 .cse9 .cse27 .cse4) (and .cse3 .cse28 .cse10 .cse4 (<= 27 main_~k~0)) (and .cse21 (<= 55 main_~k~0) .cse13 .cse4) (and .cse21 (<= 65 main_~k~0) .cse1 .cse4) (and (and .cse2 .cse4 .cse17) (<= 94 main_~k~0)) (and .cse3 .cse33 .cse22 .cse8 .cse4)))) [2018-11-12 20:46:05,694 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-12 20:46:05,694 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-12 20:46:05,694 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:46:05,694 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-12 20:46:05,694 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-12 20:46:05,694 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-12 20:46:05,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:46:05 BoogieIcfgContainer [2018-11-12 20:46:05,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:46:05,753 INFO L168 Benchmark]: Toolchain (without parser) took 226370.07 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-12 20:46:05,757 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-11-12 20:46:05,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.79 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-11-12 20:46:05,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.07 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-11-12 20:46:05,759 INFO L168 Benchmark]: Boogie Preprocessor took 31.81 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-11-12 20:46:05,759 INFO L168 Benchmark]: RCFGBuilder took 492.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:46:05,764 INFO L168 Benchmark]: TraceAbstraction took 225470.94 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -380.9 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-12 20:46:05,771 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 344.79 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 24.07 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 31.81 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 492.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225470.94 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -380.9 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((30 <= k && i <= 3) && 10 <= m) && 10 <= n) || ((10 <= m && 100 <= k) && 10 <= n)) || (((10 <= m && 40 <= k) && i <= 4) && 10 <= n)) || (((10 <= m && 0 <= k) && i <= 0) && 10 <= n)) || (((10 <= m && 60 <= k) && i <= 6) && 10 <= n)) || (((10 <= m && 10 <= k) && i <= 1) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 8) && 10 <= n)) || (((50 <= k && 10 <= m) && i <= 5) && 10 <= n)) || (((10 <= m && i <= 9) && 10 <= n) && 90 <= k)) || (((70 <= k && 10 <= m) && i <= 7) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 2) && 10 <= n) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= m && j <= 1) && 10 <= n) && i <= 6) && 61 <= k) || (100 <= k && (i + 1 <= n && 10 <= m) && 10 <= n)) || ((i <= 8 && (10 <= m && j <= 7) && 10 <= n) && 87 <= k)) || ((((10 <= m && 60 <= k) && j <= 0) && i <= 6) && 10 <= n)) || ((((10 <= m && i <= 1) && 17 <= k) && j <= 7) && 10 <= n)) || ((((33 <= k && i <= 3) && 10 <= m) && j <= 3) && 10 <= n)) || (((53 <= k && i <= 5) && 10 <= m && j <= 3) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 1) && 10 <= n) && 51 <= k)) || ((((j <= 8 && 10 <= m) && 8 <= k) && i <= 0) && 10 <= n)) || (((64 <= k && i <= 6) && 10 <= n) && 10 <= m && j <= 4)) || (99 <= k && (i + 1 <= n && 10 <= m && j <= 9) && 10 <= n)) || (((82 <= k && 10 <= m && j <= 2) && i <= 8) && 10 <= n)) || (((89 <= k && 10 <= m && j <= 9) && i <= 8) && 10 <= n)) || (((69 <= k && 10 <= m && j <= 9) && i <= 6) && 10 <= n)) || ((((10 <= m && j <= 3) && 3 <= k) && i <= 0) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 8) && 88 <= k)) || ((((j <= 5 && 10 <= m) && 45 <= k) && i <= 4) && 10 <= n)) || ((((70 <= k && 10 <= m) && j <= 0) && i <= 7) && 10 <= n)) || ((((10 <= m && 6 <= k) && i <= 0) && 10 <= n) && j <= 6)) || ((i + 1 <= n && (10 <= m && 10 <= n) && j <= 6) && 96 <= k)) || (((63 <= k && 10 <= m && j <= 3) && i <= 6) && 10 <= n)) || ((((10 <= m && 0 <= k) && j <= 0) && i <= 0) && 10 <= n)) || ((((i <= 3 && 10 <= m) && j <= 4) && 34 <= k) && 10 <= n)) || ((((j <= 8 && 28 <= k) && 10 <= m) && i <= 2) && 10 <= n)) || (((i <= 5 && 52 <= k) && 10 <= m && j <= 2) && 10 <= n)) || (((50 <= k && i <= 4) && 10 <= m) && 10 <= n)) || ((((10 <= m && 9 <= k) && j <= 9) && i <= 0) && 10 <= n)) || ((((21 <= k && 10 <= m) && j <= 1) && i <= 2) && 10 <= n)) || ((i <= 4 && (10 <= m && 10 <= n) && j <= 6) && 46 <= k)) || ((((i <= 3 && 10 <= m) && 39 <= k) && j <= 9) && 10 <= n)) || ((67 <= k && (10 <= m && j <= 7) && 10 <= n) && i <= 6)) || (((i <= 4 && 10 <= m && j <= 2) && 42 <= k) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 1) && 13 <= k) && 10 <= n)) || (((i <= 4 && 43 <= k) && 10 <= m && j <= 3) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 1) && 10 <= n)) || (97 <= k && i + 1 <= n && (10 <= m && j <= 7) && 10 <= n)) || (((i <= 3 && 32 <= k) && 10 <= m && j <= 2) && 10 <= n)) || ((58 <= k && i <= 5) && (j <= 8 && 10 <= m) && 10 <= n)) || (((i <= 3 && 10 <= m) && 40 <= k) && 10 <= n)) || ((((10 <= m && j <= 2) && i <= 7) && 72 <= k) && 10 <= n)) || ((i + 1 <= n && (10 <= m && j <= 0) && 10 <= n) && 90 <= k)) || (((10 <= m && 10 <= k) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 1) && i <= 0) && 10 <= n) && 1 <= k)) || ((((10 <= m && 22 <= k) && i <= 2) && j <= 2) && 10 <= n)) || ((((11 <= k && 10 <= m) && j <= 1) && i <= 1) && 10 <= n)) || ((((30 <= k && i <= 3) && 10 <= m) && j <= 0) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 7) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 5 <= k) && i <= 0) && 10 <= n)) || (((75 <= k && j <= 5 && 10 <= m) && i <= 7) && 10 <= n)) || ((((10 <= m && 29 <= k) && i <= 2) && j <= 9) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 25 <= k) && i <= 2) && 10 <= n)) || ((((10 <= m && 26 <= k) && i <= 2) && 10 <= n) && j <= 6)) || ((((10 <= m && 10 <= k) && i <= 1) && j <= 0) && 10 <= n)) || ((i <= 3 && (10 <= m && j <= 1) && 10 <= n) && 31 <= k)) || ((66 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 6)) || (((83 <= k && i <= 8) && 10 <= m && j <= 3) && 10 <= n)) || ((((10 <= m && i <= 4) && j <= 4) && 44 <= k) && 10 <= n)) || ((((10 <= m && 7 <= k) && j <= 7) && i <= 0) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 7) && 10 <= n) && 47 <= k)) || ((((2 <= k && 10 <= m) && j <= 2) && i <= 0) && 10 <= n)) || (((i <= 7 && 10 <= m && j <= 3) && 10 <= n) && 73 <= k)) || ((((10 <= m && 10 <= n) && j <= 6) && i <= 7) && 76 <= k)) || ((((23 <= k && 10 <= m) && j <= 3) && i <= 2) && 10 <= n)) || ((78 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 7)) || ((((10 <= m && i <= 4) && j <= 9) && 49 <= k) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 4) && 10 <= n) && 24 <= k)) || (((84 <= k && i <= 8) && 10 <= n) && 10 <= m && j <= 4)) || (((30 <= k && 10 <= m) && i <= 2) && 10 <= n)) || ((((i <= 3 && 10 <= m) && 36 <= k) && 10 <= n) && j <= 6)) || ((((10 <= m && j <= 4) && i <= 0) && 4 <= k) && 10 <= n)) || (((70 <= k && 10 <= m) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 3) && 10 <= n) && 93 <= k)) || ((((37 <= k && i <= 3) && 10 <= m) && j <= 7) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 7) && 10 <= n) && 57 <= k)) || (95 <= k && (i + 1 <= n && j <= 5 && 10 <= m) && 10 <= n)) || ((((10 <= m && j <= 1) && 10 <= n) && 81 <= k) && i <= 8)) || ((68 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 6)) || (((60 <= k && 10 <= m) && i <= 5) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 4) && 48 <= k)) || (((59 <= k && i <= 5) && 10 <= m && j <= 9) && 10 <= n)) || (((i <= 8 && 10 <= m) && 10 <= n) && 90 <= k)) || ((((10 <= m && i <= 1) && j <= 2) && 12 <= k) && 10 <= n)) || ((((i <= 3 && j <= 5) && 10 <= m) && 35 <= k) && 10 <= n)) || ((((10 <= m && 20 <= k) && i <= 2) && j <= 0) && 10 <= n)) || ((i + 1 <= n && (j <= 8 && 10 <= m) && 10 <= n) && 98 <= k)) || ((((10 <= m && j <= 7) && 10 <= n) && i <= 7) && 77 <= k)) || ((((50 <= k && 10 <= m) && i <= 5) && j <= 0) && 10 <= n)) || (((85 <= k && j <= 5 && 10 <= m) && i <= 8) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 1) && 10 <= n) && 41 <= k)) || ((((10 <= m && i <= 1) && j <= 9) && 10 <= n) && 19 <= k)) || ((((j <= 5 && 10 <= m) && 15 <= k) && i <= 1) && 10 <= n)) || ((((10 <= m && j <= 9) && i <= 7) && 79 <= k) && 10 <= n)) || (((54 <= k && i <= 5) && 10 <= n) && 10 <= m && j <= 4)) || (((74 <= k && i <= 7) && 10 <= n) && 10 <= m && j <= 4)) || ((((10 <= m && j <= 1) && 10 <= n) && 71 <= k) && i <= 7)) || ((86 <= k && i <= 8) && (10 <= m && 10 <= n) && j <= 6)) || (((i + 1 <= n && 10 <= m && j <= 2) && 10 <= n) && 92 <= k)) || ((((j <= 8 && 10 <= m) && 18 <= k) && i <= 1) && 10 <= n)) || (91 <= k && i + 1 <= n && (10 <= m && j <= 1) && 10 <= n)) || ((80 <= k && i <= 8) && (10 <= m && j <= 0) && 10 <= n)) || ((((16 <= k && 10 <= m) && i <= 1) && 10 <= n) && j <= 6)) || ((((i <= 3 && j <= 8) && 10 <= m) && 38 <= k) && 10 <= n)) || ((56 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 5)) || ((((10 <= m && j <= 2) && 62 <= k) && i <= 6) && 10 <= n)) || ((((14 <= k && 10 <= m) && i <= 1) && j <= 4) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 7) && 10 <= n) && 27 <= k)) || ((((j <= 5 && 10 <= m) && 55 <= k) && i <= 5) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 65 <= k) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= n) && 10 <= m && j <= 4) && 94 <= k)) || ((((10 <= m && 40 <= k) && i <= 4) && j <= 0) && 10 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 225.3s OverallTime, 20 OverallIterations, 110 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 193.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 886 SDtfs, 1449 SDslu, 3450 SDs, 0 SdLazy, 1174 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4553 GetRequests, 4066 SyntacticMatches, 60 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 293 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 27 PreInvPairs, 5144 NumberOfFragments, 1976 HoareAnnotationTreeSize, 27 FomulaSimplifications, 6058176 FormulaSimplificationTreeSizeReduction, 90.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 175756 FormulaSimplificationTreeSizeReductionInter, 102.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 4664 NumberOfCodeBlocks, 4518 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 6741 ConstructedInterpolants, 0 QuantifiedInterpolants, 6960361 SizeOfPredicates, 46 NumberOfNonLiveVariables, 4020 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 52 InterpolantComputations, 4 PerfectInterpolantSequences, 46689/172026 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...