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/Problem01_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:01:39,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:01:39,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:01:39,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:01:39,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:01:39,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:01:39,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:01:39,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:01:39,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:01:39,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:01:39,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:01:39,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:01:39,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:01:39,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:01:39,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:01:39,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:01:39,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:01:39,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:01:39,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:01:39,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:01:39,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:01:39,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:01:39,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:01:39,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:01:39,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:01:39,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:01:39,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:01:39,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:01:39,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:01:39,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:01:39,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:01:39,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:01:39,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:01:39,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:01:39,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:01:39,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:01:39,308 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:01:39,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:01:39,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:01:39,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:01:39,339 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:01:39,339 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:01:39,339 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:01:39,342 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:01:39,343 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:01:39,343 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:01:39,343 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:01:39,343 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:01:39,343 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:01:39,344 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:01:39,344 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:01:39,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:01:39,345 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:01:39,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:01:39,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:01:39,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:01:39,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:01:39,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:01:39,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:01:39,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:01:39,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:01:39,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:01:39,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:01:39,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:01:39,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:01:39,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:01:39,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:01:39,350 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:01:39,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:01:39,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:01:39,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:01:39,351 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:01:39,351 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:01:39,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:01:39,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:01:39,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:01:39,433 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:01:39,433 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:01:39,434 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label17_true-unreach-call_false-termination.c [2018-10-25 00:01:39,491 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a2bbe2a83/2d376cd7fbb84619a5638ff28291e324/FLAG893d494d4 [2018-10-25 00:01:40,113 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:01:40,114 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label17_true-unreach-call_false-termination.c [2018-10-25 00:01:40,125 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a2bbe2a83/2d376cd7fbb84619a5638ff28291e324/FLAG893d494d4 [2018-10-25 00:01:40,140 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a2bbe2a83/2d376cd7fbb84619a5638ff28291e324 [2018-10-25 00:01:40,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:01:40,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:01:40,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:40,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:01:40,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:01:40,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:40,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7203e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40, skipping insertion in model container [2018-10-25 00:01:40,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:40,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:01:40,242 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:01:40,745 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:40,750 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:01:40,844 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:01:40,862 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:01:40,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40 WrapperNode [2018-10-25 00:01:40,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:01:40,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:40,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:01:40,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:01:40,873 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:01:40" (1/1) ... [2018-10-25 00:01:40,892 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:01:40" (1/1) ... [2018-10-25 00:01:40,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:01:41,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:01:41,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:01:41,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:01:41,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (1/1) ... [2018-10-25 00:01:41,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:01:41,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:01:41,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:01:41,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:01:41,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (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:01:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:01:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:01:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:01:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:01:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:01:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:01:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:01:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:01:44,255 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:01:44,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:44 BoogieIcfgContainer [2018-10-25 00:01:44,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:01:44,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:01:44,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:01:44,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:01:44,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:01:40" (1/3) ... [2018-10-25 00:01:44,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff3c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:44, skipping insertion in model container [2018-10-25 00:01:44,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:40" (2/3) ... [2018-10-25 00:01:44,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ff3c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:01:44, skipping insertion in model container [2018-10-25 00:01:44,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:44" (3/3) ... [2018-10-25 00:01:44,265 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label17_true-unreach-call_false-termination.c [2018-10-25 00:01:44,277 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:01:44,287 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:01:44,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:01:44,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:01:44,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:01:44,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:01:44,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:01:44,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:01:44,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:01:44,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:01:44,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:01:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:01:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 00:01:44,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:44,426 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:44,429 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:44,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:44,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1707442147, now seen corresponding path program 1 times [2018-10-25 00:01:44,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:44,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:44,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:44,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:44,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:45,103 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:01:45,222 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:01:45,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:45,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:45,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:45,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:45,252 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:01:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:46,750 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:01:46,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:46,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-10-25 00:01:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:46,772 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:01:46,772 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:01:46,779 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:01:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:01:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:01:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:01:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-10-25 00:01:46,860 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 123 [2018-10-25 00:01:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:46,861 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-10-25 00:01:46,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-10-25 00:01:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 00:01:46,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:46,868 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:01:46,868 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:46,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -568294122, now seen corresponding path program 1 times [2018-10-25 00:01:46,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:46,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:46,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:46,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:01:47,174 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:47,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:01:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:01:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:47,178 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 3 states. [2018-10-25 00:01:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:48,250 INFO L93 Difference]: Finished difference Result 946 states and 1654 transitions. [2018-10-25 00:01:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:01:48,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2018-10-25 00:01:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:48,257 INFO L225 Difference]: With dead ends: 946 [2018-10-25 00:01:48,258 INFO L226 Difference]: Without dead ends: 612 [2018-10-25 00:01:48,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:01:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-25 00:01:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-10-25 00:01:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-25 00:01:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 987 transitions. [2018-10-25 00:01:48,306 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 987 transitions. Word has length 141 [2018-10-25 00:01:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:48,307 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 987 transitions. [2018-10-25 00:01:48,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:01:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 987 transitions. [2018-10-25 00:01:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-25 00:01:48,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:48,316 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:01:48,316 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:48,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1913137078, now seen corresponding path program 1 times [2018-10-25 00:01:48,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:48,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:48,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:01:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:01:48,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:48,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:01:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:01:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:01:48,577 INFO L87 Difference]: Start difference. First operand 612 states and 987 transitions. Second operand 6 states. [2018-10-25 00:01:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:01:50,566 INFO L93 Difference]: Finished difference Result 1625 states and 2647 transitions. [2018-10-25 00:01:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:01:50,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-25 00:01:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:01:50,581 INFO L225 Difference]: With dead ends: 1625 [2018-10-25 00:01:50,581 INFO L226 Difference]: Without dead ends: 1019 [2018-10-25 00:01:50,585 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:01:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-10-25 00:01:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1009. [2018-10-25 00:01:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-10-25 00:01:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1456 transitions. [2018-10-25 00:01:50,646 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1456 transitions. Word has length 167 [2018-10-25 00:01:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:01:50,646 INFO L481 AbstractCegarLoop]: Abstraction has 1009 states and 1456 transitions. [2018-10-25 00:01:50,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:01:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1456 transitions. [2018-10-25 00:01:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-25 00:01:50,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:01:50,653 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:50,653 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:01:50,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1620857015, now seen corresponding path program 1 times [2018-10-25 00:01:50,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:01:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:50,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:01:50,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:01:50,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:01:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:01:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:01:50,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:01:50,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:01:50,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-25 00:01:50,943 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:01:51,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:01:51,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:01:52,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:01:52,233 INFO L272 AbstractInterpreter]: Visited 127 different actions 247 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:01:52,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:01:52,279 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:01:53,618 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-25 00:01:53,618 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:01:57,367 INFO L413 sIntCurrentIteration]: We have 178 unified AI predicates [2018-10-25 00:01:57,367 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:01:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:01:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:01:57,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:01:57,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:01:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:01:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:01:57,370 INFO L87 Difference]: Start difference. First operand 1009 states and 1456 transitions. Second operand 15 states. [2018-10-25 00:02:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:18,048 INFO L93 Difference]: Finished difference Result 3071 states and 4336 transitions. [2018-10-25 00:02:18,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:02:18,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 179 [2018-10-25 00:02:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:18,060 INFO L225 Difference]: With dead ends: 3071 [2018-10-25 00:02:18,060 INFO L226 Difference]: Without dead ends: 2068 [2018-10-25 00:02:18,066 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 62 SyntacticMatches, 103 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-10-25 00:02:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2018. [2018-10-25 00:02:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2018-10-25 00:02:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2585 transitions. [2018-10-25 00:02:18,129 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2585 transitions. Word has length 179 [2018-10-25 00:02:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:18,130 INFO L481 AbstractCegarLoop]: Abstraction has 2018 states and 2585 transitions. [2018-10-25 00:02:18,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:02:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2585 transitions. [2018-10-25 00:02:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-25 00:02:18,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:18,139 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:18,139 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:18,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash -754119044, now seen corresponding path program 1 times [2018-10-25 00:02:18,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:18,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:02:18,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:18,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:18,351 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-10-25 00:02:18,352 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:18,358 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:18,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:18,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:18,656 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:18,665 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:19,217 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 80.54% of their original sizes. [2018-10-25 00:02:19,217 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:19,348 INFO L413 sIntCurrentIteration]: We have 191 unified AI predicates [2018-10-25 00:02:19,348 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:19,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:02:19,349 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:19,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:02:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:02:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:19,350 INFO L87 Difference]: Start difference. First operand 2018 states and 2585 transitions. Second operand 10 states. [2018-10-25 00:02:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:28,090 INFO L93 Difference]: Finished difference Result 3795 states and 4965 transitions. [2018-10-25 00:02:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:28,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 192 [2018-10-25 00:02:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:28,101 INFO L225 Difference]: With dead ends: 3795 [2018-10-25 00:02:28,101 INFO L226 Difference]: Without dead ends: 2159 [2018-10-25 00:02:28,107 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2018-10-25 00:02:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2156. [2018-10-25 00:02:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2018-10-25 00:02:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2738 transitions. [2018-10-25 00:02:28,166 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2738 transitions. Word has length 192 [2018-10-25 00:02:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:28,167 INFO L481 AbstractCegarLoop]: Abstraction has 2156 states and 2738 transitions. [2018-10-25 00:02:28,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:02:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2738 transitions. [2018-10-25 00:02:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-25 00:02:28,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:28,176 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:28,176 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash 694680239, now seen corresponding path program 1 times [2018-10-25 00:02:28,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:28,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:28,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:28,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:28,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:02:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:28,341 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:28,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-10-25 00:02:28,342 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:28,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:28,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:29,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:29,235 INFO L272 AbstractInterpreter]: Visited 130 different actions 391 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:02:29,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:29,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:29,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:29,240 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:02:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:29,251 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:29,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-25 00:02:29,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:29,942 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:02:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 00:02:30,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:02:30,376 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:30,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:02:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:02:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:02:30,377 INFO L87 Difference]: Start difference. First operand 2156 states and 2738 transitions. Second operand 8 states. [2018-10-25 00:02:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:35,702 INFO L93 Difference]: Finished difference Result 7305 states and 9925 transitions. [2018-10-25 00:02:35,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:02:35,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 204 [2018-10-25 00:02:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:35,727 INFO L225 Difference]: With dead ends: 7305 [2018-10-25 00:02:35,727 INFO L226 Difference]: Without dead ends: 3715 [2018-10-25 00:02:35,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:02:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2018-10-25 00:02:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3623. [2018-10-25 00:02:35,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2018-10-25 00:02:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4283 transitions. [2018-10-25 00:02:35,853 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4283 transitions. Word has length 204 [2018-10-25 00:02:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:35,854 INFO L481 AbstractCegarLoop]: Abstraction has 3623 states and 4283 transitions. [2018-10-25 00:02:35,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:02:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4283 transitions. [2018-10-25 00:02:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-25 00:02:35,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:35,869 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:02:35,869 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:35,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1037869160, now seen corresponding path program 1 times [2018-10-25 00:02:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:35,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:02:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:36,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:36,104 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-10-25 00:02:36,105 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:36,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:36,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:36,600 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:36,600 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:36,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:36,640 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:37,785 INFO L232 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 80.73% of their original sizes. [2018-10-25 00:02:37,785 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:42,319 INFO L413 sIntCurrentIteration]: We have 224 unified AI predicates [2018-10-25 00:02:42,319 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:02:42,320 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:42,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:42,321 INFO L87 Difference]: Start difference. First operand 3623 states and 4283 transitions. Second operand 15 states. [2018-10-25 00:02:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:50,229 INFO L93 Difference]: Finished difference Result 7120 states and 8412 transitions. [2018-10-25 00:02:50,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:02:50,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 225 [2018-10-25 00:02:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:50,247 INFO L225 Difference]: With dead ends: 7120 [2018-10-25 00:02:50,248 INFO L226 Difference]: Without dead ends: 4135 [2018-10-25 00:02:50,259 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 75 SyntacticMatches, 136 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2018-10-25 00:02:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 4128. [2018-10-25 00:02:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2018-10-25 00:02:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 4815 transitions. [2018-10-25 00:02:50,359 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 4815 transitions. Word has length 225 [2018-10-25 00:02:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:50,360 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 4815 transitions. [2018-10-25 00:02:50,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:02:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 4815 transitions. [2018-10-25 00:02:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-25 00:02:50,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:50,377 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:50,378 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:50,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -765075483, now seen corresponding path program 1 times [2018-10-25 00:02:50,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:50,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:50,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:02:50,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:50,955 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:50,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-10-25 00:02:50,955 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [621], [623], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:50,959 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:50,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:51,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:02:51,977 INFO L272 AbstractInterpreter]: Visited 130 different actions 524 times. Merged at 9 different actions 40 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:02:51,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:51,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:02:51,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:51,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:51,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:51,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:02:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:52,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-25 00:02:52,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 116 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:02:52,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:02:52,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:02:52,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:02:52,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:02:52,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:02:52,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:02:52,399 INFO L87 Difference]: Start difference. First operand 4128 states and 4815 transitions. Second operand 11 states. [2018-10-25 00:02:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:54,406 INFO L93 Difference]: Finished difference Result 8653 states and 10217 transitions. [2018-10-25 00:02:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:54,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2018-10-25 00:02:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:54,428 INFO L225 Difference]: With dead ends: 8653 [2018-10-25 00:02:54,429 INFO L226 Difference]: Without dead ends: 5172 [2018-10-25 00:02:54,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:02:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2018-10-25 00:02:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5159. [2018-10-25 00:02:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2018-10-25 00:02:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 5937 transitions. [2018-10-25 00:02:54,569 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 5937 transitions. Word has length 234 [2018-10-25 00:02:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:54,570 INFO L481 AbstractCegarLoop]: Abstraction has 5159 states and 5937 transitions. [2018-10-25 00:02:54,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:02:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 5937 transitions. [2018-10-25 00:02:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-25 00:02:54,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:54,588 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:54,588 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:54,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2147192563, now seen corresponding path program 2 times [2018-10-25 00:02:54,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:54,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:54,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:02:55,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:55,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:55,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:02:55,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 00:02:55,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:55,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:02:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:02:55,133 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:02:55,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:02:55,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:02:55,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:02:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-25 00:02:55,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:02:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-25 00:02:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:02:55,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:55,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:55,638 INFO L87 Difference]: Start difference. First operand 5159 states and 5937 transitions. Second operand 3 states. [2018-10-25 00:02:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:56,688 INFO L93 Difference]: Finished difference Result 11611 states and 13599 transitions. [2018-10-25 00:02:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:56,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-10-25 00:02:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:56,689 INFO L225 Difference]: With dead ends: 11611 [2018-10-25 00:02:56,689 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:02:56,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:02:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:02:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:02:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:02:56,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2018-10-25 00:02:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:56,717 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:02:56,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:02:56,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:02:56,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:02:56,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,264 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 182 [2018-10-25 00:02:57,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:02:57,492 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 159 [2018-10-25 00:02:58,241 WARN L179 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-25 00:02:58,710 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 86 [2018-10-25 00:03:01,244 WARN L179 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 309 DAG size of output: 138 [2018-10-25 00:03:02,115 WARN L179 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 106 [2018-10-25 00:03:02,706 WARN L179 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 109 [2018-10-25 00:03:02,709 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,710 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:03:02,711 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,712 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:03:02,713 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:03:02,714 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:03:02,715 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:03:02,716 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:03:02,717 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:03:02,718 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:03:02,719 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,720 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:03:02,721 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,722 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:03:02,723 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 524) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:03:02,724 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:03:02,725 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse23 (not (= 15 |old(~a8~0)|))) (.cse3 (not (= 8 ~a12~0))) (.cse4 (= |calculate_output_#in~input| 0)) (.cse5 (not (= 1 |old(~a17~0)|))) (.cse11 (= |old(~a20~0)| ~a20~0)) (.cse6 (= ~a7~0 |old(~a7~0)|)) (.cse7 (= |old(~a8~0)| ~a8~0))) (let ((.cse9 (= ~a17~0 1)) (.cse18 (and .cse6 .cse7)) (.cse15 (and .cse6 .cse7 .cse11 (<= ~a17~0 0))) (.cse21 (not (= 1 |old(~a7~0)|))) (.cse20 (and (= 1 ~a7~0) .cse7)) (.cse12 (< |old(~a8~0)| 15)) (.cse8 (not (= ~a16~0 0))) (.cse10 (= ~a21~0 1)) (.cse14 (< 0 |old(~a17~0)|)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse2 (= 0 |old(~a16~0)|)) (.cse19 (< 13 |old(~a8~0)|)) (.cse13 (< 0 |old(~a20~0)|)) (.cse17 (= ~a16~0 5)) (.cse16 (or .cse22 .cse0 .cse23 (not (= 5 |old(~a16~0)|)) .cse3 .cse4 .cse5))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~a8~0)|) .cse5) (and .cse6 .cse7 (and .cse8 .cse9 .cse10 (= ~a20~0 1)))) (or (and .cse6 .cse7 .cse11) .cse12 .cse13) (or .cse1 .cse14 .cse15) (or .cse16 (not (= 0 |old(~a20~0)|)) (and .cse9 .cse10 .cse17)) (or .cse1 .cse11 .cse12) (or .cse1 .cse18 .cse12) (or (= |old(~a7~0)| 1) .cse19 .cse18) (or .cse19 .cse1 (= 1 ~a20~0)) (or .cse19 .cse20 .cse21 .cse13) (or .cse15 .cse14 .cse13) (or .cse19 .cse1 .cse21 .cse20) (or .cse21 .cse20 .cse12) (or (and .cse8 .cse10) .cse14 (or .cse22 .cse0 .cse1 .cse23 .cse2 .cse3 .cse4)) (or .cse19 .cse11 .cse13) (or .cse17 (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) .cse16)))) [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:03:02,726 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:03:02,727 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:03:02,728 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:03:02,729 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,730 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:03:02,731 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:03:02,732 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:03:02,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:03:02,732 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:03:02,732 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:03:02,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:03:02,732 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:03:02,733 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:02,733 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse3 (<= ~a17~0 0)) (.cse1 (<= ~a20~0 0)) (.cse4 (= 1 ~a7~0)) (.cse2 (= 1 ~a20~0)) (.cse0 (not (= ~a8~0 14)))) (or (and (not (= ~a16~0 0)) (not (= main_~input~0 0)) (= ~a17~0 1) (= ~a21~0 1) (= ~a20~0 1)) (and .cse0 .cse1) (and .cse2 .cse3) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (<= ~a8~0 13) (= ~a7~0 |old(~a7~0)|)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 (<= 15 ~a8~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and .cse2 .cse0 (not (= ~a8~0 13))) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse3 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse4 .cse2 .cse0) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:03:02,733 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:03:02,733 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:03:02,733 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:03:02,734 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse3 (<= ~a17~0 0)) (.cse1 (<= ~a20~0 0)) (.cse4 (= 1 ~a7~0)) (.cse2 (= 1 ~a20~0)) (.cse0 (not (= ~a8~0 14)))) (or (and .cse0 .cse1) (and (not (= ~a16~0 0)) (= ~a17~0 1) (= ~a21~0 1) (= ~a20~0 1)) (and .cse2 .cse3) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (<= ~a8~0 13) (= ~a7~0 |old(~a7~0)|)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 (<= 15 ~a8~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and .cse2 .cse0 (not (= ~a8~0 13))) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse3 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse4 .cse2 .cse0) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-10-25 00:03:02,734 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:03:02,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:03:02 BoogieIcfgContainer [2018-10-25 00:03:02,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:03:02,762 INFO L168 Benchmark]: Toolchain (without parser) took 82608.69 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,763 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:03:02,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,766 INFO L168 Benchmark]: Boogie Preprocessor took 115.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,767 INFO L168 Benchmark]: RCFGBuilder took 3079.79 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: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,768 INFO L168 Benchmark]: TraceAbstraction took 78501.96 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -879.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:03:02,773 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 710.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 196.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3079.79 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: 104.8 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78501.96 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -879.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 524]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(a8 == 14) && a20 <= 0) || (((!(a16 == 0) && a17 == 1) && a21 == 1) && a20 == 1)) || (1 == a20 && a17 <= 0)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (a8 <= 13 && a7 == \old(a7))) || ((a8 <= \old(a8) && 1 == a7) && 15 <= a8)) || !(x == 24)) || !(a12 == 8)) || ((1 == a20 && !(a8 == 14)) && !(a8 == 13))) || !(e == 5)) || !(d == 4)) || (a17 <= 0 && a20 <= 0)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || ((1 == a7 && 1 == a20) && !(a8 == 14))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 78.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 50.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1320 SDtfs, 7839 SDslu, 1630 SDs, 0 SdLazy, 13341 SolverSat, 1616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2051 GetRequests, 1686 SyntacticMatches, 246 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5159occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9974565028078209 AbsIntWeakeningRatio, 0.1973018549747049 AbsIntAvgWeakeningVarsNumRemoved, 0.7841483979763912 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 175 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 182 PreInvPairs, 306 NumberOfFragments, 878 HoareAnnotationTreeSize, 182 FomulaSimplifications, 8769 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9491 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2371 NumberOfCodeBlocks, 2304 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3028 ConstructedInterpolants, 0 QuantifiedInterpolants, 1205214 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1643 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1743/1987 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...