java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:07:47,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:07:47,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:07:47,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:07:47,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:07:47,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:07:47,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:07:47,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:07:47,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:07:47,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:07:47,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:07:47,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:07:47,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:07:47,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:07:47,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:07:47,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:07:47,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:07:47,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:07:47,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:07:47,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:07:47,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:07:47,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:07:47,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:07:47,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:07:47,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:07:47,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:07:47,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:07:47,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:07:47,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:07:47,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:07:47,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:07:47,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:07:47,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:07:47,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:07:47,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:07:47,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:07:47,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:07:47,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:07:47,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:07:47,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:07:47,327 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:07:47,328 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:07:47,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:07:47,331 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:07:47,331 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:07:47,331 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:07:47,331 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:07:47,332 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:07:47,332 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:07:47,332 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:07:47,332 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:07:47,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:07:47,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:07:47,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:07:47,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:07:47,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:07:47,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:07:47,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:07:47,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:07:47,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:07:47,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:07:47,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:07:47,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:07:47,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:07:47,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:07:47,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:07:47,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:07:47,338 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:07:47,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:07:47,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:07:47,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:07:47,339 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:07:47,339 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:07:47,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:07:47,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:07:47,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:07:47,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:07:47,414 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:07:47,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-10-25 00:07:47,480 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc79929c3/abd408d246e24639880754b02ba7acbe/FLAG8f8cda276 [2018-10-25 00:07:48,078 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:07:48,079 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2018-10-25 00:07:48,094 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc79929c3/abd408d246e24639880754b02ba7acbe/FLAG8f8cda276 [2018-10-25 00:07:48,122 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cc79929c3/abd408d246e24639880754b02ba7acbe [2018-10-25 00:07:48,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:07:48,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:07:48,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:48,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:07:48,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:07:48,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:48,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48, skipping insertion in model container [2018-10-25 00:07:48,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:48,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:07:48,232 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:07:48,749 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:48,753 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:07:48,884 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:07:48,904 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:07:48,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48 WrapperNode [2018-10-25 00:07:48,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:07:48,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:48,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:07:48,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:07:48,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:48,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:07:49,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:07:49,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:07:49,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:07:49,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... [2018-10-25 00:07:49,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:07:49,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:07:49,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:07:49,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:07:49,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:07:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:07:49,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:07:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:07:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:07:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:07:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:07:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:07:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:07:52,402 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:07:52,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:52 BoogieIcfgContainer [2018-10-25 00:07:52,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:07:52,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:07:52,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:07:52,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:07:52,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:07:48" (1/3) ... [2018-10-25 00:07:52,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:52, skipping insertion in model container [2018-10-25 00:07:52,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:07:48" (2/3) ... [2018-10-25 00:07:52,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:07:52, skipping insertion in model container [2018-10-25 00:07:52,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:07:52" (3/3) ... [2018-10-25 00:07:52,415 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2018-10-25 00:07:52,426 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:07:52,438 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:07:52,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:07:52,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:07:52,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:07:52,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:07:52,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:07:52,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:07:52,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:07:52,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:07:52,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:07:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:07:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 00:07:52,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:52,540 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] [2018-10-25 00:07:52,542 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:52,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1592268880, now seen corresponding path program 1 times [2018-10-25 00:07:52,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:52,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:52,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:52,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:52,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:53,207 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:07:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:53,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:07:53,307 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:53,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:07:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:07:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:53,338 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:07:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:54,881 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:07:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:07:54,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-25 00:07:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:54,913 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:07:54,913 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:07:54,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:07:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:07:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:07:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:07:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:07:55,012 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 118 [2018-10-25 00:07:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:55,013 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:07:55,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:07:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:07:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-25 00:07:55,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:55,028 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] [2018-10-25 00:07:55,028 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:55,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1462652163, now seen corresponding path program 1 times [2018-10-25 00:07:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:55,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:55,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:55,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:55,645 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:07:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:55,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:55,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:07:55,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:55,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:07:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:07:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:07:55,862 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:07:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:57,385 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:07:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:07:57,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-25 00:07:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:57,391 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:07:57,391 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:07:57,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:07:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:07:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:07:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:07:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:07:57,422 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 127 [2018-10-25 00:07:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:57,423 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:07:57,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:07:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:07:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 00:07:57,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:57,426 INFO L375 BasicCegarLoop]: trace histogram [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-10-25 00:07:57,427 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:57,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1825296655, now seen corresponding path program 1 times [2018-10-25 00:07:57,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:57,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:57,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:58,187 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-25 00:07:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:07:58,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:07:58,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:58,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:07:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:07:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:07:58,318 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:08:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:00,130 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:08:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:00,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-25 00:08:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:00,137 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:08:00,137 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:08:00,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:08:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:08:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:08:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:08:00,165 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 133 [2018-10-25 00:08:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:00,165 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:08:00,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:08:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 00:08:00,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:00,168 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-25 00:08:00,168 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:00,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1056401542, now seen corresponding path program 1 times [2018-10-25 00:08:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:00,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:00,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:00,361 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:00,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:00,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:00,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:00,416 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:08:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:03,833 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:08:03,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:03,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-25 00:08:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:03,839 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:08:03,840 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:08:03,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:08:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:08:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:08:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:08:03,877 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 141 [2018-10-25 00:08:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:03,877 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:08:03,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:08:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 00:08:03,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:03,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:03,882 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:03,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2142875510, now seen corresponding path program 1 times [2018-10-25 00:08:03,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:03,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:04,301 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:04,551 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:04,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:04,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:04,615 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:04,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:04,617 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:08:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:05,781 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:08:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:05,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 00:08:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:05,791 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:08:05,792 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:08:05,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:08:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:08:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:08:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:08:05,832 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 143 [2018-10-25 00:08:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:05,832 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:08:05,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:08:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 00:08:05,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:05,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:05,836 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:05,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1822889842, now seen corresponding path program 1 times [2018-10-25 00:08:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:05,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:06,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:06,074 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:06,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:06,075 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:08:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:07,022 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:08:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:07,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-10-25 00:08:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:07,027 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:08:07,027 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:08:07,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:08:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:08:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:08:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:08:07,054 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 145 [2018-10-25 00:08:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:07,054 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:08:07,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:08:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 00:08:07,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:07,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:07,058 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:07,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2129057642, now seen corresponding path program 1 times [2018-10-25 00:08:07,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:07,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:07,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:07,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:07,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:07,283 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:08:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:08,945 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:08:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:08,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-25 00:08:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:08,956 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:08:08,957 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:08:08,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:08:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:08:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:08:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:08:09,007 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 149 [2018-10-25 00:08:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:09,008 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:08:09,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:08:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-25 00:08:09,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:09,014 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:09,015 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:09,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -702189192, now seen corresponding path program 1 times [2018-10-25 00:08:09,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:09,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:09,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:09,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:09,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:09,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:09,467 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-25 00:08:09,470 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], [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], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:09,543 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:09,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:10,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:10,644 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:08:10,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:10,692 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:11,975 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 80.92% of their original sizes. [2018-10-25 00:08:11,976 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:14,196 INFO L413 sIntCurrentIteration]: We have 183 unified AI predicates [2018-10-25 00:08:14,196 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:14,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:14,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:08:14,198 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:14,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:08:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:08:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:14,199 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-10-25 00:08:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:27,906 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-10-25 00:08:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:08:27,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-10-25 00:08:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:27,919 INFO L225 Difference]: With dead ends: 3925 [2018-10-25 00:08:27,919 INFO L226 Difference]: Without dead ends: 2373 [2018-10-25 00:08:27,926 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 53 SyntacticMatches, 122 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:08:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-25 00:08:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-10-25 00:08:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-10-25 00:08:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-10-25 00:08:27,998 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 184 [2018-10-25 00:08:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:27,999 INFO L481 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-10-25 00:08:27,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:08:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-10-25 00:08:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-25 00:08:28,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:28,009 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] [2018-10-25 00:08:28,009 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:28,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1613721515, now seen corresponding path program 1 times [2018-10-25 00:08:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:28,011 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:28,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:28,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:28,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-10-25 00:08:28,490 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], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:28,495 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:28,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:28,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:28,976 INFO L272 AbstractInterpreter]: Visited 124 different actions 369 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:28,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:28,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:28,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:28,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:28,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:29,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:29,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:08:30,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:30,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:08:30,022 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:30,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:08:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:08:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:08:30,024 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-10-25 00:08:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:34,579 INFO L93 Difference]: Finished difference Result 7743 states and 10793 transitions. [2018-10-25 00:08:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:08:34,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-10-25 00:08:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:34,601 INFO L225 Difference]: With dead ends: 7743 [2018-10-25 00:08:34,601 INFO L226 Difference]: Without dead ends: 3066 [2018-10-25 00:08:34,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:08:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-10-25 00:08:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3043. [2018-10-25 00:08:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-10-25 00:08:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3614 transitions. [2018-10-25 00:08:34,701 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3614 transitions. Word has length 189 [2018-10-25 00:08:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:34,703 INFO L481 AbstractCegarLoop]: Abstraction has 3043 states and 3614 transitions. [2018-10-25 00:08:34,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:08:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3614 transitions. [2018-10-25 00:08:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-25 00:08:34,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:34,714 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-25 00:08:34,714 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:34,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1703504543, now seen corresponding path program 1 times [2018-10-25 00:08:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:34,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:35,112 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:08:35,302 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:08:35,700 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:08:35,907 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-25 00:08:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:36,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:36,389 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:36,390 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-10-25 00:08:36,391 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], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [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], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:36,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:36,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:37,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:37,388 INFO L272 AbstractInterpreter]: Visited 126 different actions 498 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:37,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:37,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:37,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:37,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-25 00:08:37,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:37,441 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:37,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:08:37,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:08:38,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:38,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2018-10-25 00:08:38,154 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:38,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-25 00:08:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-25 00:08:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:08:38,155 INFO L87 Difference]: Start difference. First operand 3043 states and 3614 transitions. Second operand 20 states. [2018-10-25 00:08:38,443 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-25 00:08:38,735 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-10-25 00:08:39,338 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-10-25 00:08:41,076 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2018-10-25 00:08:41,308 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-25 00:08:41,662 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-10-25 00:08:42,182 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-10-25 00:08:42,692 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-10-25 00:08:43,693 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-10-25 00:08:43,863 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-10-25 00:08:45,850 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2018-10-25 00:08:46,124 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-10-25 00:08:46,609 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2018-10-25 00:08:46,911 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-10-25 00:08:47,094 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-25 00:08:48,141 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2018-10-25 00:08:50,360 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-25 00:08:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:51,115 INFO L93 Difference]: Finished difference Result 7005 states and 9063 transitions. [2018-10-25 00:08:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-25 00:08:51,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 268 [2018-10-25 00:08:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:51,136 INFO L225 Difference]: With dead ends: 7005 [2018-10-25 00:08:51,136 INFO L226 Difference]: Without dead ends: 3740 [2018-10-25 00:08:51,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1295, Invalid=5185, Unknown=0, NotChecked=0, Total=6480 [2018-10-25 00:08:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2018-10-25 00:08:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3082. [2018-10-25 00:08:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-10-25 00:08:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3580 transitions. [2018-10-25 00:08:51,259 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3580 transitions. Word has length 268 [2018-10-25 00:08:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:51,260 INFO L481 AbstractCegarLoop]: Abstraction has 3082 states and 3580 transitions. [2018-10-25 00:08:51,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-25 00:08:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3580 transitions. [2018-10-25 00:08:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-25 00:08:51,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:51,271 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:51,272 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:51,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -936896460, now seen corresponding path program 1 times [2018-10-25 00:08:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:51,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:51,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:08:51,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:51,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:51,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-10-25 00:08:51,741 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], [202], [205], [209], [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], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:51,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:51,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:52,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:52,510 INFO L272 AbstractInterpreter]: Visited 124 different actions 367 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:08:52,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:52,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:52,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:52,537 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-25 00:08:52,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:52,553 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:52,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-25 00:08:52,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:08:53,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:53,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:08:53,070 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:53,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:08:53,072 INFO L87 Difference]: Start difference. First operand 3082 states and 3580 transitions. Second operand 9 states. [2018-10-25 00:08:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:55,744 INFO L93 Difference]: Finished difference Result 6217 states and 7251 transitions. [2018-10-25 00:08:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:08:55,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2018-10-25 00:08:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:55,754 INFO L225 Difference]: With dead ends: 6217 [2018-10-25 00:08:55,754 INFO L226 Difference]: Without dead ends: 2205 [2018-10-25 00:08:55,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-10-25 00:08:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-25 00:08:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2182. [2018-10-25 00:08:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-10-25 00:08:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2474 transitions. [2018-10-25 00:08:55,815 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2474 transitions. Word has length 271 [2018-10-25 00:08:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:55,816 INFO L481 AbstractCegarLoop]: Abstraction has 2182 states and 2474 transitions. [2018-10-25 00:08:55,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2474 transitions. [2018-10-25 00:08:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-25 00:08:55,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:55,826 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, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:08:55,826 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:55,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1348455113, now seen corresponding path program 1 times [2018-10-25 00:08:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:55,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-25 00:08:56,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:56,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:56,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 313 with the following transitions: [2018-10-25 00:08:56,353 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], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [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], [615], [617], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:56,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:56,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:57,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:57,121 INFO L272 AbstractInterpreter]: Visited 127 different actions 513 times. Merged at 9 different actions 45 times. Widened at 1 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:08:57,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:57,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:57,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:57,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:57,138 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:57,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-25 00:08:57,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-25 00:08:57,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:57,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-10-25 00:08:57,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:57,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:57,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:08:57,600 INFO L87 Difference]: Start difference. First operand 2182 states and 2474 transitions. Second operand 6 states. [2018-10-25 00:08:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:58,267 INFO L93 Difference]: Finished difference Result 3904 states and 4501 transitions. [2018-10-25 00:08:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:58,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2018-10-25 00:08:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,268 INFO L225 Difference]: With dead ends: 3904 [2018-10-25 00:08:58,268 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:08:58,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:08:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:08:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:08:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:08:58,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 312 [2018-10-25 00:08:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,280 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:08:58,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:08:58,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:08:58,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:08:58,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,684 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 147 [2018-10-25 00:08:58,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:58,942 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 157 [2018-10-25 00:08:59,616 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2018-10-25 00:09:00,230 WARN L179 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2018-10-25 00:09:02,685 WARN L179 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 208 DAG size of output: 77 [2018-10-25 00:09:03,522 WARN L179 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 57 [2018-10-25 00:09:04,354 WARN L179 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 57 [2018-10-25 00:09:04,357 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:04,357 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:09:04,357 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:04,358 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:04,359 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:04,360 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:04,361 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,362 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:04,363 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,364 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:04,365 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,366 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:04,367 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,368 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:04,369 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:04,370 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,371 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:04,372 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,373 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:04,374 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,375 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,376 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= |old(~a11~0)| ~a11~0)) (.cse17 (= ~a19~0 |old(~a19~0)|)) (.cse23 (= 1 |old(~a19~0)|)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse12 (= 1 ~a11~0)) (.cse16 (= ~a28~0 |old(~a28~0)|)) (.cse18 (= ~a25~0 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse19 (= 1 |old(~a25~0)|))) (let ((.cse5 (= 9 |old(~a28~0)|)) (.cse8 (not (= 7 |old(~a28~0)|))) (.cse21 (= 8 ~a17~0)) (.cse13 (= 1 ~a19~0)) (.cse9 (not .cse19)) (.cse20 (not (= 8 |old(~a17~0)|))) (.cse24 (not (= 10 |old(~a28~0)|))) (.cse11 (not .cse1)) (.cse22 (and .cse15 .cse12 .cse16 .cse18)) (.cse2 (= 8 |old(~a28~0)|)) (.cse3 (< 7 |old(~a17~0)|)) (.cse4 (< 10 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse10 (not .cse23)) (.cse6 (not (= |old(~a17~0)| 8))) (.cse7 (and .cse14 .cse15 .cse17 .cse16 .cse18))) (and (or .cse0 .cse1 .cse2 (not (= ~a11~0 1)) .cse3) (or .cse4 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) (not (= 7 |old(~a17~0)|))) (or (and .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse0 .cse1 .cse5 .cse6 .cse19)) (or .cse0 .cse9 .cse10 .cse20 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) .cse21 .cse13) (not .cse5) .cse11) (or .cse4 .cse0 .cse22 .cse2 .cse6 .cse11 .cse19) (or .cse23 .cse0 .cse8 .cse20 (not .cse13) .cse19) (or .cse0 .cse1 .cse9 .cse10 .cse20 (and .cse14 .cse21 .cse17 .cse16 .cse18)) (or .cse13 .cse0 .cse24 .cse9 .cse10 .cse20) (or .cse0 .cse24 .cse6 .cse11 .cse22) (or (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) .cse16) .cse0 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse10 .cse6 .cse7)))) [2018-10-25 00:09:04,376 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,376 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,376 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,376 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:04,377 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,378 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:04,379 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:04,380 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:04,381 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:04,382 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:04,383 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:04,384 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-25 00:09:04,384 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:04,384 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:04,384 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-25 00:09:04,384 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:04,384 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (not (= ~a28~0 9))) (.cse6 (= 1 ~a11~0)) (.cse1 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a11~0 |old(~a11~0)|)) (.cse8 (= 1 ~a19~0)) (.cse7 (= 8 ~a17~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (and (and .cse1 .cse2 .cse3 .cse4) .cse5) (not (= 0 |old(~a11~0)|)) (and .cse5 .cse2 .cse3 .cse0 .cse4) (and .cse6 (= 9 ~a28~0) .cse7 .cse8) (not (= 0 |old(~a25~0)|)) (and .cse5 .cse2 .cse3 .cse8) (and (and .cse2 (= 10 ~a28~0)) .cse6) (and .cse6 (and .cse1 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse5 (= 1 ~a25~0) .cse8 .cse7))) [2018-10-25 00:09:04,384 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:04,385 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:04,385 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (not (= ~a28~0 9))) (.cse6 (= 1 ~a11~0)) (.cse1 (not (= ~a25~0 1))) (.cse2 (= |old(~a17~0)| ~a17~0)) (.cse3 (<= ~a28~0 10)) (.cse0 (not (= ~a28~0 8))) (.cse5 (= ~a11~0 |old(~a11~0)|)) (.cse8 (= 1 ~a19~0)) (.cse7 (= 8 ~a17~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (<= ~a17~0 7) .cse0) (and (and .cse1 .cse2 .cse3 .cse4) .cse5) (not (= 0 |old(~a11~0)|)) (and .cse5 .cse2 .cse3 .cse0 .cse4) (and .cse6 (= 9 ~a28~0) .cse7 .cse8) (not (= 0 |old(~a25~0)|)) (and .cse5 .cse2 .cse3 .cse8) (and (and .cse2 (= 10 ~a28~0)) .cse6) (and .cse6 (and .cse1 .cse2 .cse3 .cse0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and .cse5 (= 1 ~a25~0) .cse8 .cse7))) [2018-10-25 00:09:04,385 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:04,385 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:04,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:04 BoogieIcfgContainer [2018-10-25 00:09:04,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:04,400 INFO L168 Benchmark]: Toolchain (without parser) took 76265.69 ms. Allocated memory was 1.6 GB in the beginning and 3.5 GB in the end (delta: 2.0 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 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:04,401 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:04,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.40 ms. Allocated memory is still 1.6 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-10-25 00:09:04,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.06 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:04,403 INFO L168 Benchmark]: Boogie Preprocessor took 102.16 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-10-25 00:09:04,403 INFO L168 Benchmark]: RCFGBuilder took 3191.35 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: 115.8 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:04,404 INFO L168 Benchmark]: TraceAbstraction took 71994.68 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -725.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:04,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.40 ms. Allocated memory is still 1.6 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 203.06 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.16 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 3191.35 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: 115.8 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71994.68 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -725.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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: ((((((((((((!(1 == a21) || !(7 == \old(a28))) || (a17 <= 7 && !(a28 == 8))) || ((((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 9)) && a11 == \old(a11))) || !(0 == \old(a11))) || ((((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || (((1 == a11 && 9 == a28) && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (((a11 == \old(a11) && \old(a17) == a17) && a28 <= 10) && 1 == a19)) || ((\old(a17) == a17 && 10 == a28) && 1 == a11)) || (1 == a11 && ((!(a25 == 1) && \old(a17) == a17) && a28 <= 10) && !(a28 == 8))) || !(1 == \old(a19))) || !(8 == \old(a17))) || (((a11 == \old(a11) && 1 == a25) && 1 == a19) && 8 == a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 71.9s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 46.8s AutomataDifference, 0.0s DeadEndRemovalTime, 6.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1312 SDtfs, 12044 SDslu, 2229 SDs, 0 SdLazy, 18415 SolverSat, 3172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2527 GetRequests, 2203 SyntacticMatches, 135 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.3s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9975658121270466 AbsIntWeakeningRatio, 0.18032786885245902 AbsIntAvgWeakeningVarsNumRemoved, 0.1366120218579235 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 815 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 136 PreInvPairs, 222 NumberOfFragments, 732 HoareAnnotationTreeSize, 136 FomulaSimplifications, 8217 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9319 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3220 NumberOfCodeBlocks, 3220 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4240 ConstructedInterpolants, 0 QuantifiedInterpolants, 3351177 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2344 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 3316/3422 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...