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_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:03:53,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:03:53,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:03:53,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:03:53,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:03:53,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:03:53,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:03:53,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:03:53,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:03:53,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:03:53,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:03:53,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:03:53,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:03:53,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:03:53,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:03:53,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:03:53,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:03:53,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:03:53,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:03:53,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:03:53,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:03:53,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:03:53,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:03:53,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:03:53,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:03:53,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:03:53,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:03:53,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:03:53,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:03:53,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:03:53,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:03:53,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:03:53,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:03:53,431 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:03:53,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:03:53,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:03:53,433 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:03:53,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:03:53,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:03:53,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:03:53,461 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:03:53,461 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:03:53,461 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:03:53,464 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:03:53,465 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:03:53,465 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:03:53,465 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:03:53,465 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:03:53,465 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:03:53,466 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:03:53,466 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:03:53,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:03:53,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:03:53,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:03:53,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:03:53,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:03:53,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:03:53,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:03:53,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:03:53,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:03:53,471 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:03:53,471 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:03:53,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:03:53,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:53,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:03:53,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:03:53,473 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:03:53,474 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:03:53,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:03:53,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:03:53,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:03:53,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:03:53,556 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:03:53,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label55_true-unreach-call_false-termination.c [2018-10-25 00:03:53,613 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/671d7f50e/522fa65bc04b4825b968138731894572/FLAG27a7cf52f [2018-10-25 00:03:54,210 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:03:54,214 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label55_true-unreach-call_false-termination.c [2018-10-25 00:03:54,233 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/671d7f50e/522fa65bc04b4825b968138731894572/FLAG27a7cf52f [2018-10-25 00:03:54,250 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/671d7f50e/522fa65bc04b4825b968138731894572 [2018-10-25 00:03:54,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:03:54,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:03:54,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:54,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:03:54,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:03:54,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:54" (1/1) ... [2018-10-25 00:03:54,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4dd763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:54, skipping insertion in model container [2018-10-25 00:03:54,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:54" (1/1) ... [2018-10-25 00:03:54,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:03:54,361 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:03:54,837 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:54,849 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:03:55,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:55,034 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:03:55,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55 WrapperNode [2018-10-25 00:03:55,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:55,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:55,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:03:55,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:03:55,049 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:03:55" (1/1) ... [2018-10-25 00:03:55,085 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:03:55" (1/1) ... [2018-10-25 00:03:55,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:55,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:03:55,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:03:55,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:03:55,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (1/1) ... [2018-10-25 00:03:55,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:03:55,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:03:55,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:03:55,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:03:55,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (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:03:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:03:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:03:58,970 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:03:58,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:58 BoogieIcfgContainer [2018-10-25 00:03:58,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:03:58,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:03:58,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:03:58,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:03:58,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:03:54" (1/3) ... [2018-10-25 00:03:58,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107512d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:58, skipping insertion in model container [2018-10-25 00:03:58,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:55" (2/3) ... [2018-10-25 00:03:58,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107512d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:58, skipping insertion in model container [2018-10-25 00:03:58,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:58" (3/3) ... [2018-10-25 00:03:58,982 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label55_true-unreach-call_false-termination.c [2018-10-25 00:03:58,994 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:03:59,006 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:03:59,026 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:03:59,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:03:59,075 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:03:59,075 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:03:59,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:03:59,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:03:59,076 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:03:59,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:03:59,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:03:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:03:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 00:03:59,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:59,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:59,138 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash 240629952, now seen corresponding path program 1 times [2018-10-25 00:03:59,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:59,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:59,210 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:59,914 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:04:00,066 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:04:00,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:00,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:04:00,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:00,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:00,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:00,098 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:04:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:02,104 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:04:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:02,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-25 00:04:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:02,127 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:04:02,127 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:04:02,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:04:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:04:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:04:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-10-25 00:04:02,215 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 118 [2018-10-25 00:04:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:02,216 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-10-25 00:04:02,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-10-25 00:04:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 00:04:02,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:02,225 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:02,226 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:02,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash -617422281, now seen corresponding path program 1 times [2018-10-25 00:04:02,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:02,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:02,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:02,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:02,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:02,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:02,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:02,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:02,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:02,388 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-10-25 00:04:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:04,402 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-10-25 00:04:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:04,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-25 00:04:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:04,415 INFO L225 Difference]: With dead ends: 1079 [2018-10-25 00:04:04,415 INFO L226 Difference]: Without dead ends: 745 [2018-10-25 00:04:04,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:04:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-10-25 00:04:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-10-25 00:04:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-25 00:04:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-10-25 00:04:04,481 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 128 [2018-10-25 00:04:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:04,481 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-10-25 00:04:04,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-10-25 00:04:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 00:04:04,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:04,487 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:04,487 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:04,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 11496099, now seen corresponding path program 1 times [2018-10-25 00:04:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:04,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:04,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:04,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:04,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-10-25 00:04:04,776 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:04,829 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:04,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:05,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:05,526 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:04:05,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:05,572 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:06,181 INFO L232 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 80.47% of their original sizes. [2018-10-25 00:04:06,181 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:06,362 INFO L413 sIntCurrentIteration]: We have 137 unified AI predicates [2018-10-25 00:04:06,362 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:06,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:06,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-10-25 00:04:06,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:06,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:06,368 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 6 states. [2018-10-25 00:04:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:16,457 INFO L93 Difference]: Finished difference Result 1598 states and 2531 transitions. [2018-10-25 00:04:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:04:16,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-25 00:04:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:16,465 INFO L225 Difference]: With dead ends: 1598 [2018-10-25 00:04:16,465 INFO L226 Difference]: Without dead ends: 871 [2018-10-25 00:04:16,468 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:04:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-25 00:04:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2018-10-25 00:04:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-10-25 00:04:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1308 transitions. [2018-10-25 00:04:16,531 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1308 transitions. Word has length 138 [2018-10-25 00:04:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:16,532 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1308 transitions. [2018-10-25 00:04:16,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1308 transitions. [2018-10-25 00:04:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 00:04:16,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:16,536 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:16,537 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:16,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1720247914, now seen corresponding path program 1 times [2018-10-25 00:04:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:16,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:16,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:16,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:16,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:16,954 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-10-25 00:04:16,954 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [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], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:16,960 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:16,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:17,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:17,257 INFO L272 AbstractInterpreter]: Visited 122 different actions 237 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:04:17,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:17,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:17,783 INFO L232 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 80.92% of their original sizes. [2018-10-25 00:04:17,783 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:21,039 INFO L413 sIntCurrentIteration]: We have 139 unified AI predicates [2018-10-25 00:04:21,039 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:21,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:21,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:04:21,040 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:21,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:04:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:04:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:04:21,042 INFO L87 Difference]: Start difference. First operand 869 states and 1308 transitions. Second operand 15 states. [2018-10-25 00:04:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:35,365 INFO L93 Difference]: Finished difference Result 2757 states and 4322 transitions. [2018-10-25 00:04:35,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:04:35,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 140 [2018-10-25 00:04:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:35,376 INFO L225 Difference]: With dead ends: 2757 [2018-10-25 00:04:35,376 INFO L226 Difference]: Without dead ends: 2030 [2018-10-25 00:04:35,381 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 57 SyntacticMatches, 69 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:04:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2018-10-25 00:04:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1985. [2018-10-25 00:04:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-25 00:04:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2568 transitions. [2018-10-25 00:04:35,438 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2568 transitions. Word has length 140 [2018-10-25 00:04:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:35,438 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2568 transitions. [2018-10-25 00:04:35,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:04:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2568 transitions. [2018-10-25 00:04:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 00:04:35,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:35,444 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-10-25 00:04:35,444 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:35,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1488530374, now seen corresponding path program 1 times [2018-10-25 00:04:35,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:35,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:35,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:35,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:35,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:35,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-10-25 00:04:35,740 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:35,744 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:35,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:36,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:36,011 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:04:36,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:36,017 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:36,403 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 80.55% of their original sizes. [2018-10-25 00:04:36,403 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:36,655 INFO L413 sIntCurrentIteration]: We have 146 unified AI predicates [2018-10-25 00:04:36,655 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:36,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:36,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-25 00:04:36,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:36,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:04:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:04:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:36,657 INFO L87 Difference]: Start difference. First operand 1985 states and 2568 transitions. Second operand 10 states. [2018-10-25 00:04:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:42,249 INFO L93 Difference]: Finished difference Result 3715 states and 4919 transitions. [2018-10-25 00:04:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:04:42,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2018-10-25 00:04:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:42,261 INFO L225 Difference]: With dead ends: 3715 [2018-10-25 00:04:42,261 INFO L226 Difference]: Without dead ends: 2126 [2018-10-25 00:04:42,267 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2018-10-25 00:04:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2123. [2018-10-25 00:04:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-10-25 00:04:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2722 transitions. [2018-10-25 00:04:42,330 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2722 transitions. Word has length 147 [2018-10-25 00:04:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:42,330 INFO L481 AbstractCegarLoop]: Abstraction has 2123 states and 2722 transitions. [2018-10-25 00:04:42,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:04:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2722 transitions. [2018-10-25 00:04:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-25 00:04:42,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:42,342 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:04:42,343 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:42,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1640342349, now seen corresponding path program 1 times [2018-10-25 00:04:42,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:42,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 00:04:42,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:42,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:42,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-10-25 00:04:42,650 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:42,659 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:42,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:43,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:43,524 INFO L272 AbstractInterpreter]: Visited 124 different actions 500 times. Merged at 8 different actions 39 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:04:43,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:43,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:43,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:43,561 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:04:43,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:43,570 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:43,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-25 00:04:43,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 00:04:45,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:04:45,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:04:45,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:04:45,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:04:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:04:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:04:45,087 INFO L87 Difference]: Start difference. First operand 2123 states and 2722 transitions. Second operand 8 states. [2018-10-25 00:04:45,419 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:04:45,936 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:04:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:50,565 INFO L93 Difference]: Finished difference Result 7004 states and 9590 transitions. [2018-10-25 00:04:50,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:04:50,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2018-10-25 00:04:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:50,582 INFO L225 Difference]: With dead ends: 7004 [2018-10-25 00:04:50,583 INFO L226 Difference]: Without dead ends: 2993 [2018-10-25 00:04:50,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:04:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2018-10-25 00:04:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2936. [2018-10-25 00:04:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2018-10-25 00:04:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3485 transitions. [2018-10-25 00:04:50,683 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3485 transitions. Word has length 159 [2018-10-25 00:04:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:50,684 INFO L481 AbstractCegarLoop]: Abstraction has 2936 states and 3485 transitions. [2018-10-25 00:04:50,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:04:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3485 transitions. [2018-10-25 00:04:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-25 00:04:50,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:50,692 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:50,692 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:50,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 867493849, now seen corresponding path program 1 times [2018-10-25 00:04:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:50,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:04:50,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:50,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:50,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-25 00:04:50,920 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [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], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:50,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:50,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:51,303 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:51,303 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 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:04:51,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:51,348 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:52,028 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 80.86% of their original sizes. [2018-10-25 00:04:52,028 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:54,767 INFO L413 sIntCurrentIteration]: We have 185 unified AI predicates [2018-10-25 00:04:54,768 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:54,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:54,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:04:54,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:54,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:04:54,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:04:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:04:54,769 INFO L87 Difference]: Start difference. First operand 2936 states and 3485 transitions. Second operand 15 states. [2018-10-25 00:05:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:01,965 INFO L93 Difference]: Finished difference Result 6243 states and 7447 transitions. [2018-10-25 00:05:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:05:01,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 186 [2018-10-25 00:05:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:01,983 INFO L225 Difference]: With dead ends: 6243 [2018-10-25 00:05:01,983 INFO L226 Difference]: Without dead ends: 3587 [2018-10-25 00:05:01,992 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 70 SyntacticMatches, 102 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:05:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2018-10-25 00:05:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3443. [2018-10-25 00:05:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2018-10-25 00:05:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 4020 transitions. [2018-10-25 00:05:02,074 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 4020 transitions. Word has length 186 [2018-10-25 00:05:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:02,074 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 4020 transitions. [2018-10-25 00:05:02,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:05:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 4020 transitions. [2018-10-25 00:05:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 00:05:02,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:02,084 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:02,084 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:02,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1566001412, now seen corresponding path program 1 times [2018-10-25 00:05:02,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:02,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-25 00:05:02,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:02,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:02,859 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-10-25 00:05:02,860 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [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], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:02,863 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:02,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:03,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:03,742 INFO L272 AbstractInterpreter]: Visited 125 different actions 505 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:05:03,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:03,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:03,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:03,751 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:05:03,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:03,766 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:03,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-25 00:05:04,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-25 00:05:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:05:04,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:04,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:05:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:05:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:04,301 INFO L87 Difference]: Start difference. First operand 3443 states and 4020 transitions. Second operand 11 states. [2018-10-25 00:05:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:07,220 INFO L93 Difference]: Finished difference Result 11145 states and 13947 transitions. [2018-10-25 00:05:07,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 00:05:07,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 195 [2018-10-25 00:05:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:07,255 INFO L225 Difference]: With dead ends: 11145 [2018-10-25 00:05:07,255 INFO L226 Difference]: Without dead ends: 8351 [2018-10-25 00:05:07,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:05:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8351 states. [2018-10-25 00:05:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8351 to 8319. [2018-10-25 00:05:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8319 states. [2018-10-25 00:05:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8319 states to 8319 states and 9990 transitions. [2018-10-25 00:05:07,476 INFO L78 Accepts]: Start accepts. Automaton has 8319 states and 9990 transitions. Word has length 195 [2018-10-25 00:05:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:07,477 INFO L481 AbstractCegarLoop]: Abstraction has 8319 states and 9990 transitions. [2018-10-25 00:05:07,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:05:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8319 states and 9990 transitions. [2018-10-25 00:05:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 00:05:07,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:07,495 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:07,495 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:07,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1448672338, now seen corresponding path program 2 times [2018-10-25 00:05:07,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:07,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:07,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-25 00:05:08,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:08,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:08,350 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 00:05:08,350 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:05:08,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:08,350 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:05:08,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 00:05:08,359 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 00:05:08,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-25 00:05:08,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 00:05:08,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-25 00:05:08,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-25 00:05:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:05:08,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:08,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:08,725 INFO L87 Difference]: Start difference. First operand 8319 states and 9990 transitions. Second operand 3 states. [2018-10-25 00:05:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:09,490 INFO L93 Difference]: Finished difference Result 20359 states and 24851 transitions. [2018-10-25 00:05:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:09,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-25 00:05:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:09,540 INFO L225 Difference]: With dead ends: 20359 [2018-10-25 00:05:09,540 INFO L226 Difference]: Without dead ends: 12320 [2018-10-25 00:05:09,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12320 states. [2018-10-25 00:05:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12320 to 12128. [2018-10-25 00:05:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12128 states. [2018-10-25 00:05:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12128 states to 12128 states and 14429 transitions. [2018-10-25 00:05:09,866 INFO L78 Accepts]: Start accepts. Automaton has 12128 states and 14429 transitions. Word has length 195 [2018-10-25 00:05:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:09,867 INFO L481 AbstractCegarLoop]: Abstraction has 12128 states and 14429 transitions. [2018-10-25 00:05:09,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 12128 states and 14429 transitions. [2018-10-25 00:05:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-25 00:05:09,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:09,895 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, 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] [2018-10-25 00:05:09,896 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:09,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1211800928, now seen corresponding path program 1 times [2018-10-25 00:05:09,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:09,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-25 00:05:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:09,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:10,509 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:05:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 119 proven. 52 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-25 00:05:10,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:10,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:10,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-10-25 00:05:10,607 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], [93], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:10,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:10,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:11,045 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:11,045 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:05:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:11,052 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:11,949 INFO L232 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 81.23% of their original sizes. [2018-10-25 00:05:11,949 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:16,044 INFO L413 sIntCurrentIteration]: We have 224 unified AI predicates [2018-10-25 00:05:16,044 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:05:16,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:16,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:05:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:05:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:16,046 INFO L87 Difference]: Start difference. First operand 12128 states and 14429 transitions. Second operand 13 states. [2018-10-25 00:05:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:29,640 INFO L93 Difference]: Finished difference Result 24814 states and 29590 transitions. [2018-10-25 00:05:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:05:29,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 225 [2018-10-25 00:05:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:29,682 INFO L225 Difference]: With dead ends: 24814 [2018-10-25 00:05:29,682 INFO L226 Difference]: Without dead ends: 13242 [2018-10-25 00:05:29,700 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 86 SyntacticMatches, 127 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:05:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2018-10-25 00:05:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 13097. [2018-10-25 00:05:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13097 states. [2018-10-25 00:05:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13097 states to 13097 states and 15482 transitions. [2018-10-25 00:05:29,973 INFO L78 Accepts]: Start accepts. Automaton has 13097 states and 15482 transitions. Word has length 225 [2018-10-25 00:05:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:29,973 INFO L481 AbstractCegarLoop]: Abstraction has 13097 states and 15482 transitions. [2018-10-25 00:05:29,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:05:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13097 states and 15482 transitions. [2018-10-25 00:05:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-25 00:05:30,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:30,003 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-25 00:05:30,003 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:30,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash -634639250, now seen corresponding path program 1 times [2018-10-25 00:05:30,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:30,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:30,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:30,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:30,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 174 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-25 00:05:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:30,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:30,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-10-25 00:05:30,278 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], [93], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [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], [581], [583], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:30,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:30,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:31,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:31,194 INFO L272 AbstractInterpreter]: Visited 125 different actions 501 times. Merged at 9 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:05:31,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:31,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:31,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:31,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:31,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:31,210 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:31,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-25 00:05:31,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-25 00:05:31,720 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:31,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:05:31,721 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:31,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:31,722 INFO L87 Difference]: Start difference. First operand 13097 states and 15482 transitions. Second operand 3 states. [2018-10-25 00:05:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:32,452 INFO L93 Difference]: Finished difference Result 21386 states and 25322 transitions. [2018-10-25 00:05:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:32,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-10-25 00:05:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:32,454 INFO L225 Difference]: With dead ends: 21386 [2018-10-25 00:05:32,454 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:05:32,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 480 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:05:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:05:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:05:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:05:32,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2018-10-25 00:05:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:32,493 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:05:32,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:05:32,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:05:32,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:05:32,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:32,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,342 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 189 [2018-10-25 00:05:33,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:33,592 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 144 [2018-10-25 00:05:34,255 WARN L179 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-10-25 00:05:35,660 WARN L179 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 141 DAG size of output: 86 [2018-10-25 00:05:41,686 WARN L179 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 392 DAG size of output: 148 [2018-10-25 00:05:42,450 WARN L179 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 105 [2018-10-25 00:05:43,012 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 107 [2018-10-25 00:05:43,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:05:43,015 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:05:43,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,016 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,017 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:05:43,018 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,019 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:05:43,020 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:05:43,021 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:05:43,022 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:05:43,023 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:05:43,024 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:05:43,025 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 509) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:05:43,026 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,027 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:05:43,028 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:05:43,029 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse11 (= 1 |old(~a20~0)|))) (let ((.cse19 (not (= ~a16~0 0))) (.cse17 (= ~a17~0 1)) (.cse23 (not .cse11)) (.cse25 (= 0 |old(~a16~0)|)) (.cse20 (= ~a21~0 1)) (.cse18 (= ~a16~0 5)) (.cse21 (not (= 0 |old(~a7~0)|))) (.cse22 (not (= 1 |old(~a21~0)|))) (.cse24 (not (= 15 |old(~a8~0)|))) (.cse29 (not (= 5 |old(~a16~0)|))) (.cse26 (not (= 8 ~a12~0))) (.cse27 (= |calculate_output_#in~input| 0)) (.cse28 (not (= 1 |old(~a17~0)|)))) (let ((.cse14 (= 1 ~a7~0)) (.cse16 (or .cse21 .cse22 .cse24 .cse29 .cse26 .cse27 .cse28)) (.cse15 (<= ~a17~0 0)) (.cse5 (< 0 |old(~a17~0)|)) (.cse2 (< |old(~a8~0)| 15)) (.cse4 (or .cse21 .cse22 .cse24 .cse29 .cse26)) (.cse3 (and .cse20 .cse18)) (.cse8 (not (= 1 |old(~a7~0)|))) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse13 (or .cse22 .cse23 .cse25 .cse26 .cse27 (= 0 |old(~a8~0)|) .cse28)) (.cse12 (and .cse19 (not (= ~a8~0 0)) .cse17 (= ~a12~0 8) .cse20 (= ~a20~0 1) (not .cse27))) (.cse6 (= 6 |old(~a16~0)|)) (.cse10 (< 13 |old(~a8~0)|)) (.cse0 (= ~a7~0 |old(~a7~0)|)) (.cse1 (= |old(~a8~0)| ~a8~0)) (.cse7 (not (= ~a16~0 6)))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (or .cse4 .cse5)) (or .cse6 .cse7 .cse8 .cse2) (or .cse9 .cse2) (or .cse6 .cse10 .cse9 .cse11) (or .cse6 (and .cse0 .cse1 .cse12 .cse7) .cse13) (or .cse10 (and .cse14 .cse1 .cse9 .cse15) (< |old(~a20~0)| 1) .cse8 .cse5) (or .cse13 (and .cse14 .cse1 .cse12) .cse8) (or .cse16 (not (= 0 |old(~a20~0)|)) .cse17) (or .cse18 (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (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) (or (and .cse19 .cse20) (or .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse5) (or .cse6 (and .cse0 .cse1 .cse9 .cse7 .cse15) .cse5) (or .cse6 .cse7 .cse11 .cse2) (or .cse15 .cse5 .cse2) (or .cse4 .cse3 .cse11) (or .cse6 .cse10 .cse8 .cse9) (or .cse10 .cse13 (and .cse0 .cse1 .cse12)) (or .cse6 .cse10 (and .cse0 .cse1 .cse7)))))) [2018-10-25 00:05:43,029 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:05:43,029 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,029 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,029 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,029 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:05:43,030 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:05:43,031 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:05:43,032 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:05:43,033 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:05:43,033 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:05:43,033 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:05:43,034 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (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)) (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:05:43,034 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:05:43,034 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse9 (<= ~a17~0 0)) (.cse3 (not (= ~a16~0 0))) (.cse5 (not (= main_~input~0 0))) (.cse6 (not (= ~a8~0 0))) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse0 (<= ~a8~0 13)) (.cse4 (= 1 ~a7~0)) (.cse2 (not (= ~a16~0 6)))) (or (and .cse0 (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse9) (and .cse0 (= ~a7~0 |old(~a7~0)|) .cse2) (<= 15 ~a8~0) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse1) (and .cse0 .cse4 .cse9 (<= 1 ~a20~0)) (and .cse3 .cse5 .cse6 .cse2 .cse7 .cse8 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse0 .cse4 .cse2) (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:05:43,034 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:05:43,034 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:05:43,034 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:05:43,034 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a12~0 8)) (.cse1 (= ~a20~0 1))) (let ((.cse3 (<= ~a17~0 0)) (.cse0 (<= ~a8~0 13)) (.cse6 (= 1 ~a7~0)) (.cse4 (and (not (= ~a16~0 0)) (not (= ~a8~0 0)) (= ~a17~0 1) .cse5 (= ~a21~0 1) .cse1)) (.cse2 (not (= ~a16~0 6)))) (or (and .cse0 (not .cse1) .cse2) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3) (and .cse0 (= ~a7~0 |old(~a7~0)|) .cse2) (<= 15 ~a8~0) (not (= ~x~0 24)) (and .cse0 .cse4) (not .cse5) (not (= ~e~0 5)) (and .cse6 .cse4) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse6 .cse3 (<= 1 ~a20~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and .cse0 .cse6 .cse2) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and .cse4 .cse2) (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:05:43,034 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:05:43,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:05:43 BoogieIcfgContainer [2018-10-25 00:05:43,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:05:43,055 INFO L168 Benchmark]: Toolchain (without parser) took 108790.68 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 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.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:05:43,056 INFO L168 Benchmark]: CDTParser took 0.22 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:05:43,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:05:43,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:05:43,059 INFO L168 Benchmark]: Boogie Preprocessor took 72.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:05:43,059 INFO L168 Benchmark]: RCFGBuilder took 3643.94 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: 107.5 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:05:43,060 INFO L168 Benchmark]: TraceAbstraction took 104081.74 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -880.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:05:43,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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 768.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 218.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3643.94 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: 107.5 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 104081.74 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -880.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 509]: 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 <= 13 && !(a20 == 1)) && !(a16 == 6)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (!(a16 == 6) && a17 <= 0)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || 15 <= a8) || !(x == 24)) || (a8 <= 13 && ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || !(a12 == 8)) || !(e == 5)) || (1 == a7 && ((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || (((a8 <= 13 && 1 == a7) && a17 <= 0) && 1 <= a20)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || ((a8 <= 13 && 1 == a7) && !(a16 == 6))) || !(3 == c)) || !(\old(a20) == 1)) || ((((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && !(a16 == 6))) || !(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, 103.9s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 65.1s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1651 SDtfs, 10413 SDslu, 1878 SDs, 0 SdLazy, 16178 SolverSat, 2017 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2539 GetRequests, 2084 SyntacticMatches, 307 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13097occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9972665004423781 AbsIntWeakeningRatio, 0.2250300842358604 AbsIntAvgWeakeningVarsNumRemoved, 5.682310469314079 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 632 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 363 PreInvPairs, 585 NumberOfFragments, 1169 HoareAnnotationTreeSize, 363 FomulaSimplifications, 23554 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15095 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2595 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3433 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397877 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2081 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1843/2081 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...