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-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:16:13,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:16:13,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:16:13,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:16:13,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:16:13,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:16:13,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:16:13,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:16:13,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:16:13,692 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:16:13,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:16:13,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:16:13,694 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:16:13,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:16:13,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:16:13,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:16:13,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:16:13,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:16:13,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:16:13,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:16:13,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:16:13,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:16:13,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:16:13,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:16:13,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:16:13,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:16:13,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:16:13,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:16:13,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:16:13,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:16:13,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:16:13,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:16:13,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:16:13,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:16:13,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:16:13,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:16:13,722 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:16:13,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:16:13,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:16:13,746 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:16:13,746 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:16:13,746 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:16:13,746 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:16:13,747 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:16:13,747 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:16:13,747 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:16:13,747 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:16:13,747 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:16:13,748 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:16:13,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:16:13,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:16:13,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:16:13,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:16:13,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:16:13,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:16:13,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:16:13,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:16:13,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:16:13,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:16:13,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:16:13,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:16:13,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:16:13,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:16:13,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:16:13,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:16:13,753 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:16:13,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:16:13,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:16:13,753 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:16:13,754 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:16:13,754 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:16:13,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:16:13,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:16:13,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:16:13,823 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:16:13,824 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:16:13,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 12:16:13,899 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/517401fa4/3024ee30af6b46308e7944959eb0a65a/FLAGf209666b5 [2018-10-27 12:16:14,499 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:16:14,500 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 12:16:14,518 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/517401fa4/3024ee30af6b46308e7944959eb0a65a/FLAGf209666b5 [2018-10-27 12:16:14,539 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/517401fa4/3024ee30af6b46308e7944959eb0a65a [2018-10-27 12:16:14,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:16:14,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:16:14,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:16:14,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:16:14,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:16:14,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:16:14" (1/1) ... [2018-10-27 12:16:14,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@decac2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:14, skipping insertion in model container [2018-10-27 12:16:14,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:16:14" (1/1) ... [2018-10-27 12:16:14,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:16:14,644 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:16:15,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:16:15,134 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:16:15,266 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:16:15,284 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:16:15,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15 WrapperNode [2018-10-27 12:16:15,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:16:15,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:16:15,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:16:15,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:16:15,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:16:15,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:16:15,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:16:15,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:16:15,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (1/1) ... [2018-10-27 12:16:15,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:16:15,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:16:15,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:16:15,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:16:15,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (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-27 12:16:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:16:15,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:16:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:16:15,636 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:16:15,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:16:15,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:16:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:16:15,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:16:18,901 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:16:18,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:16:18 BoogieIcfgContainer [2018-10-27 12:16:18,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:16:18,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:16:18,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:16:18,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:16:18,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:16:14" (1/3) ... [2018-10-27 12:16:18,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de1b805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:16:18, skipping insertion in model container [2018-10-27 12:16:18,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:16:15" (2/3) ... [2018-10-27 12:16:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de1b805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:16:18, skipping insertion in model container [2018-10-27 12:16:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:16:18" (3/3) ... [2018-10-27 12:16:18,912 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-10-27 12:16:18,922 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:16:18,937 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:16:18,957 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:16:19,004 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:16:19,004 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:16:19,004 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:16:19,005 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:16:19,005 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:16:19,006 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:16:19,006 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:16:19,007 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:16:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 12:16:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-27 12:16:19,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:19,048 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] [2018-10-27 12:16:19,050 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:19,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-10-27 12:16:19,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:19,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:19,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:19,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:19,668 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:16:19,816 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-27 12:16:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:16:19,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:19,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:16:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:16:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:16:19,847 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 12:16:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:21,252 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 12:16:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:16:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-27 12:16:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:21,277 INFO L225 Difference]: With dead ends: 550 [2018-10-27 12:16:21,278 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 12:16:21,286 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-27 12:16:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 12:16:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 12:16:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 12:16:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-27 12:16:21,373 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-10-27 12:16:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:21,374 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-27 12:16:21,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:16:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-27 12:16:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-27 12:16:21,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:21,388 INFO L375 BasicCegarLoop]: trace histogram [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-27 12:16:21,388 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-10-27 12:16:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:21,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:21,658 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:16:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:21,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:16:21,711 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:21,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:16:21,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:16:21,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:16:21,714 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-27 12:16:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:23,436 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-27 12:16:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:16:23,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-10-27 12:16:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:23,444 INFO L225 Difference]: With dead ends: 888 [2018-10-27 12:16:23,444 INFO L226 Difference]: Without dead ends: 554 [2018-10-27 12:16:23,448 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-27 12:16:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-27 12:16:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-27 12:16:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-27 12:16:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-27 12:16:23,494 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-10-27 12:16:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:23,495 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-27 12:16:23,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:16:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-27 12:16:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 12:16:23,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:23,501 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 12:16:23,502 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:23,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-10-27 12:16:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:23,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:24,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:24,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:16:24,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:24,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:16:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:16:24,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:16:24,115 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-27 12:16:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:26,078 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-27 12:16:26,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:16:26,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-27 12:16:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:26,083 INFO L225 Difference]: With dead ends: 1210 [2018-10-27 12:16:26,083 INFO L226 Difference]: Without dead ends: 536 [2018-10-27 12:16:26,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:16:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-27 12:16:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-27 12:16:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-27 12:16:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-27 12:16:26,125 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-10-27 12:16:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:26,126 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-27 12:16:26,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:16:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-27 12:16:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-27 12:16:26,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:26,129 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:16:26,130 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:26,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-10-27 12:16:26,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:26,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:26,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:26,477 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 12:16:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:26,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:26,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:16:26,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:26,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:16:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:16:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:16:26,618 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-27 12:16:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:28,576 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-27 12:16:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:16:28,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-10-27 12:16:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:28,580 INFO L225 Difference]: With dead ends: 1204 [2018-10-27 12:16:28,580 INFO L226 Difference]: Without dead ends: 535 [2018-10-27 12:16:28,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:16:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-27 12:16:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-27 12:16:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-27 12:16:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-27 12:16:28,600 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-10-27 12:16:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:28,600 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-27 12:16:28,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:16:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-27 12:16:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 12:16:28,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:28,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:16:28,604 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:28,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-10-27 12:16:28,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:28,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:28,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:28,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:28,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:16:28,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:28,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:16:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:16:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:16:28,773 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-27 12:16:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:29,544 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-27 12:16:29,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:16:29,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-10-27 12:16:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:29,558 INFO L225 Difference]: With dead ends: 1521 [2018-10-27 12:16:29,558 INFO L226 Difference]: Without dead ends: 992 [2018-10-27 12:16:29,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:16:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-27 12:16:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-27 12:16:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-27 12:16:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-27 12:16:29,601 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-10-27 12:16:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:29,601 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-27 12:16:29,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:16:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-27 12:16:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-27 12:16:29,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:29,607 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 12:16:29,608 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:29,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-10-27 12:16:29,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:29,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:29,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:29,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:29,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:16:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:16:29,753 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:29,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:16:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:16:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:16:29,755 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-27 12:16:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:30,916 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-27 12:16:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:16:30,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-10-27 12:16:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:30,933 INFO L225 Difference]: With dead ends: 2947 [2018-10-27 12:16:30,933 INFO L226 Difference]: Without dead ends: 1961 [2018-10-27 12:16:30,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:16:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-27 12:16:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-27 12:16:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-27 12:16:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-27 12:16:31,008 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-10-27 12:16:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:31,009 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-27 12:16:31,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:16:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-27 12:16:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 12:16:31,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:31,017 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-27 12:16:31,018 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:31,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-10-27 12:16:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:31,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:16:31,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:31,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:16:31,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-27 12:16:31,250 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:16:31,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:16:31,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:16:31,886 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:16:31,888 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 12:16:31,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:31,923 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:16:32,387 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 79.59% of their original sizes. [2018-10-27 12:16:32,388 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:16:33,434 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-10-27 12:16:33,435 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:16:33,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:16:33,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 12:16:33,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:33,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:16:33,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:16:33,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:16:33,437 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-10-27 12:16:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:41,008 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-10-27 12:16:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 12:16:41,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-10-27 12:16:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:41,018 INFO L225 Difference]: With dead ends: 3911 [2018-10-27 12:16:41,018 INFO L226 Difference]: Without dead ends: 1989 [2018-10-27 12:16:41,024 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:16:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-10-27 12:16:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-10-27 12:16:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-10-27 12:16:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-10-27 12:16:41,087 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-10-27 12:16:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:41,088 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-10-27 12:16:41,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:16:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-10-27 12:16:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 12:16:41,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:41,098 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:16:41,099 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:41,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-10-27 12:16:41,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:41,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:41,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 12:16:41,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:41,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:16:41,382 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-10-27 12:16:41,382 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:16:41,388 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:16:41,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:16:41,824 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:16:41,825 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:16:41,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:41,864 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:16:42,262 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 81.38% of their original sizes. [2018-10-27 12:16:42,262 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:16:43,146 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-10-27 12:16:43,147 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:16:43,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:16:43,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:16:43,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:43,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:16:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:16:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:16:43,149 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 18 states. [2018-10-27 12:16:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:16:54,956 INFO L93 Difference]: Finished difference Result 4196 states and 5533 transitions. [2018-10-27 12:16:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 12:16:54,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 160 [2018-10-27 12:16:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:16:54,966 INFO L225 Difference]: With dead ends: 4196 [2018-10-27 12:16:54,966 INFO L226 Difference]: Without dead ends: 2274 [2018-10-27 12:16:54,973 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-10-27 12:16:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2018-10-27 12:16:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2263. [2018-10-27 12:16:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-10-27 12:16:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2914 transitions. [2018-10-27 12:16:55,032 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2914 transitions. Word has length 160 [2018-10-27 12:16:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:16:55,033 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 2914 transitions. [2018-10-27 12:16:55,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:16:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2914 transitions. [2018-10-27 12:16:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-27 12:16:55,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:16:55,042 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 12:16:55,042 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:16:55,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-10-27 12:16:55,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:16:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:55,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:16:55,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:16:55,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:16:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:16:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 12:16:55,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:16:55,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:16:55,219 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-10-27 12:16:55,219 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:16:55,224 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:16:55,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:16:55,673 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:16:55,674 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:16:55,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:16:55,680 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:16:56,195 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 81.07% of their original sizes. [2018-10-27 12:16:56,195 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:16:57,355 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-10-27 12:16:57,355 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:16:57,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:16:57,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-10-27 12:16:57,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:16:57,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 12:16:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 12:16:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-10-27 12:16:57,357 INFO L87 Difference]: Start difference. First operand 2263 states and 2914 transitions. Second operand 25 states. [2018-10-27 12:17:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:07,888 INFO L93 Difference]: Finished difference Result 4605 states and 5974 transitions. [2018-10-27 12:17:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 12:17:07,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 193 [2018-10-27 12:17:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:07,899 INFO L225 Difference]: With dead ends: 4605 [2018-10-27 12:17:07,899 INFO L226 Difference]: Without dead ends: 2683 [2018-10-27 12:17:07,906 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2018-10-27 12:17:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-10-27 12:17:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2401. [2018-10-27 12:17:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-10-27 12:17:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3057 transitions. [2018-10-27 12:17:07,967 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3057 transitions. Word has length 193 [2018-10-27 12:17:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:07,968 INFO L481 AbstractCegarLoop]: Abstraction has 2401 states and 3057 transitions. [2018-10-27 12:17:07,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 12:17:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3057 transitions. [2018-10-27 12:17:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-27 12:17:07,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:17:07,977 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 12:17:07,978 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:17:07,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:07,978 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-10-27 12:17:07,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:17:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:07,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:07,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:17:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 12:17:08,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:08,536 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:17:08,536 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-10-27 12:17:08,537 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:17:08,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:17:08,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:17:09,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:17:09,707 INFO L272 AbstractInterpreter]: Visited 123 different actions 569 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:17:09,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:09,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:17:09,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:09,717 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-27 12:17:09,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:09,728 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:17:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:09,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:17:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-27 12:17:10,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:17:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 12:17:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:17:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 12:17:10,390 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:17:10,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:17:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:17:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:17:10,392 INFO L87 Difference]: Start difference. First operand 2401 states and 3057 transitions. Second operand 11 states. [2018-10-27 12:17:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:14,377 INFO L93 Difference]: Finished difference Result 8864 states and 12047 transitions. [2018-10-27 12:17:14,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 12:17:14,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-10-27 12:17:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:14,409 INFO L225 Difference]: With dead ends: 8864 [2018-10-27 12:17:14,409 INFO L226 Difference]: Without dead ends: 6668 [2018-10-27 12:17:14,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:17:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2018-10-27 12:17:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6461. [2018-10-27 12:17:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6461 states. [2018-10-27 12:17:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 8219 transitions. [2018-10-27 12:17:14,637 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 8219 transitions. Word has length 202 [2018-10-27 12:17:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:14,638 INFO L481 AbstractCegarLoop]: Abstraction has 6461 states and 8219 transitions. [2018-10-27 12:17:14,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:17:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 8219 transitions. [2018-10-27 12:17:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 12:17:14,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:17:14,659 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 12:17:14,660 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:17:14,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-10-27 12:17:14,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:17:14,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:14,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:14,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:14,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:17:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 12:17:14,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:14,973 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:17:14,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-27 12:17:14,974 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:17:14,979 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:17:14,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:17:15,926 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:17:15,926 INFO L272 AbstractInterpreter]: Visited 122 different actions 310 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-27 12:17:15,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:15,963 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:17:16,362 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 80.36% of their original sizes. [2018-10-27 12:17:16,362 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:17:17,308 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-10-27 12:17:17,309 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:17:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:17:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:17:17,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:17:17,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:17:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:17:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:17:17,311 INFO L87 Difference]: Start difference. First operand 6461 states and 8219 transitions. Second operand 11 states. [2018-10-27 12:17:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:25,696 INFO L93 Difference]: Finished difference Result 12860 states and 16425 transitions. [2018-10-27 12:17:25,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 12:17:25,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-10-27 12:17:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:25,722 INFO L225 Difference]: With dead ends: 12860 [2018-10-27 12:17:25,722 INFO L226 Difference]: Without dead ends: 6742 [2018-10-27 12:17:25,739 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:17:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-10-27 12:17:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6737. [2018-10-27 12:17:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-10-27 12:17:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8515 transitions. [2018-10-27 12:17:25,905 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8515 transitions. Word has length 211 [2018-10-27 12:17:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:25,906 INFO L481 AbstractCegarLoop]: Abstraction has 6737 states and 8515 transitions. [2018-10-27 12:17:25,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:17:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8515 transitions. [2018-10-27 12:17:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-27 12:17:25,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:17:25,924 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 12:17:25,924 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:17:25,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 310011569, now seen corresponding path program 1 times [2018-10-27 12:17:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:17:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:25,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:17:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:26,425 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 12:17:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 12:17:26,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:26,458 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:17:26,458 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-10-27 12:17:26,458 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:17:26,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:17:26,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:17:26,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:17:26,686 INFO L272 AbstractInterpreter]: Visited 121 different actions 190 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 12:17:26,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:26,694 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:17:26,992 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 80.15% of their original sizes. [2018-10-27 12:17:26,992 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:17:27,275 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-10-27 12:17:27,275 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:17:27,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:17:27,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:17:27,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:17:27,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:17:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:17:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:17:27,276 INFO L87 Difference]: Start difference. First operand 6737 states and 8515 transitions. Second operand 18 states. [2018-10-27 12:17:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:35,035 INFO L93 Difference]: Finished difference Result 12994 states and 16539 transitions. [2018-10-27 12:17:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 12:17:35,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 215 [2018-10-27 12:17:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:35,059 INFO L225 Difference]: With dead ends: 12994 [2018-10-27 12:17:35,059 INFO L226 Difference]: Without dead ends: 6876 [2018-10-27 12:17:35,075 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:17:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6876 states. [2018-10-27 12:17:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6876 to 6875. [2018-10-27 12:17:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-10-27 12:17:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 8654 transitions. [2018-10-27 12:17:35,222 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 8654 transitions. Word has length 215 [2018-10-27 12:17:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:35,222 INFO L481 AbstractCegarLoop]: Abstraction has 6875 states and 8654 transitions. [2018-10-27 12:17:35,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:17:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 8654 transitions. [2018-10-27 12:17:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-27 12:17:35,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:17:35,241 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 12:17:35,242 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:17:35,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-10-27 12:17:35,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:17:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:35,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:17:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:35,703 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 12:17:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 12:17:35,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:35,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:17:35,747 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-10-27 12:17:35,747 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:17:35,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:17:35,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:17:38,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:17:38,463 INFO L272 AbstractInterpreter]: Visited 123 different actions 1309 times. Merged at 9 different actions 117 times. Widened at 1 different actions 7 times. Found 28 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:17:38,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:38,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:17:38,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:38,472 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:17:38,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:38,482 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:17:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:38,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:17:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 12:17:38,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:17:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-27 12:17:39,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:17:39,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-10-27 12:17:39,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:17:39,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 12:17:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 12:17:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:17:39,131 INFO L87 Difference]: Start difference. First operand 6875 states and 8654 transitions. Second operand 8 states. [2018-10-27 12:17:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:41,980 INFO L93 Difference]: Finished difference Result 14080 states and 18213 transitions. [2018-10-27 12:17:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 12:17:41,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-10-27 12:17:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:42,004 INFO L225 Difference]: With dead ends: 14080 [2018-10-27 12:17:42,004 INFO L226 Difference]: Without dead ends: 7962 [2018-10-27 12:17:42,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:17:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2018-10-27 12:17:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7511. [2018-10-27 12:17:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2018-10-27 12:17:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 9045 transitions. [2018-10-27 12:17:42,194 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 9045 transitions. Word has length 227 [2018-10-27 12:17:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:42,195 INFO L481 AbstractCegarLoop]: Abstraction has 7511 states and 9045 transitions. [2018-10-27 12:17:42,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 12:17:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 9045 transitions. [2018-10-27 12:17:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-27 12:17:42,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:17:42,216 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-27 12:17:42,217 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:17:42,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-10-27 12:17:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:17:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:17:42,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:17:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 12:17:42,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:42,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:17:42,596 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-10-27 12:17:42,596 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 12:17:42,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:17:42,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:17:44,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:17:44,188 INFO L272 AbstractInterpreter]: Visited 123 different actions 930 times. Merged at 8 different actions 74 times. Widened at 1 different actions 4 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 12:17:44,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:17:44,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:17:44,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:17:44,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:17:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:17:44,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:17:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:17:44,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:17:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-27 12:17:44,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:17:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-27 12:17:44,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:17:44,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-27 12:17:44,919 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:17:44,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:17:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:17:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:17:44,920 INFO L87 Difference]: Start difference. First operand 7511 states and 9045 transitions. Second operand 12 states. [2018-10-27 12:17:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:17:49,568 INFO L93 Difference]: Finished difference Result 14177 states and 18479 transitions. [2018-10-27 12:17:49,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 12:17:49,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-10-27 12:17:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:17:49,569 INFO L225 Difference]: With dead ends: 14177 [2018-10-27 12:17:49,569 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:17:49,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 12:17:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:17:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:17:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:17:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:17:49,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-10-27 12:17:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:17:49,608 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:17:49,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:17:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:17:49,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:17:49,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:17:50,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,769 WARN L179 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 301 [2018-10-27 12:17:50,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:50,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:17:51,455 WARN L179 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 305 [2018-10-27 12:17:52,181 WARN L179 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-10-27 12:17:52,566 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-10-27 12:17:55,621 WARN L179 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 321 DAG size of output: 174 [2018-10-27 12:17:57,829 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 324 DAG size of output: 110 [2018-10-27 12:17:59,696 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 328 DAG size of output: 110 [2018-10-27 12:17:59,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:17:59,700 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-10-27 12:17:59,700 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:17:59,700 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 12:17:59,700 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 12:17:59,700 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 12:17:59,701 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,702 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 12:17:59,703 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 12:17:59,704 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 12:17:59,705 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,706 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 12:17:59,707 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,708 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 12:17:59,709 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 12:17:59,710 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 12:17:59,711 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 12:17:59,712 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,713 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 12:17:59,714 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 12:17:59,715 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 12:17:59,715 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|)) (.cse22 (= ~a8~0 15)) (.cse21 (= ~a21~0 1))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse10 (and .cse22 .cse21)) (.cse19 (< 1 |old(~a17~0)|)) (.cse13 (not (= 15 |old(~a8~0)|))) (.cse20 (< |old(~a17~0)| 0)) (.cse16 (< |calculate_output_#in~input| 1)) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse17 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse7 (= 1 |old(~a7~0)|)) (.cse18 (not (= 1 |old(~a20~0)|))) (.cse8 (not .cse5)) (.cse2 (not (= 8 ~a12~0))) (.cse23 (= 1 ~a20~0)) (.cse24 (= 13 ~a8~0)) (.cse25 (= |old(~a16~0)| ~a16~0)) (.cse26 (= 1 ~a21~0)) (.cse27 (= 1 ~a17~0)) (.cse28 (not (= 13 |old(~a8~0)|))) (.cse15 (not .cse6))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or .cse7 .cse8 .cse1 .cse2 .cse6) (or .cse9 .cse10 (let ((.cse14 (not (= 5 |old(~a16~0)|)))) (and (or .cse11 .cse12 .cse13 (not (= 0 |old(~a17~0)|)) (not (= 0 |old(~a20~0)|)) .cse14 .cse2) (or .cse11 .cse12 .cse13 .cse14 .cse2 (< |old(~a20~0)| 0) .cse15))) .cse4 .cse16) (or .cse0 .cse5 .cse17 .cse2 .cse6 .cse1) (or .cse0 .cse7 .cse1 .cse17 .cse2) (or .cse1 (or .cse0 .cse18 .cse2 .cse3)) (or .cse7 .cse17 .cse2 .cse1 .cse4) (or (or .cse11 .cse12 .cse2 .cse19 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse13 .cse20 .cse6) .cse18 .cse10) (or .cse7 .cse1 .cse5 .cse18 .cse2 .cse15) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse21 .cse22) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse16 .cse11 .cse9 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse9 (or .cse11 .cse12) .cse10 .cse2 .cse19 .cse18 .cse13 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) .cse20 .cse6 .cse16) (or .cse12 .cse18 .cse8 (and (= 1 ~a7~0) .cse23 .cse24 .cse25 .cse26 .cse27) .cse2 (not .cse7) .cse28 .cse15) (or .cse7 .cse17 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse17 .cse2 .cse6 .cse4) (or .cse12 .cse7 .cse18 .cse8 .cse2 (and (not (= ~a7~0 1)) .cse23 .cse24 .cse25 .cse26 .cse27) .cse28 .cse15)))) [2018-10-27 12:17:59,715 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 12:17:59,715 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-10-27 12:17:59,716 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 12:17:59,717 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 12:17:59,718 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,719 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 12:17:59,720 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-27 12:17:59,721 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:17:59,721 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:17:59,721 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:17:59,722 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:17:59,722 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-10-27 12:17:59,722 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 12:17:59,722 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 12:17:59,722 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 12:17:59,722 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-10-27 12:17:59,723 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 12:17:59,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:17:59 BoogieIcfgContainer [2018-10-27 12:17:59,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:17:59,741 INFO L168 Benchmark]: Toolchain (without parser) took 105188.26 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:17:59,742 INFO L168 Benchmark]: CDTParser took 0.20 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-27 12:17:59,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:17:59,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 182.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-27 12:17:59,745 INFO L168 Benchmark]: Boogie Preprocessor took 90.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:17:59,745 INFO L168 Benchmark]: RCFGBuilder took 3343.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-10-27 12:17:59,746 INFO L168 Benchmark]: TraceAbstraction took 100836.93 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 12:17:59,751 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.20 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 730.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 182.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -824.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3343.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100836.93 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || !(21 == u)) || !(22 == v)) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 100.7s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 66.9s AutomataDifference, 0.0s DeadEndRemovalTime, 10.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2047 SDtfs, 13053 SDslu, 2587 SDs, 0 SdLazy, 15573 SolverSat, 2306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2498 GetRequests, 2247 SyntacticMatches, 17 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7511occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.3s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9971292228339744 AbsIntWeakeningRatio, 0.22162162162162163 AbsIntAvgWeakeningVarsNumRemoved, 20.747027027027027 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1005 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 358 PreInvPairs, 626 NumberOfFragments, 1351 HoareAnnotationTreeSize, 358 FomulaSimplifications, 21822 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19805 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3704 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 2336/2540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...