java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:08:19,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:08:19,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:08:19,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:08:19,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:08:19,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:08:19,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:08:19,491 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:08:19,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:08:19,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:08:19,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:08:19,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:08:19,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:08:19,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:08:19,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:08:19,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:08:19,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:08:19,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:08:19,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:08:19,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:08:19,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:08:19,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:08:19,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:08:19,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:08:19,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:08:19,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:08:19,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:08:19,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:08:19,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:08:19,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:08:19,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:08:19,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:08:19,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:08:19,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:08:19,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:08:19,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:08:19,520 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:08:19,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:08:19,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:08:19,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:08:19,549 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:08:19,549 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:08:19,549 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:08:19,550 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:08:19,550 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:08:19,550 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:08:19,550 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:08:19,550 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:08:19,551 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:08:19,551 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:08:19,551 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:08:19,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:08:19,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:08:19,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:08:19,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:08:19,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:08:19,553 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:08:19,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:08:19,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:08:19,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:08:19,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:08:19,554 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:08:19,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:08:19,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:08:19,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:08:19,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:08:19,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:08:19,555 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:08:19,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:08:19,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:08:19,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:08:19,556 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:08:19,556 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:08:19,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:08:19,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:08:19,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:08:19,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:08:19,658 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:08:19,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-10-25 00:08:19,725 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e33e1a96b/ce1d36b18d7648d2bd24822c8d5e538b/FLAGbe4187338 [2018-10-25 00:08:20,236 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:08:20,237 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-10-25 00:08:20,259 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e33e1a96b/ce1d36b18d7648d2bd24822c8d5e538b/FLAGbe4187338 [2018-10-25 00:08:20,273 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e33e1a96b/ce1d36b18d7648d2bd24822c8d5e538b [2018-10-25 00:08:20,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:08:20,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:08:20,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:20,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:08:20,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:08:20,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:20" (1/1) ... [2018-10-25 00:08:20,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b295a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:20, skipping insertion in model container [2018-10-25 00:08:20,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:08:20" (1/1) ... [2018-10-25 00:08:20,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:08:20,379 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:08:20,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:20,878 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:08:21,013 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:08:21,034 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:08:21,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21 WrapperNode [2018-10-25 00:08:21,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:08:21,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:21,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:08:21,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:08:21,046 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:08:21" (1/1) ... [2018-10-25 00:08:21,074 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:08:21" (1/1) ... [2018-10-25 00:08:21,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:08:21,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:08:21,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:08:21,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:08:21,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (1/1) ... [2018-10-25 00:08:21,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:08:21,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:08:21,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:08:21,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:08:21,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (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:08:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:08:21,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:08:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:08:21,450 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:08:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:08:21,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:08:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:08:21,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:08:25,010 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:08:25,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:25 BoogieIcfgContainer [2018-10-25 00:08:25,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:08:25,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:08:25,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:08:25,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:08:25,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:08:20" (1/3) ... [2018-10-25 00:08:25,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:25, skipping insertion in model container [2018-10-25 00:08:25,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:08:21" (2/3) ... [2018-10-25 00:08:25,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:08:25, skipping insertion in model container [2018-10-25 00:08:25,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:08:25" (3/3) ... [2018-10-25 00:08:25,025 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49_true-unreach-call_false-termination.c [2018-10-25 00:08:25,036 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:08:25,048 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:08:25,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:08:25,117 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:08:25,117 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:08:25,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:08:25,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:08:25,118 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:08:25,119 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:08:25,119 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:08:25,119 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:08:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:08:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:08:25,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:25,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:25,174 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:25,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1826364152, now seen corresponding path program 1 times [2018-10-25 00:08:25,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:25,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:25,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:25,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:25,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:25,863 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:25,984 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:08:25,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:25,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:25,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:25,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:26,014 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:08:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:27,718 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:08:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:27,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-25 00:08:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:27,738 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:08:27,738 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:08:27,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:08:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:08:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:08:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:08:27,823 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 132 [2018-10-25 00:08:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:27,824 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:08:27,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:08:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 00:08:27,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:27,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:27,832 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:27,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash 660432277, now seen corresponding path program 1 times [2018-10-25 00:08:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:27,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:27,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:27,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:28,337 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:28,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:28,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:28,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:28,423 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:08:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:30,099 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:08:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:30,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-10-25 00:08:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:30,105 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:08:30,105 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:08:30,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:08:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:08:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:08:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:08:30,137 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 141 [2018-10-25 00:08:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:30,138 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:08:30,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:08:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 00:08:30,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:30,143 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:30,144 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:30,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1332602505, now seen corresponding path program 1 times [2018-10-25 00:08:30,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:30,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:30,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:30,880 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-25 00:08:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:31,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:31,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:31,018 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:31,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:31,020 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:08:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:32,865 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:08:32,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:32,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-10-25 00:08:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:32,873 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:08:32,874 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:08:32,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:08:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:08:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:08:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:08:32,911 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 147 [2018-10-25 00:08:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:32,911 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:08:32,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:08:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:08:32,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:32,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:32,915 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:32,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash -203936942, now seen corresponding path program 1 times [2018-10-25 00:08:32,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:32,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:32,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:33,157 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:33,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:33,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:33,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:33,512 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:08:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:36,429 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:08:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:36,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-25 00:08:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:36,435 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:08:36,435 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:08:36,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:08:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:08:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:08:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:08:36,475 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 155 [2018-10-25 00:08:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:36,475 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:08:36,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:08:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 00:08:36,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:36,480 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:36,480 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:36,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -749626802, now seen corresponding path program 1 times [2018-10-25 00:08:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:36,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:36,909 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:08:37,139 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:08:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:37,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:37,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:37,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:37,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:37,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:37,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:37,215 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:08:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:38,309 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:08:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:38,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-10-25 00:08:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:38,319 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:08:38,319 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:08:38,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:08:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:08:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:08:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:08:38,347 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 157 [2018-10-25 00:08:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:38,348 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:08:38,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:08:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-25 00:08:38,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:38,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:38,352 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:38,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -650421942, now seen corresponding path program 1 times [2018-10-25 00:08:38,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:38,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:38,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:38,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:38,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:08:38,659 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:38,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:08:38,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:08:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:38,660 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:08:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:40,164 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:08:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:08:40,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-10-25 00:08:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:40,171 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:08:40,172 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:08:40,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:08:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:08:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:08:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:08:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:08:40,213 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 159 [2018-10-25 00:08:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:40,214 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:08:40,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:08:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:08:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-25 00:08:40,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:40,222 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:40,223 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:40,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1376765762, now seen corresponding path program 1 times [2018-10-25 00:08:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:40,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:40,473 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:08:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:40,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:08:40,555 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:40,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:08:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:08:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:08:40,556 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:08:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:41,646 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:08:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:08:41,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-10-25 00:08:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:41,656 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:08:41,656 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:08:41,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:08:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:08:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:08:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:08:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:08:41,707 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 163 [2018-10-25 00:08:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:41,707 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:08:41,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:08:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:08:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-25 00:08:41,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:41,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:41,715 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:41,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash 213430480, now seen corresponding path program 1 times [2018-10-25 00:08:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:41,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:42,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:42,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:42,154 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-10-25 00:08:42,156 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:42,210 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:42,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:43,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:08:43,382 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:08:43,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:43,431 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:08:44,747 INFO L232 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 81.09% of their original sizes. [2018-10-25 00:08:44,748 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:08:47,102 INFO L413 sIntCurrentIteration]: We have 197 unified AI predicates [2018-10-25 00:08:47,102 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:08:47,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:08:47,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:08:47,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:47,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:08:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:08:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:47,105 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-10-25 00:08:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:58,471 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-10-25 00:08:58,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:08:58,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2018-10-25 00:08:58,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:58,482 INFO L225 Difference]: With dead ends: 3925 [2018-10-25 00:08:58,483 INFO L226 Difference]: Without dead ends: 2373 [2018-10-25 00:08:58,489 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 70 SyntacticMatches, 119 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:08:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-25 00:08:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-10-25 00:08:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-10-25 00:08:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-10-25 00:08:58,554 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 198 [2018-10-25 00:08:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:58,554 INFO L481 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-10-25 00:08:58,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:08:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-10-25 00:08:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-25 00:08:58,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:58,564 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:58,564 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:58,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1831098819, now seen corresponding path program 1 times [2018-10-25 00:08:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:58,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:08:58,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:58,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:58,799 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-10-25 00:08:58,800 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:58,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:58,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:59,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:59,465 INFO L272 AbstractInterpreter]: Visited 138 different actions 411 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:59,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:59,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:59,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:59,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:59,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:59,489 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:59,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:00,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:00,340 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:09:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:09:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:09:00,824 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:00,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:09:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:09:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:09:00,826 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-10-25 00:09:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:05,760 INFO L93 Difference]: Finished difference Result 7743 states and 10793 transitions. [2018-10-25 00:09:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:09:05,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 203 [2018-10-25 00:09:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:05,775 INFO L225 Difference]: With dead ends: 7743 [2018-10-25 00:09:05,775 INFO L226 Difference]: Without dead ends: 3066 [2018-10-25 00:09:05,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:09:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-10-25 00:09:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3043. [2018-10-25 00:09:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-10-25 00:09:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3614 transitions. [2018-10-25 00:09:05,867 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3614 transitions. Word has length 203 [2018-10-25 00:09:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:05,868 INFO L481 AbstractCegarLoop]: Abstraction has 3043 states and 3614 transitions. [2018-10-25 00:09:05,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:09:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3614 transitions. [2018-10-25 00:09:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-25 00:09:05,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:05,879 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:05,879 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:05,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1918756425, now seen corresponding path program 1 times [2018-10-25 00:09:05,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:05,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:05,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:05,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:05,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:06,267 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:09:06,460 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:09:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:09:07,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:07,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:07,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-10-25 00:09:07,112 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:07,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:07,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:08,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:09:08,331 INFO L272 AbstractInterpreter]: Visited 140 different actions 554 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:09:08,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:08,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:09:08,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:08,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-25 00:09:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:08,376 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:09:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:08,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:09:09,577 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-25 00:09:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:09:09,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:09:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 230 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:09:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:09:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 22 [2018-10-25 00:09:10,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:09:10,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-25 00:09:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-25 00:09:10,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:09:10,151 INFO L87 Difference]: Start difference. First operand 3043 states and 3614 transitions. Second operand 20 states. [2018-10-25 00:09:10,339 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-25 00:09:10,587 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-10-25 00:09:11,259 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-10-25 00:09:12,920 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2018-10-25 00:09:13,126 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-25 00:09:14,073 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-10-25 00:09:15,172 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-10-25 00:09:15,339 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-10-25 00:09:16,175 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-10-25 00:09:17,209 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2018-10-25 00:09:17,471 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-10-25 00:09:18,056 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2018-10-25 00:09:18,379 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-10-25 00:09:18,577 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-25 00:09:18,922 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2018-10-25 00:09:19,132 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-10-25 00:09:21,890 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-25 00:09:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:22,491 INFO L93 Difference]: Finished difference Result 7019 states and 9078 transitions. [2018-10-25 00:09:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-25 00:09:22,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 282 [2018-10-25 00:09:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:22,512 INFO L225 Difference]: With dead ends: 7019 [2018-10-25 00:09:22,512 INFO L226 Difference]: Without dead ends: 3754 [2018-10-25 00:09:22,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 592 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1295, Invalid=5185, Unknown=0, NotChecked=0, Total=6480 [2018-10-25 00:09:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2018-10-25 00:09:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3094. [2018-10-25 00:09:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3094 states. [2018-10-25 00:09:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 3592 transitions. [2018-10-25 00:09:22,628 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 3592 transitions. Word has length 282 [2018-10-25 00:09:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:22,628 INFO L481 AbstractCegarLoop]: Abstraction has 3094 states and 3592 transitions. [2018-10-25 00:09:22,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-25 00:09:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 3592 transitions. [2018-10-25 00:09:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-25 00:09:22,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:22,640 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:09:22,640 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:22,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1757225332, now seen corresponding path program 1 times [2018-10-25 00:09:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:22,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:09:23,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:09:23,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:09:23,113 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-10-25 00:09:23,114 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:09:23,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:09:23,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:09:23,694 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:09:23,694 INFO L272 AbstractInterpreter]: Visited 137 different actions 408 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:09:23,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:23,730 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:09:25,605 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:09:25,605 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:09:31,638 INFO L413 sIntCurrentIteration]: We have 284 unified AI predicates [2018-10-25 00:09:31,638 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:09:31,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:09:31,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-25 00:09:31,638 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:09:31,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:09:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:09:31,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:09:31,639 INFO L87 Difference]: Start difference. First operand 3094 states and 3592 transitions. Second operand 12 states. [2018-10-25 00:09:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:09:42,624 INFO L93 Difference]: Finished difference Result 6208 states and 7256 transitions. [2018-10-25 00:09:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:09:42,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 285 [2018-10-25 00:09:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:09:42,625 INFO L225 Difference]: With dead ends: 6208 [2018-10-25 00:09:42,625 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:09:42,637 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 288 GetRequests, 37 SyntacticMatches, 237 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:09:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:09:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:09:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:09:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:09:42,639 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 285 [2018-10-25 00:09:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:09:42,639 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:09:42,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:09:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:09:42,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:09:42,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:09:42,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:42,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,304 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 226 [2018-10-25 00:09:43,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:09:43,690 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 235 [2018-10-25 00:09:44,669 WARN L179 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-25 00:09:45,846 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 138 DAG size of output: 77 [2018-10-25 00:09:49,630 WARN L179 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 321 DAG size of output: 84 [2018-10-25 00:09:50,694 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 250 DAG size of output: 103 [2018-10-25 00:09:51,763 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 259 DAG size of output: 103 [2018-10-25 00:09:51,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:51,767 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:09:51,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:51,767 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,767 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:09:51,768 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:09:51,769 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:09:51,770 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:09:51,771 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,772 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:09:51,773 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:09:51,774 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:09:51,775 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:09:51,776 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:09:51,777 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,778 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:09:51,779 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:09:51,780 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:09:51,781 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,782 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:09:51,783 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,784 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,785 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse13 (= 1 |old(~a19~0)|))) (let ((.cse0 (not (= 1 ~a21~0))) (.cse6 (not .cse13)) (.cse10 (not (= 8 |old(~a17~0)|))) (.cse14 (= 1 |old(~a25~0)|)) (.cse1 (= 1 |old(~a11~0)|))) (let ((.cse4 (not (= 7 |old(~a28~0)|))) (.cse8 (= 1 ~a11~0)) (.cse11 (= 8 ~a17~0)) (.cse9 (= 1 ~a19~0)) (.cse7 (not .cse1)) (.cse16 (< 10 |old(~a28~0)|)) (.cse12 (= 9 |old(~a28~0)|)) (.cse5 (not .cse14)) (.cse18 (and (= ~a17~0 8) (= ~a19~0 1))) (.cse17 (= |old(~a11~0)| ~a11~0)) (.cse20 (= ~a25~0 |old(~a25~0)|)) (.cse21 (or .cse0 .cse6 (= 0 |old(~a28~0)|) .cse10)) (.cse15 (= |old(~a25~0)| ~a25~0)) (.cse19 (= ~a28~0 |old(~a28~0)|)) (.cse2 (= 8 |old(~a28~0)|)) (.cse3 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 (not (= ~a11~0 1)) .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse5 .cse6 .cse10 (and .cse8 (= 1 ~a25~0) (= 9 ~a28~0) .cse11 .cse9) (not .cse12) .cse7) (or .cse13 .cse0 .cse4 .cse10 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse8 .cse11 (not .cse9)) .cse7 .cse14) (or (and .cse8 .cse11 .cse9 .cse15 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse6 .cse10 .cse7) (or .cse16 (and .cse17 .cse18 .cse19 .cse20) .cse2 .cse14 .cse21) (or (or .cse16 .cse0 .cse1 .cse12 (not (= |old(~a17~0)| 8))) (and .cse17 (= ~a17~0 |old(~a17~0)|) .cse19 .cse20)) (or .cse1 .cse5 (and .cse18 .cse17 .cse19 .cse20) .cse21) (or (and (= |old(~a17~0)| ~a17~0) .cse15 .cse19) .cse0 .cse2 .cse3))))) [2018-10-25 00:09:51,785 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,785 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,785 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,785 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:09:51,786 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,787 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:09:51,788 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:09:51,789 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:09:51,790 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:09:51,791 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:09:51,792 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:09:51,793 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:09:51,793 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:09:51,793 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:09:51,793 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a11~0 0) (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:09:51,793 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:09:51,794 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1))) (let ((.cse4 (= 1 ~a19~0)) (.cse3 (= 8 ~a17~0)) (.cse6 (not (= ~a25~0 1))) (.cse1 (<= ~a28~0 10)) (.cse0 (not (= ~a28~0 8))) (.cse7 (and (not (= ~a28~0 0)) (= ~a17~0 8) (= ~a19~0 1) .cse5)) (.cse2 (not (= ~a11~0 1)))) (or (and (<= ~a17~0 7) .cse0) (and (= |old(~a17~0)| ~a17~0) .cse1 .cse2 (not (= ~a28~0 9))) (and (= 9 ~a28~0) .cse3 .cse4) (not .cse5) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 .cse4 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and (= 7 ~a28~0) .cse6 .cse3) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse6 .cse1 .cse0 .cse7) (and .cse7 (and (= 1 ~a25~0) .cse2)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:51,794 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:51,794 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:09:51,794 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1))) (let ((.cse4 (= 1 ~a19~0)) (.cse3 (= 8 ~a17~0)) (.cse6 (not (= ~a25~0 1))) (.cse1 (<= ~a28~0 10)) (.cse0 (not (= ~a28~0 8))) (.cse7 (and (not (= ~a28~0 0)) (= ~a17~0 8) (= ~a19~0 1) .cse5)) (.cse2 (not (= ~a11~0 1)))) (or (and (<= ~a17~0 7) .cse0) (and (= |old(~a17~0)| ~a17~0) .cse1 .cse2 (not (= ~a28~0 9))) (and (= 9 ~a28~0) .cse3 .cse4) (not .cse5) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 .cse4 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and (= 7 ~a28~0) .cse6 .cse3) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and .cse6 .cse1 .cse0 .cse7) (and .cse7 (and (= 1 ~a25~0) .cse2)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:09:51,794 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:09:51,794 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:09:51,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:09:51 BoogieIcfgContainer [2018-10-25 00:09:51,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:09:51,812 INFO L168 Benchmark]: Toolchain (without parser) took 91527.50 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 1.6 GB in the end (delta: -165.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:51,813 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:51,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.57 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:51,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 246.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:51,815 INFO L168 Benchmark]: Boogie Preprocessor took 90.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:09:51,816 INFO L168 Benchmark]: RCFGBuilder took 3638.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:09:51,817 INFO L168 Benchmark]: TraceAbstraction took 86798.72 ms. Allocated memory was 2.2 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 1.6 GB in the end (delta: 476.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 00:09:51,821 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.57 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 246.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.97 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3638.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86798.72 ms. Allocated memory was 2.2 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 1.6 GB in the end (delta: 476.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a17 <= 7 && !(a28 == 8)) || (((\old(a17) == a17 && a28 <= 10) && !(a11 == 1)) && !(a28 == 9))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || !(1 == \old(a19))) || !(x == 24)) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || (((!(a25 == 1) && a28 <= 10) && !(a28 == 8)) && ((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1)) || ((((!(a28 == 0) && a17 == 8) && a19 == 1) && a21 == 1) && 1 == a25 && !(a11 == 1))) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 86.6s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 51.6s AutomataDifference, 0.0s DeadEndRemovalTime, 9.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1275 SDtfs, 12057 SDslu, 1727 SDs, 0 SdLazy, 16147 SolverSat, 2977 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1675 GetRequests, 1139 SyntacticMatches, 366 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3094occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9974861398549801 AbsIntWeakeningRatio, 0.1683991683991684 AbsIntAvgWeakeningVarsNumRemoved, 0.4282744282744283 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 794 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 124 PreInvPairs, 216 NumberOfFragments, 806 HoareAnnotationTreeSize, 124 FomulaSimplifications, 12245 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18044 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2507 NumberOfCodeBlocks, 2507 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2977 ConstructedInterpolants, 0 QuantifiedInterpolants, 2901856 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1517/1602 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...