java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:19:12,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:19:12,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:19:12,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:19:12,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:19:12,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:19:12,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:19:12,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:19:12,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:19:12,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:19:12,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:19:12,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:19:12,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:19:12,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:19:12,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:19:12,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:19:12,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:19:12,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:19:12,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:19:12,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:19:12,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:19:12,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:19:12,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:19:12,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:19:12,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:19:12,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:19:12,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:19:12,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:19:12,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:19:12,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:19:12,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:19:12,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:19:12,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:19:12,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:19:12,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:19:12,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:19:12,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:19:12,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:19:12,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:19:12,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:19:12,677 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:19:12,677 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:19:12,678 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:19:12,678 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:19:12,678 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:19:12,678 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:19:12,678 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:19:12,679 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:19:12,679 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:19:12,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:19:12,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:19:12,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:19:12,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:19:12,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:19:12,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:19:12,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:19:12,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:19:12,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:19:12,684 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:19:12,684 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:19:12,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:19:12,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:19:12,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:19:12,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:19:12,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:19:12,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:19:12,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:19:12,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:19:12,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:19:12,686 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:19:12,686 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:19:12,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:19:12,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:19:12,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:19:12,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:19:12,769 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:19:12,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i [2018-10-24 12:19:12,845 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dcef440ed/1a96a1c2ba014820b477f381192c3471/FLAGc3c4c51a3 [2018-10-24 12:19:13,334 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:19:13,335 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested_true-unreach-call_true-termination.i [2018-10-24 12:19:13,342 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dcef440ed/1a96a1c2ba014820b477f381192c3471/FLAGc3c4c51a3 [2018-10-24 12:19:13,358 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dcef440ed/1a96a1c2ba014820b477f381192c3471 [2018-10-24 12:19:13,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:19:13,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:19:13,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:19:13,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:19:13,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:19:13,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f2c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13, skipping insertion in model container [2018-10-24 12:19:13,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:19:13,412 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:19:13,618 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:19:13,622 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:19:13,641 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:19:13,657 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:19:13,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13 WrapperNode [2018-10-24 12:19:13,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:19:13,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:19:13,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:19:13,659 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:19:13,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:19:13,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:19:13,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:19:13,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:19:13,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... [2018-10-24 12:19:13,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:19:13,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:19:13,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:19:13,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:19:13,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:19:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:19:13,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:19:13,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:19:13,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:19:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:19:13,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:19:13,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:19:13,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:19:14,223 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:19:14,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:14 BoogieIcfgContainer [2018-10-24 12:19:14,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:19:14,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:19:14,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:19:14,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:19:14,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:19:13" (1/3) ... [2018-10-24 12:19:14,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe218d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:14, skipping insertion in model container [2018-10-24 12:19:14,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:19:13" (2/3) ... [2018-10-24 12:19:14,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe218d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:19:14, skipping insertion in model container [2018-10-24 12:19:14,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:19:14" (3/3) ... [2018-10-24 12:19:14,233 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2018-10-24 12:19:14,244 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:19:14,253 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:19:14,268 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:19:14,313 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:19:14,313 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:19:14,313 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:19:14,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:19:14,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:19:14,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:19:14,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:19:14,314 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:19:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-24 12:19:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-24 12:19:14,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:14,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:19:14,350 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:14,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -702630595, now seen corresponding path program 1 times [2018-10-24 12:19:14,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:14,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:19:14,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:19:14,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:19:14,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:19:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:19:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:19:14,502 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-24 12:19:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:14,528 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-10-24 12:19:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:19:14,530 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-10-24 12:19:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:14,539 INFO L225 Difference]: With dead ends: 43 [2018-10-24 12:19:14,540 INFO L226 Difference]: Without dead ends: 18 [2018-10-24 12:19:14,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:19:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-24 12:19:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-24 12:19:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-24 12:19:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-10-24 12:19:14,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-10-24 12:19:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:14,587 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-24 12:19:14,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:19:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-10-24 12:19:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 12:19:14,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:14,589 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:19:14,589 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:14,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash -972126638, now seen corresponding path program 1 times [2018-10-24 12:19:14,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:14,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:19:14,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:19:14,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:19:14,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:19:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:19:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:19:14,694 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-10-24 12:19:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:14,789 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-10-24 12:19:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:19:14,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-24 12:19:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:14,791 INFO L225 Difference]: With dead ends: 29 [2018-10-24 12:19:14,791 INFO L226 Difference]: Without dead ends: 24 [2018-10-24 12:19:14,792 INFO L605 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-10-24 12:19:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-24 12:19:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-10-24 12:19:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-24 12:19:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-24 12:19:14,799 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-10-24 12:19:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:14,800 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-24 12:19:14,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:19:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-24 12:19:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:19:14,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:14,801 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:19:14,802 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:14,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1998515670, now seen corresponding path program 1 times [2018-10-24 12:19:14,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:14,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:14,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:14,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:19:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:19:14,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:19:14,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:19:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:19:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:19:14,878 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-10-24 12:19:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:14,975 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-10-24 12:19:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 12:19:14,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-24 12:19:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:14,977 INFO L225 Difference]: With dead ends: 34 [2018-10-24 12:19:14,977 INFO L226 Difference]: Without dead ends: 23 [2018-10-24 12:19:14,978 INFO L605 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-10-24 12:19:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-24 12:19:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-24 12:19:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-24 12:19:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-24 12:19:14,984 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-10-24 12:19:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:14,984 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-24 12:19:14,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:19:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-24 12:19:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:19:14,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:14,986 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-10-24 12:19:14,986 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:14,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1293803971, now seen corresponding path program 1 times [2018-10-24 12:19:14,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:14,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:15,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:15,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:15,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-24 12:19:15,079 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [21], [25], [28], [30], [32], [36], [43], [46], [48], [54], [55], [56], [58] [2018-10-24 12:19:15,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:19:15,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:19:16,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:19:16,335 INFO L272 AbstractInterpreter]: Visited 19 different actions 599 times. Merged at 8 different actions 374 times. Widened at 3 different actions 105 times. Found 61 fixpoints after 6 different actions. Largest state had 10 variables. [2018-10-24 12:19:16,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:16,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:19:16,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:16,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:16,402 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:16,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:16,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:16,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:16,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-24 12:19:16,865 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:16,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:19:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:19:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:19:16,868 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-10-24 12:19:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:16,929 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-24 12:19:16,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:19:16,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-10-24 12:19:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:16,932 INFO L225 Difference]: With dead ends: 39 [2018-10-24 12:19:16,932 INFO L226 Difference]: Without dead ends: 26 [2018-10-24 12:19:16,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:19:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-24 12:19:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-24 12:19:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-24 12:19:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-10-24 12:19:16,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-10-24 12:19:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:16,940 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-10-24 12:19:16,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:19:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-10-24 12:19:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-24 12:19:16,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:16,941 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-10-24 12:19:16,942 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:16,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:16,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1379909750, now seen corresponding path program 2 times [2018-10-24 12:19:16,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:16,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:16,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:16,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:16,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:19:17,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:17,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:17,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:17,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:17,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:17,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:17,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:19:17,115 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:19:17,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:19:17,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:19:17,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:19:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-10-24 12:19:17,521 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:17,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:19:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:19:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:19:17,523 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-10-24 12:19:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:18,358 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-10-24 12:19:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:19:18,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-24 12:19:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:18,361 INFO L225 Difference]: With dead ends: 73 [2018-10-24 12:19:18,361 INFO L226 Difference]: Without dead ends: 57 [2018-10-24 12:19:18,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:19:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-24 12:19:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-10-24 12:19:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-24 12:19:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-10-24 12:19:18,372 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2018-10-24 12:19:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:18,373 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-24 12:19:18,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:19:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-10-24 12:19:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-24 12:19:18,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:18,374 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-10-24 12:19:18,375 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:18,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1699386968, now seen corresponding path program 3 times [2018-10-24 12:19:18,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:18,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:18,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:18,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:18,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:19:18,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:18,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:18,488 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:18,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:18,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:18,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:19:18,504 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:19:18,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:19:18,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:18,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:19:18,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:19:18,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:18,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-24 12:19:18,818 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:18,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:19:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:19:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:19:18,819 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-10-24 12:19:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:18,900 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-10-24 12:19:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:19:18,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-10-24 12:19:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:18,903 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:19:18,903 INFO L226 Difference]: Without dead ends: 50 [2018-10-24 12:19:18,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 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-10-24 12:19:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-24 12:19:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-24 12:19:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:19:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-24 12:19:18,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-10-24 12:19:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:18,913 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-24 12:19:18,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:19:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-24 12:19:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-24 12:19:18,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:18,915 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-10-24 12:19:18,916 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:18,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1734727982, now seen corresponding path program 4 times [2018-10-24 12:19:18,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:18,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:18,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:19:19,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:19,048 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:19,048 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:19,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:19,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:19,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:19,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:19,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:19:19,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-24 12:19:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:19,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-24 12:19:19,362 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:19,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:19:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:19:19,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:19:19,364 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-10-24 12:19:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:19,439 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-10-24 12:19:19,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:19:19,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-24 12:19:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:19,442 INFO L225 Difference]: With dead ends: 81 [2018-10-24 12:19:19,442 INFO L226 Difference]: Without dead ends: 56 [2018-10-24 12:19:19,445 INFO L605 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-10-24 12:19:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-24 12:19:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-10-24 12:19:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-24 12:19:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-10-24 12:19:19,455 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-10-24 12:19:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:19,455 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-10-24 12:19:19,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:19:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-10-24 12:19:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-24 12:19:19,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:19,457 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-10-24 12:19:19,458 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:19,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2050902056, now seen corresponding path program 5 times [2018-10-24 12:19:19,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:19,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 12:19:19,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:19,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:19,713 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:19,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:19,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:19,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:19:19,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:19:19,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:19:19,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:19,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 12:19:19,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 12:19:19,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-10-24 12:19:19,946 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:19,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:19:19,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:19:19,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:19:19,947 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 13 states. [2018-10-24 12:19:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:21,026 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-10-24 12:19:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-24 12:19:21,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-24 12:19:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:21,029 INFO L225 Difference]: With dead ends: 136 [2018-10-24 12:19:21,030 INFO L226 Difference]: Without dead ends: 108 [2018-10-24 12:19:21,031 INFO L605 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-10-24 12:19:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-24 12:19:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2018-10-24 12:19:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-24 12:19:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-10-24 12:19:21,050 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 53 [2018-10-24 12:19:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:21,050 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-10-24 12:19:21,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:19:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-10-24 12:19:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-24 12:19:21,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:21,053 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-10-24 12:19:21,053 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:21,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1138844106, now seen corresponding path program 6 times [2018-10-24 12:19:21,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:21,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:21,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-24 12:19:21,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:21,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:21,271 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:21,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:21,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:21,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:19:21,285 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:19:21,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:19:21,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:21,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-24 12:19:21,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-24 12:19:21,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:21,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-10-24 12:19:21,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:21,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 12:19:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 12:19:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:19:21,600 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 17 states. [2018-10-24 12:19:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:21,685 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-10-24 12:19:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:19:21,685 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-10-24 12:19:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:21,686 INFO L225 Difference]: With dead ends: 149 [2018-10-24 12:19:21,687 INFO L226 Difference]: Without dead ends: 95 [2018-10-24 12:19:21,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:19:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-24 12:19:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-24 12:19:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-24 12:19:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-10-24 12:19:21,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2018-10-24 12:19:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:21,701 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-10-24 12:19:21,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 12:19:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-10-24 12:19:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 12:19:21,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:21,703 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-10-24 12:19:21,703 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:21,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2009672909, now seen corresponding path program 7 times [2018-10-24 12:19:21,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:21,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:21,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:21,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-24 12:19:21,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:21,875 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:21,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:21,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:21,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:21,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:21,884 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:21,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-24 12:19:22,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-24 12:19:22,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:22,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-10-24 12:19:22,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:22,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:19:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:19:22,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:19:22,795 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 19 states. [2018-10-24 12:19:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:22,925 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-10-24 12:19:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:19:22,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-10-24 12:19:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:22,927 INFO L225 Difference]: With dead ends: 164 [2018-10-24 12:19:22,927 INFO L226 Difference]: Without dead ends: 104 [2018-10-24 12:19:22,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:19:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-24 12:19:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-24 12:19:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-24 12:19:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-10-24 12:19:22,941 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 91 [2018-10-24 12:19:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:22,942 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-10-24 12:19:22,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:19:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-10-24 12:19:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-24 12:19:22,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:22,944 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-10-24 12:19:22,944 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:22,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1289095638, now seen corresponding path program 8 times [2018-10-24 12:19:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:22,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:22,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 458 proven. 100 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-10-24 12:19:23,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:23,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:23,086 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:23,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:23,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:23,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:23,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:19:23,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:19:23,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-24 12:19:23,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:23,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 460 proven. 100 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-10-24 12:19:23,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-10-24 12:19:23,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:23,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-10-24 12:19:23,928 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:23,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:19:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:19:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:23,929 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 21 states. [2018-10-24 12:19:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:24,072 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-10-24 12:19:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:19:24,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-10-24 12:19:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:24,073 INFO L225 Difference]: With dead ends: 179 [2018-10-24 12:19:24,073 INFO L226 Difference]: Without dead ends: 113 [2018-10-24 12:19:24,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-24 12:19:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-10-24 12:19:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-24 12:19:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-10-24 12:19:24,088 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 100 [2018-10-24 12:19:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:24,089 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-10-24 12:19:24,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:19:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-10-24 12:19:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 12:19:24,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:24,091 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-10-24 12:19:24,091 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:24,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash -340366701, now seen corresponding path program 9 times [2018-10-24 12:19:24,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:24,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:24,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-24 12:19:24,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:24,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:24,277 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:24,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:24,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:24,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:24,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:19:24,285 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:19:24,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:19:24,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:24,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-24 12:19:24,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-24 12:19:24,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:24,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-10-24 12:19:24,723 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:24,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:19:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:19:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:24,725 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 23 states. [2018-10-24 12:19:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:24,971 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-10-24 12:19:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:19:24,971 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2018-10-24 12:19:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:24,972 INFO L225 Difference]: With dead ends: 194 [2018-10-24 12:19:24,972 INFO L226 Difference]: Without dead ends: 122 [2018-10-24 12:19:24,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 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-10-24 12:19:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-24 12:19:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-10-24 12:19:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-24 12:19:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-10-24 12:19:24,986 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 109 [2018-10-24 12:19:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:24,987 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-10-24 12:19:24,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:19:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-10-24 12:19:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-24 12:19:24,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:24,989 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-10-24 12:19:24,989 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:24,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2030161270, now seen corresponding path program 10 times [2018-10-24 12:19:24,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:24,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:24,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:24,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-24 12:19:25,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:25,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:25,145 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:25,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:25,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:25,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:25,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:25,159 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:25,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-24 12:19:25,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-24 12:19:25,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:25,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-24 12:19:25,396 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:25,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 12:19:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 12:19:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:19:25,398 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-10-24 12:19:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:25,445 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-10-24 12:19:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:19:25,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-10-24 12:19:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:25,447 INFO L225 Difference]: With dead ends: 192 [2018-10-24 12:19:25,447 INFO L226 Difference]: Without dead ends: 187 [2018-10-24 12:19:25,448 INFO L605 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-10-24 12:19:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-24 12:19:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-10-24 12:19:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-24 12:19:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-10-24 12:19:25,464 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 118 [2018-10-24 12:19:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:25,465 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-10-24 12:19:25,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 12:19:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-10-24 12:19:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-24 12:19:25,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:25,468 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-10-24 12:19:25,468 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:25,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash -969563822, now seen corresponding path program 11 times [2018-10-24 12:19:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:25,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:25,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-24 12:19:25,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:25,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:25,791 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:25,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:25,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:25,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:25,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:19:25,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:19:25,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-24 12:19:25,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:25,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-24 12:19:26,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-24 12:19:26,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:26,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-24 12:19:26,327 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:26,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:19:26,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:19:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:19:26,329 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 13 states. [2018-10-24 12:19:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:26,484 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-10-24 12:19:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:19:26,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-10-24 12:19:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:26,487 INFO L225 Difference]: With dead ends: 227 [2018-10-24 12:19:26,487 INFO L226 Difference]: Without dead ends: 222 [2018-10-24 12:19:26,487 INFO L605 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-10-24 12:19:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-24 12:19:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-10-24 12:19:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-24 12:19:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-10-24 12:19:26,506 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 153 [2018-10-24 12:19:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:26,506 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-10-24 12:19:26,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:19:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-10-24 12:19:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 12:19:26,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:26,509 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-10-24 12:19:26,509 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:26,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1779605514, now seen corresponding path program 12 times [2018-10-24 12:19:26,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:26,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:26,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:26,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-24 12:19:26,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:26,979 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:26,979 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:26,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:26,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:26,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:19:26,988 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:19:27,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:19:27,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:27,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-24 12:19:27,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-24 12:19:27,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:27,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-10-24 12:19:27,392 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:27,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:19:27,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:19:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:19:27,394 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 15 states. [2018-10-24 12:19:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:27,762 INFO L93 Difference]: Finished difference Result 262 states and 269 transitions. [2018-10-24 12:19:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:19:27,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2018-10-24 12:19:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:27,765 INFO L225 Difference]: With dead ends: 262 [2018-10-24 12:19:27,765 INFO L226 Difference]: Without dead ends: 257 [2018-10-24 12:19:27,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:19:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-24 12:19:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2018-10-24 12:19:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-24 12:19:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-10-24 12:19:27,789 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 188 [2018-10-24 12:19:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:27,790 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-10-24 12:19:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:19:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-10-24 12:19:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-24 12:19:27,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:27,792 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-10-24 12:19:27,792 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:27,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 388824786, now seen corresponding path program 13 times [2018-10-24 12:19:27,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:27,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:27,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-24 12:19:28,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:28,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:28,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:28,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:28,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:28,144 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:28,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:28,152 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:28,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-24 12:19:28,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-24 12:19:28,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:28,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-10-24 12:19:28,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:28,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 12:19:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 12:19:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:19:28,856 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 17 states. [2018-10-24 12:19:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:29,086 INFO L93 Difference]: Finished difference Result 297 states and 305 transitions. [2018-10-24 12:19:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:19:29,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 223 [2018-10-24 12:19:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:29,089 INFO L225 Difference]: With dead ends: 297 [2018-10-24 12:19:29,089 INFO L226 Difference]: Without dead ends: 292 [2018-10-24 12:19:29,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-24 12:19:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-24 12:19:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2018-10-24 12:19:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-24 12:19:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 266 transitions. [2018-10-24 12:19:29,115 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 266 transitions. Word has length 223 [2018-10-24 12:19:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:29,116 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 266 transitions. [2018-10-24 12:19:29,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 12:19:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 266 transitions. [2018-10-24 12:19:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-24 12:19:29,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:29,118 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-10-24 12:19:29,118 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:29,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1062399370, now seen corresponding path program 14 times [2018-10-24 12:19:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:29,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:29,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-24 12:19:30,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:30,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:30,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:30,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:30,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:30,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:19:30,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:19:30,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-10-24 12:19:30,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:30,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-24 12:19:30,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-24 12:19:30,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:30,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-10-24 12:19:30,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:30,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:19:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:19:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:19:30,840 INFO L87 Difference]: Start difference. First operand 259 states and 266 transitions. Second operand 19 states. [2018-10-24 12:19:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:30,969 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-10-24 12:19:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:19:30,969 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2018-10-24 12:19:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:30,971 INFO L225 Difference]: With dead ends: 332 [2018-10-24 12:19:30,972 INFO L226 Difference]: Without dead ends: 327 [2018-10-24 12:19:30,972 INFO L605 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-10-24 12:19:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-24 12:19:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 294. [2018-10-24 12:19:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-24 12:19:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 302 transitions. [2018-10-24 12:19:31,005 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 302 transitions. Word has length 258 [2018-10-24 12:19:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:31,006 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 302 transitions. [2018-10-24 12:19:31,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:19:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 302 transitions. [2018-10-24 12:19:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-24 12:19:31,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:31,008 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-10-24 12:19:31,008 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:31,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash -790873006, now seen corresponding path program 15 times [2018-10-24 12:19:31,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:31,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:31,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-24 12:19:31,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:31,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:31,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:31,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:31,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:31,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:19:31,467 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:19:31,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:19:31,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:19:31,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-24 12:19:31,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-24 12:19:32,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:32,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-10-24 12:19:32,193 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:32,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:19:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:19:32,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:32,194 INFO L87 Difference]: Start difference. First operand 294 states and 302 transitions. Second operand 21 states. [2018-10-24 12:19:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:32,361 INFO L93 Difference]: Finished difference Result 367 states and 377 transitions. [2018-10-24 12:19:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 12:19:32,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-10-24 12:19:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:32,363 INFO L225 Difference]: With dead ends: 367 [2018-10-24 12:19:32,363 INFO L226 Difference]: Without dead ends: 362 [2018-10-24 12:19:32,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-24 12:19:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 329. [2018-10-24 12:19:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-24 12:19:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 338 transitions. [2018-10-24 12:19:32,395 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 338 transitions. Word has length 293 [2018-10-24 12:19:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:32,396 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 338 transitions. [2018-10-24 12:19:32,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:19:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 338 transitions. [2018-10-24 12:19:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-24 12:19:32,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:32,398 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-10-24 12:19:32,399 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:32,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 547939574, now seen corresponding path program 16 times [2018-10-24 12:19:32,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:32,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:19:32,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:32,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-24 12:19:32,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:32,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:19:32,769 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:19:32,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:19:32,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:19:32,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:19:32,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:32,777 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:19:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:32,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:19:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-24 12:19:33,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-24 12:19:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:33,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-10-24 12:19:33,512 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:33,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-24 12:19:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-24 12:19:33,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-10-24 12:19:33,513 INFO L87 Difference]: Start difference. First operand 329 states and 338 transitions. Second operand 23 states. [2018-10-24 12:19:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:33,750 INFO L93 Difference]: Finished difference Result 402 states and 413 transitions. [2018-10-24 12:19:33,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-24 12:19:33,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 328 [2018-10-24 12:19:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:33,752 INFO L225 Difference]: With dead ends: 402 [2018-10-24 12:19:33,752 INFO L226 Difference]: Without dead ends: 397 [2018-10-24 12:19:33,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 636 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-10-24 12:19:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-24 12:19:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 364. [2018-10-24 12:19:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-24 12:19:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-10-24 12:19:33,788 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 328 [2018-10-24 12:19:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:33,788 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-10-24 12:19:33,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-24 12:19:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-10-24 12:19:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-24 12:19:33,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:19:33,791 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-10-24 12:19:33,791 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:19:33,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:19:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1390107090, now seen corresponding path program 17 times [2018-10-24 12:19:33,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:19:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:33,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:19:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:19:33,793 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:19:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:19:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 17095 backedges. 17077 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 12:19:40,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:19:40,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2018-10-24 12:19:40,996 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:19:40,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-24 12:19:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-24 12:19:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2018-10-24 12:19:41,002 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 105 states. [2018-10-24 12:19:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:19:43,611 INFO L93 Difference]: Finished difference Result 14899 states and 15359 transitions. [2018-10-24 12:19:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-24 12:19:43,611 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 363 [2018-10-24 12:19:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:19:43,612 INFO L225 Difference]: With dead ends: 14899 [2018-10-24 12:19:43,612 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:19:43,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2018-10-24 12:19:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:19:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:19:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:19:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:19:43,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2018-10-24 12:19:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:19:43,641 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:19:43,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-24 12:19:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:19:43,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:19:43,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:19:45,925 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-24 12:19:49,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:51,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:52,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:53,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:54,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:55,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:55,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:55,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:55,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:56,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:57,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:58,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:59,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:59,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:59,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:59,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:19:59,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:00,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:00,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:00,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:01,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:01,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:01,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:01,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:02,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:02,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:02,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:03,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:03,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:03,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:03,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:04,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:05,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:05,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:06,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:06,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:07,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:08,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:09,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:09,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:10,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:11,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:11,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:12,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:12,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:13,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:13,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:13,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:13,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:14,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:14,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:14,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:14,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:15,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:15,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:15,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:16,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:16,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:17,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:17,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:17,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:18,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:19,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:21,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:21,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:21,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:22,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:23,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:24,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:25,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:25,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:26,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:26,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:26,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:26,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:28,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:29,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:30,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:30,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:31,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:31,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:31,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:32,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:33,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:33,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:34,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:36,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:36,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:38,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:39,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:40,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:43,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:43,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:44,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:44,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:44,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:44,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:44,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:46,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:48,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:50,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:58,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:20:59,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:01,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:04,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:04,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:04,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:04,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:05,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:09,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:09,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 12:21:23,918 WARN L179 SmtUtils]: Spent 1.63 m on a formula simplification. DAG size of input: 5167 DAG size of output: 2220 [2018-10-24 12:21:30,375 WARN L179 SmtUtils]: Spent 6.40 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-24 12:23:03,008 WARN L179 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 2199 DAG size of output: 362 [2018-10-24 12:23:03,012 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-24 12:23:03,012 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:23:03,012 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:23:03,013 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:23:03,013 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2018-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-10-24 12:23:03,013 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-10-24 12:23:03,013 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2018-10-24 12:23:03,014 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-10-24 12:23:03,014 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2018-10-24 12:23:03,014 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-24 12:23:03,014 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2018-10-24 12:23:03,014 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-10-24 12:23:03,014 INFO L425 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2018-10-24 12:23:03,015 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-10-24 12:23:03,016 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-24 12:23:03,016 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:23:03,016 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 12:23:03,016 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 12:23:03,016 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 12:23:03,016 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:23:03,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:23:03 BoogieIcfgContainer [2018-10-24 12:23:03,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:23:03,056 INFO L168 Benchmark]: Toolchain (without parser) took 229685.52 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -118.1 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-24 12:23:03,057 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:23:03,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.60 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:23:03,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:23:03,059 INFO L168 Benchmark]: Boogie Preprocessor took 24.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:23:03,059 INFO L168 Benchmark]: RCFGBuilder took 516.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:23:03,060 INFO L168 Benchmark]: TraceAbstraction took 228830.51 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 676.5 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-10-24 12:23:03,065 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.60 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.34 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 24.80 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 516.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228830.51 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 676.5 MB). Peak memory consumption was 3.0 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, 228.7s OverallTime, 20 OverallIterations, 110 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 199.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 886 SDtfs, 1449 SDslu, 3450 SDs, 0 SdLazy, 1174 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4553 GetRequests, 4066 SyntacticMatches, 60 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 16.6s 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, 1.3s 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, 100.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 175756 FormulaSimplificationTreeSizeReductionInter, 99.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.8s 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...