java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:53:54,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:53:54,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:53:54,319 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:53:54,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:53:54,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:53:54,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:53:54,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:53:54,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:53:54,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:53:54,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:53:54,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:53:54,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:53:54,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:53:54,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:53:54,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:53:54,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:53:54,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:53:54,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:53:54,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:53:54,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:53:54,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:53:54,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:53:54,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:53:54,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:53:54,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:53:54,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:53:54,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:53:54,367 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:53:54,368 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:53:54,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:53:54,369 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:53:54,369 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:53:54,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:53:54,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:53:54,370 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:53:54,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:53:54,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:53:54,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:53:54,387 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:53:54,387 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:53:54,387 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:53:54,387 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:53:54,387 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:53:54,388 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:53:54,388 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:53:54,388 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:53:54,388 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:53:54,388 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:53:54,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:53:54,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:53:54,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:53:54,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:53:54,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:53:54,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:53:54,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:53:54,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:53:54,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:53:54,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:53:54,391 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:53:54,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:53:54,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:54,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:53:54,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:53:54,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:53:54,392 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:53:54,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:53:54,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:53:54,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:53:54,393 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:53:54,393 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:53:54,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:53:54,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:53:54,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:53:54,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:53:54,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:53:54,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-07 12:53:54,515 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644bc8747/f932b6d612e946cf924ee62e2e7c47a4/FLAG6fe1ded6b [2018-11-07 12:53:55,081 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:53:55,082 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-07 12:53:55,106 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644bc8747/f932b6d612e946cf924ee62e2e7c47a4/FLAG6fe1ded6b [2018-11-07 12:53:55,122 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644bc8747/f932b6d612e946cf924ee62e2e7c47a4 [2018-11-07 12:53:55,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:53:55,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:53:55,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:55,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:53:55,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:53:55,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c4d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55, skipping insertion in model container [2018-11-07 12:53:55,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:53:55,246 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:53:55,748 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:55,754 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:53:55,894 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:55,913 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:53:55,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55 WrapperNode [2018-11-07 12:53:55,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:55,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:55,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:53:55,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:53:55,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:55,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:56,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:53:56,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:53:56,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:53:56,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... [2018-11-07 12:53:56,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:53:56,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:53:56,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:53:56,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:53:56,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:53:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:53:56,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:53:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:53:56,251 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:53:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:53:56,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:53:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:53:56,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:53:59,488 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:53:59,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:59 BoogieIcfgContainer [2018-11-07 12:53:59,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:53:59,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:53:59,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:53:59,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:53:59,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:53:55" (1/3) ... [2018-11-07 12:53:59,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df20f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:59, skipping insertion in model container [2018-11-07 12:53:59,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:55" (2/3) ... [2018-11-07 12:53:59,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df20f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:59, skipping insertion in model container [2018-11-07 12:53:59,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:59" (3/3) ... [2018-11-07 12:53:59,498 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label23_true-unreach-call_false-termination.c [2018-11-07 12:53:59,509 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:53:59,520 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:53:59,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:53:59,577 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:53:59,577 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:53:59,577 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:53:59,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:53:59,578 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:53:59,578 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:53:59,578 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:53:59,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:53:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:53:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 12:53:59,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:59,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:59,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:59,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1739350872, now seen corresponding path program 1 times [2018-11-07 12:53:59,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:59,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:59,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:59,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:00,340 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:00,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:00,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:54:00,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:00,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:00,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:00,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:00,460 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:54:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:02,258 INFO L93 Difference]: Finished difference Result 621 states and 1060 transitions. [2018-11-07 12:54:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:02,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-07 12:54:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:02,280 INFO L225 Difference]: With dead ends: 621 [2018-11-07 12:54:02,280 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 12:54:02,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 12:54:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-07 12:54:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 12:54:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 637 transitions. [2018-11-07 12:54:02,379 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 637 transitions. Word has length 140 [2018-11-07 12:54:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:02,380 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 637 transitions. [2018-11-07 12:54:02,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 637 transitions. [2018-11-07 12:54:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 12:54:02,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:02,388 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:02,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:02,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash -994164683, now seen corresponding path program 1 times [2018-11-07 12:54:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:02,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:02,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:02,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:54:02,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:02,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:54:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:54:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:54:02,808 INFO L87 Difference]: Start difference. First operand 381 states and 637 transitions. Second operand 5 states. [2018-11-07 12:54:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:04,615 INFO L93 Difference]: Finished difference Result 901 states and 1555 transitions. [2018-11-07 12:54:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:54:04,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-11-07 12:54:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:04,622 INFO L225 Difference]: With dead ends: 901 [2018-11-07 12:54:04,623 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 12:54:04,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:54:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 12:54:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 12:54:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 12:54:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 632 transitions. [2018-11-07 12:54:04,659 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 632 transitions. Word has length 149 [2018-11-07 12:54:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:04,659 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 632 transitions. [2018-11-07 12:54:04,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:54:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 632 transitions. [2018-11-07 12:54:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 12:54:04,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:04,665 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:04,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:04,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:04,666 INFO L82 PathProgramCache]: Analyzing trace with hash -408118830, now seen corresponding path program 1 times [2018-11-07 12:54:04,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:04,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:04,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:04,957 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:05,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:05,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:54:05,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:05,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:54:05,017 INFO L87 Difference]: Start difference. First operand 380 states and 632 transitions. Second operand 6 states. [2018-11-07 12:54:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:07,605 INFO L93 Difference]: Finished difference Result 1184 states and 2066 transitions. [2018-11-07 12:54:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:54:07,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-11-07 12:54:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:07,614 INFO L225 Difference]: With dead ends: 1184 [2018-11-07 12:54:07,615 INFO L226 Difference]: Without dead ends: 810 [2018-11-07 12:54:07,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 12:54:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-07 12:54:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 800. [2018-11-07 12:54:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-07 12:54:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1274 transitions. [2018-11-07 12:54:07,668 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1274 transitions. Word has length 174 [2018-11-07 12:54:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:07,668 INFO L480 AbstractCegarLoop]: Abstraction has 800 states and 1274 transitions. [2018-11-07 12:54:07,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1274 transitions. [2018-11-07 12:54:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 12:54:07,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:07,674 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:07,674 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:07,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash 464706266, now seen corresponding path program 1 times [2018-11-07 12:54:07,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:07,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:07,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:07,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:07,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:07,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:07,998 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:07,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 12:54:08,001 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:08,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:08,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:09,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:09,422 INFO L272 AbstractInterpreter]: Visited 143 different actions 282 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:54:09,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:09,479 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:10,413 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 83.33% of their original sizes. [2018-11-07 12:54:10,413 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:11,725 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-07 12:54:11,726 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:11,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:11,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-07 12:54:11,727 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:11,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:54:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:54:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:54:11,729 INFO L87 Difference]: Start difference. First operand 800 states and 1274 transitions. Second operand 12 states. [2018-11-07 12:54:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:30,337 INFO L93 Difference]: Finished difference Result 2331 states and 3671 transitions. [2018-11-07 12:54:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:54:30,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2018-11-07 12:54:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:30,355 INFO L225 Difference]: With dead ends: 2331 [2018-11-07 12:54:30,355 INFO L226 Difference]: Without dead ends: 1537 [2018-11-07 12:54:30,358 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-07 12:54:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-07 12:54:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1534. [2018-11-07 12:54:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2018-11-07 12:54:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2086 transitions. [2018-11-07 12:54:30,425 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2086 transitions. Word has length 175 [2018-11-07 12:54:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:30,426 INFO L480 AbstractCegarLoop]: Abstraction has 1534 states and 2086 transitions. [2018-11-07 12:54:30,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:54:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2086 transitions. [2018-11-07 12:54:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 12:54:30,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:30,434 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:30,434 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:30,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2109985497, now seen corresponding path program 1 times [2018-11-07 12:54:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:30,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:30,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 12:54:31,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:31,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:31,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-07 12:54:31,112 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:31,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:31,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:31,764 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:31,764 INFO L272 AbstractInterpreter]: Visited 144 different actions 430 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:31,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:31,768 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:32,761 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 82.49% of their original sizes. [2018-11-07 12:54:32,762 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:35,581 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-11-07 12:54:35,581 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:35,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:35,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-07 12:54:35,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:35,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:54:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:54:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:54:35,583 INFO L87 Difference]: Start difference. First operand 1534 states and 2086 transitions. Second operand 14 states. [2018-11-07 12:54:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:48,941 INFO L93 Difference]: Finished difference Result 3227 states and 4624 transitions. [2018-11-07 12:54:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 12:54:48,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-11-07 12:54:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:48,953 INFO L225 Difference]: With dead ends: 3227 [2018-11-07 12:54:48,953 INFO L226 Difference]: Without dead ends: 2139 [2018-11-07 12:54:48,958 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 124 SyntacticMatches, 48 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:54:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-07 12:54:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2132. [2018-11-07 12:54:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-11-07 12:54:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2797 transitions. [2018-11-07 12:54:49,023 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2797 transitions. Word has length 185 [2018-11-07 12:54:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:49,024 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2797 transitions. [2018-11-07 12:54:49,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:54:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2797 transitions. [2018-11-07 12:54:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 12:54:49,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:49,033 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:49,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:49,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1738206433, now seen corresponding path program 1 times [2018-11-07 12:54:49,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:49,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:49,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:49,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:49,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:49,168 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-07 12:54:49,169 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:49,173 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:49,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:49,522 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:49,522 INFO L272 AbstractInterpreter]: Visited 144 different actions 291 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:54:49,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:49,529 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:49,906 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 83.33% of their original sizes. [2018-11-07 12:54:49,907 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:50,177 INFO L415 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-11-07 12:54:50,178 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:50,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:50,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-07 12:54:50,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:50,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 12:54:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 12:54:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:54:50,180 INFO L87 Difference]: Start difference. First operand 2132 states and 2797 transitions. Second operand 13 states. [2018-11-07 12:55:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:04,029 INFO L93 Difference]: Finished difference Result 4187 states and 5754 transitions. [2018-11-07 12:55:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:55:04,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 189 [2018-11-07 12:55:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:04,042 INFO L225 Difference]: With dead ends: 4187 [2018-11-07 12:55:04,042 INFO L226 Difference]: Without dead ends: 2736 [2018-11-07 12:55:04,048 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:55:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2018-11-07 12:55:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2728. [2018-11-07 12:55:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-11-07 12:55:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 3540 transitions. [2018-11-07 12:55:04,132 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 3540 transitions. Word has length 189 [2018-11-07 12:55:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:04,133 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 3540 transitions. [2018-11-07 12:55:04,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 12:55:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3540 transitions. [2018-11-07 12:55:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 12:55:04,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:04,144 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:04,144 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:04,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1029888413, now seen corresponding path program 1 times [2018-11-07 12:55:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:04,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:04,396 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:55:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:55:05,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:05,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:05,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 12:55:05,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:05,204 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:05,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:06,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:06,024 INFO L272 AbstractInterpreter]: Visited 146 different actions 434 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:06,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:06,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:06,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:06,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:06,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:06,042 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:06,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:55:06,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:06,733 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:55:06,836 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:55:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:55:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:07,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 12:55:07,394 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:07,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:55:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:55:07,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:55:07,396 INFO L87 Difference]: Start difference. First operand 2728 states and 3540 transitions. Second operand 14 states. [2018-11-07 12:55:08,372 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-07 12:55:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:11,817 INFO L93 Difference]: Finished difference Result 6288 states and 8910 transitions. [2018-11-07 12:55:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 12:55:11,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 211 [2018-11-07 12:55:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:11,835 INFO L225 Difference]: With dead ends: 6288 [2018-11-07 12:55:11,835 INFO L226 Difference]: Without dead ends: 3114 [2018-11-07 12:55:11,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 12:55:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2018-11-07 12:55:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3042. [2018-11-07 12:55:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-11-07 12:55:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 3577 transitions. [2018-11-07 12:55:11,927 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 3577 transitions. Word has length 211 [2018-11-07 12:55:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:11,927 INFO L480 AbstractCegarLoop]: Abstraction has 3042 states and 3577 transitions. [2018-11-07 12:55:11,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:55:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 3577 transitions. [2018-11-07 12:55:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 12:55:11,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:11,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:11,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:11,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 113011449, now seen corresponding path program 1 times [2018-11-07 12:55:11,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:11,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:11,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:55:12,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:12,234 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:12,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-07 12:55:12,234 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:12,239 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:12,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:13,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:13,415 INFO L272 AbstractInterpreter]: Visited 145 different actions 431 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:13,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:13,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:13,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:13,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:13,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:13,473 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:13,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:55:13,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:55:14,271 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:14,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-07 12:55:14,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:14,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:55:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:55:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:55:14,276 INFO L87 Difference]: Start difference. First operand 3042 states and 3577 transitions. Second operand 3 states. [2018-11-07 12:55:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:15,506 INFO L93 Difference]: Finished difference Result 5789 states and 6977 transitions. [2018-11-07 12:55:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:55:15,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-07 12:55:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:15,523 INFO L225 Difference]: With dead ends: 5789 [2018-11-07 12:55:15,523 INFO L226 Difference]: Without dead ends: 3889 [2018-11-07 12:55:15,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:55:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2018-11-07 12:55:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3826. [2018-11-07 12:55:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-07 12:55:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4465 transitions. [2018-11-07 12:55:15,616 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4465 transitions. Word has length 227 [2018-11-07 12:55:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:15,617 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 4465 transitions. [2018-11-07 12:55:15,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:55:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4465 transitions. [2018-11-07 12:55:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 12:55:15,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:15,630 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:15,631 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2042894620, now seen corresponding path program 1 times [2018-11-07 12:55:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:15,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 130 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:55:16,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:16,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:16,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-07 12:55:16,076 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:16,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:16,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:16,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:16,662 INFO L272 AbstractInterpreter]: Visited 145 different actions 433 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:16,699 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:17,122 INFO L227 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 81.06% of their original sizes. [2018-11-07 12:55:17,123 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:17,307 INFO L415 sIntCurrentIteration]: We unified 254 AI predicates to 254 [2018-11-07 12:55:17,308 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:17,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:17,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:55:17,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:17,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:17,309 INFO L87 Difference]: Start difference. First operand 3826 states and 4465 transitions. Second operand 11 states. [2018-11-07 12:55:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:25,215 INFO L93 Difference]: Finished difference Result 7479 states and 9006 transitions. [2018-11-07 12:55:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:55:25,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 255 [2018-11-07 12:55:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:25,235 INFO L225 Difference]: With dead ends: 7479 [2018-11-07 12:55:25,235 INFO L226 Difference]: Without dead ends: 4719 [2018-11-07 12:55:25,244 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:55:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2018-11-07 12:55:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4589. [2018-11-07 12:55:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2018-11-07 12:55:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5231 transitions. [2018-11-07 12:55:25,346 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5231 transitions. Word has length 255 [2018-11-07 12:55:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:25,347 INFO L480 AbstractCegarLoop]: Abstraction has 4589 states and 5231 transitions. [2018-11-07 12:55:25,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:55:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5231 transitions. [2018-11-07 12:55:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-07 12:55:25,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:25,362 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:25,362 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:25,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1279752066, now seen corresponding path program 1 times [2018-11-07 12:55:25,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:25,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:25,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:25,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 140 proven. 70 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 12:55:25,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:25,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:25,578 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-11-07 12:55:25,578 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:25,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:25,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:26,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:26,571 INFO L272 AbstractInterpreter]: Visited 150 different actions 604 times. Merged at 10 different actions 44 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:55:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:26,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:26,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:26,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:26,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:26,588 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:26,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-07 12:55:26,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 167 proven. 34 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 12:55:26,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:26,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 12:55:26,968 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 12:55:26,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 12:55:26,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:26,969 INFO L87 Difference]: Start difference. First operand 4589 states and 5231 transitions. Second operand 9 states. [2018-11-07 12:55:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:30,229 INFO L93 Difference]: Finished difference Result 10484 states and 12305 transitions. [2018-11-07 12:55:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 12:55:30,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2018-11-07 12:55:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:30,257 INFO L225 Difference]: With dead ends: 10484 [2018-11-07 12:55:30,257 INFO L226 Difference]: Without dead ends: 5558 [2018-11-07 12:55:30,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=1152, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 12:55:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2018-11-07 12:55:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 4874. [2018-11-07 12:55:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2018-11-07 12:55:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 5429 transitions. [2018-11-07 12:55:30,381 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 5429 transitions. Word has length 270 [2018-11-07 12:55:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:30,381 INFO L480 AbstractCegarLoop]: Abstraction has 4874 states and 5429 transitions. [2018-11-07 12:55:30,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 12:55:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 5429 transitions. [2018-11-07 12:55:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-07 12:55:30,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:30,400 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:30,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:30,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 91888909, now seen corresponding path program 1 times [2018-11-07 12:55:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:30,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 12:55:30,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:30,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:30,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-07 12:55:30,874 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [791], [793], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:30,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:30,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:35,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:35,462 INFO L272 AbstractInterpreter]: Visited 147 different actions 3122 times. Merged at 9 different actions 258 times. Widened at 1 different actions 18 times. Found 59 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:35,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:35,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:35,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:35,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:35,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:35,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:35,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 12:55:35,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-07 12:55:36,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:36,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-07 12:55:36,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:36,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 12:55:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 12:55:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 12:55:36,040 INFO L87 Difference]: Start difference. First operand 4874 states and 5429 transitions. Second operand 7 states. [2018-11-07 12:55:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:37,165 INFO L93 Difference]: Finished difference Result 8217 states and 9271 transitions. [2018-11-07 12:55:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:55:37,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 327 [2018-11-07 12:55:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:37,168 INFO L225 Difference]: With dead ends: 8217 [2018-11-07 12:55:37,168 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:55:37,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:55:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:55:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:55:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:55:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:55:37,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 327 [2018-11-07 12:55:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:37,188 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:55:37,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 12:55:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:55:37,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:55:37,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:55:37,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:37,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,005 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 205 [2018-11-07 12:55:38,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:38,591 WARN L179 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 210 [2018-11-07 12:55:38,911 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-07 12:55:39,293 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2018-11-07 12:55:49,780 WARN L179 SmtUtils]: Spent 10.47 s on a formula simplification. DAG size of input: 339 DAG size of output: 81 [2018-11-07 12:55:50,955 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 236 DAG size of output: 106 [2018-11-07 12:55:52,156 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 238 DAG size of output: 99 [2018-11-07 12:55:52,159 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:52,159 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 12:55:52,159 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:55:52,160 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:52,161 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:55:52,162 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:55:52,163 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,164 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:55:52,165 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,166 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:55:52,167 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,168 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:55:52,169 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,170 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:52,171 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:55:52,172 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,173 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:55:52,174 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,175 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 571) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:55:52,176 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,177 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,178 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,178 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,178 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (= |old(~a11~0)| ~a11~0)) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse14 (= ~a19~0 |old(~a19~0)|)) (.cse3 (= ~a28~0 |old(~a28~0)|)) (.cse15 (= ~a25~0 |old(~a25~0)|))) (let ((.cse12 (< 7 |old(~a28~0)|)) (.cse4 (= 8 |old(~a28~0)|)) (.cse6 (< 7 |old(~a17~0)|)) (.cse5 (= 9 |old(~a28~0)|)) (.cse13 (< 0 |old(~a19~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse9 (= 1 |old(~a11~0)|)) (.cse7 (not (= 1 |old(~a25~0)|))) (.cse10 (and .cse1 .cse2 .cse14 .cse3 .cse15)) (.cse8 (not (= 1 |old(~a19~0)|))) (.cse11 (not (= |old(~a17~0)| 8)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 (not (= 8 |old(~a17~0)|)) (and (= 1 ~a11~0) (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not .cse5) (not .cse9)) (or .cse0 .cse9 .cse10 .cse8 .cse4 .cse11) (or .cse0 .cse12 .cse10 .cse11 .cse13) (or .cse0 .cse12 .cse7 .cse8 .cse11 (and .cse2 .cse1 .cse14 .cse3 .cse15)) (or .cse0 (and .cse1 (<= ~a19~0 0) .cse2 .cse3) .cse4 .cse13 .cse6) (or .cse0 .cse9 .cse5 .cse11 .cse13 .cse10) (or (< 6 |calculate_output_#in~input|) (and .cse1 (= ~a17~0 8) .cse14 .cse3 .cse15) (or .cse0 .cse8 (< 1 |old(~a25~0)|) (< |old(~a28~0)| 9) (< |old(~a25~0)| 0)) (< 11 |old(~a28~0)|) .cse11 (< |calculate_output_#in~input| 1)) (or .cse0 .cse9 .cse7 .cse10 .cse8 .cse11)))) [2018-11-07 12:55:52,178 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,178 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:55:52,179 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,180 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:55:52,181 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,182 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:55:52,183 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:55:52,184 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:52,185 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 12:55:52,185 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:55:52,185 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:52,185 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a11~0 0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:55:52,185 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:55:52,186 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (<= ~a28~0 7)) (.cse4 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse5 (<= ~a19~0 0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (not (= ~a11~0 1))) (.cse7 (<= ~a17~0 7)) (.cse1 (not (= ~a28~0 8))) (.cse8 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse5 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse6 .cse0 .cse4 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse5 .cse0 .cse3 .cse8) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a17~0 8) (= ~a19~0 1) (<= 9 ~a28~0) (<= ~a25~0 1)) (and .cse7 .cse1 .cse8) (not (= 6 ~f~0)))) [2018-11-07 12:55:52,186 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:52,186 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:52,186 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (<= ~a28~0 7)) (.cse4 (= 1 ~a25~0)) (.cse2 (= 1 ~a19~0)) (.cse5 (<= ~a19~0 0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse3 (not (= ~a11~0 1))) (.cse7 (<= ~a17~0 7)) (.cse1 (not (= ~a28~0 8))) (.cse8 (not (= ~a28~0 9)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (= 9 ~a28~0) (= 8 ~a17~0) .cse2) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse4 .cse2 .cse3) (and .cse5 .cse6 .cse0) (and .cse7 .cse5 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse6 .cse0 .cse4 .cse2) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse5 .cse0 .cse3 .cse8) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (and (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a19~0 1) (<= 9 ~a28~0) (<= ~a25~0 1)) (= ~a17~0 8)) (not (= |old(~a17~0)| 8)) (and .cse7 .cse1 .cse8) (not (= 6 ~f~0)))) [2018-11-07 12:55:52,186 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:55:52,186 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:55:52,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:55:52 BoogieIcfgContainer [2018-11-07 12:55:52,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:55:52,202 INFO L168 Benchmark]: Toolchain (without parser) took 117064.42 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 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:52,203 INFO L168 Benchmark]: CDTParser took 0.25 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-11-07 12:55:52,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:52,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:52,205 INFO L168 Benchmark]: Boogie Preprocessor took 123.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:55:52,206 INFO L168 Benchmark]: RCFGBuilder took 3304.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:52,206 INFO L168 Benchmark]: TraceAbstraction took 112710.31 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.1 GB in the beginning and 2.9 GB in the end (delta: -752.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:52,211 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.25 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 773.85 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 145.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.44 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3304.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112710.31 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.1 GB in the beginning and 2.9 GB in the end (delta: -752.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 571]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((\old(a17) == a17 && !(a28 == 8)) && 1 == a19) && !(a11 == 1)) || !(a21 == 1)) || !(y == 25)) || (((\old(a17) == a17 && 1 == a25) && 1 == a19) && !(a11 == 1))) || ((a19 <= 0 && a28 <= 7) && \old(a17) == a17)) || ((a17 <= 7 && a19 <= 0) && !(a28 == 8))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a28 <= 7 && \old(a17) == a17) && 1 == a25) && 1 == a19)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || (((a19 <= 0 && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9))) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || (((((a28 <= 11 && 0 <= a25) && a17 == 8) && a19 == 1) && 9 <= a28) && a25 <= 1)) || ((a17 <= 7 && !(a28 == 8)) && !(a28 == 9))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 112.6s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 70.2s AutomataDifference, 0.0s DeadEndRemovalTime, 14.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1601 SDtfs, 11958 SDslu, 1681 SDs, 0 SdLazy, 15893 SolverSat, 2631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3048 GetRequests, 2815 SyntacticMatches, 58 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.7s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9977697419057708 AbsIntWeakeningRatio, 0.165 AbsIntAvgWeakeningVarsNumRemoved, 21.74375 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 978 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 166 PreInvPairs, 267 NumberOfFragments, 856 HoareAnnotationTreeSize, 166 FomulaSimplifications, 14251 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16996 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3337 NumberOfCodeBlocks, 3337 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2389459 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2334 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 2895/3109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...