java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:06:50,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:06:50,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:06:50,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:06:50,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:06:50,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:06:50,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:06:50,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:06:50,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:06:50,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:06:50,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:06:50,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:06:50,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:06:50,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:06:50,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:06:50,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:06:50,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:06:50,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:06:50,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:06:50,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:06:50,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:06:50,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:06:50,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:06:50,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:06:50,650 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:06:50,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:06:50,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:06:50,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:06:50,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:06:50,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:06:50,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:06:50,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:06:50,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:06:50,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:06:50,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:06:50,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:06:50,658 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:06:50,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:06:50,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:06:50,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:06:50,676 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:06:50,676 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:06:50,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:06:50,680 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:06:50,680 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:06:50,680 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:06:50,680 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:06:50,680 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:06:50,681 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:06:50,681 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:06:50,681 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:06:50,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:06:50,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:06:50,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:06:50,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:06:50,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:06:50,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:06:50,684 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:06:50,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:06:50,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:06:50,685 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:06:50,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:06:50,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:06:50,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:06:50,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:06:50,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:06:50,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:06:50,687 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:06:50,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:06:50,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:06:50,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:06:50,688 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:06:50,688 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:06:50,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:06:50,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:06:50,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:06:50,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:06:50,778 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:06:50,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-10-25 00:06:50,848 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9db20ce3b/43accca681234640aa6b861e6bd1d5ed/FLAG3612b5b07 [2018-10-25 00:06:51,468 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:06:51,469 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label31_true-unreach-call_false-termination.c [2018-10-25 00:06:51,482 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9db20ce3b/43accca681234640aa6b861e6bd1d5ed/FLAG3612b5b07 [2018-10-25 00:06:51,498 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9db20ce3b/43accca681234640aa6b861e6bd1d5ed [2018-10-25 00:06:51,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:06:51,513 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:06:51,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:51,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:06:51,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:06:51,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:51" (1/1) ... [2018-10-25 00:06:51,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcb10fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:51, skipping insertion in model container [2018-10-25 00:06:51,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:06:51" (1/1) ... [2018-10-25 00:06:51,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:06:51,601 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:06:52,032 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:52,040 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:06:52,191 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:06:52,209 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:06:52,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52 WrapperNode [2018-10-25 00:06:52,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:06:52,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:52,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:06:52,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:06:52,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:06:52,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:06:52,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:06:52,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:06:52,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... [2018-10-25 00:06:52,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:06:52,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:06:52,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:06:52,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:06:52,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:06:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:06:52,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:06:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:06:52,585 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:06:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:06:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:06:52,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:06:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:06:55,892 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:06:55,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:55 BoogieIcfgContainer [2018-10-25 00:06:55,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:06:55,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:06:55,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:06:55,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:06:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:06:51" (1/3) ... [2018-10-25 00:06:55,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a7a646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:55, skipping insertion in model container [2018-10-25 00:06:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:06:52" (2/3) ... [2018-10-25 00:06:55,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a7a646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:06:55, skipping insertion in model container [2018-10-25 00:06:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:06:55" (3/3) ... [2018-10-25 00:06:55,905 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label31_true-unreach-call_false-termination.c [2018-10-25 00:06:55,916 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:06:55,925 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:06:55,942 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:06:55,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:06:55,993 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:06:55,993 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:06:55,993 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:06:55,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:06:55,994 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:06:55,994 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:06:55,994 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:06:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:06:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-25 00:06:56,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:56,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:56,042 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:56,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -639549745, now seen corresponding path program 1 times [2018-10-25 00:06:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:56,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:56,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:56,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:56,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:06:56,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:56,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:56,775 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:06:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:58,712 INFO L93 Difference]: Finished difference Result 626 states and 1068 transitions. [2018-10-25 00:06:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:58,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-10-25 00:06:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:58,738 INFO L225 Difference]: With dead ends: 626 [2018-10-25 00:06:58,738 INFO L226 Difference]: Without dead ends: 387 [2018-10-25 00:06:58,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:06:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-25 00:06:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-10-25 00:06:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-25 00:06:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 644 transitions. [2018-10-25 00:06:58,830 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 644 transitions. Word has length 123 [2018-10-25 00:06:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:58,831 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 644 transitions. [2018-10-25 00:06:58,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 644 transitions. [2018-10-25 00:06:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 00:06:58,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:58,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:58,839 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:58,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash 533241592, now seen corresponding path program 1 times [2018-10-25 00:06:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:58,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:58,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:58,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:59,044 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-25 00:06:59,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:06:59,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:06:59,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:59,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:06:59,049 INFO L87 Difference]: Start difference. First operand 383 states and 644 transitions. Second operand 6 states. [2018-10-25 00:07:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:00,993 INFO L93 Difference]: Finished difference Result 1195 states and 2114 transitions. [2018-10-25 00:07:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:00,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-10-25 00:07:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:01,005 INFO L225 Difference]: With dead ends: 1195 [2018-10-25 00:07:01,006 INFO L226 Difference]: Without dead ends: 818 [2018-10-25 00:07:01,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:07:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-25 00:07:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 799. [2018-10-25 00:07:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-10-25 00:07:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1290 transitions. [2018-10-25 00:07:01,086 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1290 transitions. Word has length 144 [2018-10-25 00:07:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:01,087 INFO L481 AbstractCegarLoop]: Abstraction has 799 states and 1290 transitions. [2018-10-25 00:07:01,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1290 transitions. [2018-10-25 00:07:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-25 00:07:01,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:01,099 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:01,100 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 132953093, now seen corresponding path program 1 times [2018-10-25 00:07:01,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:01,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:01,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:01,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:01,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-10-25 00:07:01,463 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:01,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:01,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:02,262 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:02,264 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:07:02,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:02,307 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:02,841 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 81.07% of their original sizes. [2018-10-25 00:07:02,842 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:03,099 INFO L413 sIntCurrentIteration]: We have 152 unified AI predicates [2018-10-25 00:07:03,099 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:03,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:03,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:07:03,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:03,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:07:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:07:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:07:03,106 INFO L87 Difference]: Start difference. First operand 799 states and 1290 transitions. Second operand 6 states. [2018-10-25 00:07:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:12,347 INFO L93 Difference]: Finished difference Result 1742 states and 2813 transitions. [2018-10-25 00:07:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:07:12,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-10-25 00:07:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:12,353 INFO L225 Difference]: With dead ends: 1742 [2018-10-25 00:07:12,353 INFO L226 Difference]: Without dead ends: 949 [2018-10-25 00:07:12,356 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:07:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-10-25 00:07:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 946. [2018-10-25 00:07:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-10-25 00:07:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1448 transitions. [2018-10-25 00:07:12,388 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1448 transitions. Word has length 153 [2018-10-25 00:07:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:12,389 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 1448 transitions. [2018-10-25 00:07:12,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:07:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1448 transitions. [2018-10-25 00:07:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-25 00:07:12,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:12,394 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:12,395 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:12,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2026664401, now seen corresponding path program 1 times [2018-10-25 00:07:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:12,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:07:12,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:12,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:12,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-10-25 00:07:12,866 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:12,872 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:12,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:13,221 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:13,221 INFO L272 AbstractInterpreter]: Visited 127 different actions 248 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:07:13,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:13,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:13,816 INFO L232 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.07% of their original sizes. [2018-10-25 00:07:13,816 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:15,378 INFO L413 sIntCurrentIteration]: We have 157 unified AI predicates [2018-10-25 00:07:15,378 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:15,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:15,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:07:15,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:15,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:07:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:07:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:07:15,380 INFO L87 Difference]: Start difference. First operand 946 states and 1448 transitions. Second operand 10 states. [2018-10-25 00:07:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:24,458 INFO L93 Difference]: Finished difference Result 2553 states and 4086 transitions. [2018-10-25 00:07:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:07:24,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-10-25 00:07:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:24,467 INFO L225 Difference]: With dead ends: 2553 [2018-10-25 00:07:24,467 INFO L226 Difference]: Without dead ends: 1613 [2018-10-25 00:07:24,472 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 60 SyntacticMatches, 89 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:07:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-10-25 00:07:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1604. [2018-10-25 00:07:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 00:07:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2240 transitions. [2018-10-25 00:07:24,521 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2240 transitions. Word has length 158 [2018-10-25 00:07:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:24,521 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2240 transitions. [2018-10-25 00:07:24,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:07:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2240 transitions. [2018-10-25 00:07:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-25 00:07:24,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:24,528 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:07:24,529 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:24,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 175093060, now seen corresponding path program 1 times [2018-10-25 00:07:24,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:24,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:24,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:24,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:07:24,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:24,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:24,730 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-25 00:07:24,731 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:24,735 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:24,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:25,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:25,145 INFO L272 AbstractInterpreter]: Visited 128 different actions 381 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:25,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:25,154 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:26,281 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 82.41% of their original sizes. [2018-10-25 00:07:26,281 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:29,922 INFO L413 sIntCurrentIteration]: We have 162 unified AI predicates [2018-10-25 00:07:29,922 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:29,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:29,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:07:29,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:29,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:07:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:07:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:07:29,925 INFO L87 Difference]: Start difference. First operand 1604 states and 2240 transitions. Second operand 12 states. [2018-10-25 00:07:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:07:43,460 INFO L93 Difference]: Finished difference Result 4737 states and 6866 transitions. [2018-10-25 00:07:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:07:43,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2018-10-25 00:07:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:07:43,477 INFO L225 Difference]: With dead ends: 4737 [2018-10-25 00:07:43,477 INFO L226 Difference]: Without dead ends: 3139 [2018-10-25 00:07:43,485 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 30 SyntacticMatches, 122 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:07:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2018-10-25 00:07:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2971. [2018-10-25 00:07:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2018-10-25 00:07:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 3927 transitions. [2018-10-25 00:07:43,574 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 3927 transitions. Word has length 163 [2018-10-25 00:07:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:07:43,575 INFO L481 AbstractCegarLoop]: Abstraction has 2971 states and 3927 transitions. [2018-10-25 00:07:43,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:07:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 3927 transitions. [2018-10-25 00:07:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 00:07:43,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:07:43,586 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:07:43,586 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:07:43,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -131912193, now seen corresponding path program 1 times [2018-10-25 00:07:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:07:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:07:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:07:43,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:07:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:07:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 69 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 00:07:43,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:07:43,810 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:07:43,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-25 00:07:43,811 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:07:43,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:07:43,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:07:44,516 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:07:44,516 INFO L272 AbstractInterpreter]: Visited 128 different actions 381 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:07:44,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:07:44,550 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:07:45,246 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 82.41% of their original sizes. [2018-10-25 00:07:45,247 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:07:48,833 INFO L413 sIntCurrentIteration]: We have 189 unified AI predicates [2018-10-25 00:07:48,833 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:07:48,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:07:48,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-25 00:07:48,833 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:07:48,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:07:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:07:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:07:48,835 INFO L87 Difference]: Start difference. First operand 2971 states and 3927 transitions. Second operand 12 states. [2018-10-25 00:08:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:04,437 INFO L93 Difference]: Finished difference Result 6791 states and 9439 transitions. [2018-10-25 00:08:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:08:04,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2018-10-25 00:08:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:04,461 INFO L225 Difference]: With dead ends: 6791 [2018-10-25 00:08:04,461 INFO L226 Difference]: Without dead ends: 4495 [2018-10-25 00:08:04,472 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 40 SyntacticMatches, 139 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:08:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2018-10-25 00:08:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4312. [2018-10-25 00:08:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states. [2018-10-25 00:08:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5767 transitions. [2018-10-25 00:08:04,602 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5767 transitions. Word has length 190 [2018-10-25 00:08:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:04,603 INFO L481 AbstractCegarLoop]: Abstraction has 4312 states and 5767 transitions. [2018-10-25 00:08:04,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:08:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5767 transitions. [2018-10-25 00:08:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-25 00:08:04,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:04,619 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:04,620 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:04,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2024570990, now seen corresponding path program 1 times [2018-10-25 00:08:04,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:04,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:04,622 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 109 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-25 00:08:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:04,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:04,934 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-10-25 00:08:04,934 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [59], [63], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:04,937 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:04,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:05,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:05,339 INFO L272 AbstractInterpreter]: Visited 133 different actions 395 times. Merged at 8 different actions 26 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:05,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:05,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:05,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:05,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:05,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:05,357 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:05,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-25 00:08:05,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-25 00:08:05,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 00:08:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 8 [2018-10-25 00:08:05,991 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:05,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:05,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:08:05,992 INFO L87 Difference]: Start difference. First operand 4312 states and 5767 transitions. Second operand 3 states. [2018-10-25 00:08:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:08,473 INFO L93 Difference]: Finished difference Result 9218 states and 12688 transitions. [2018-10-25 00:08:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:08,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-10-25 00:08:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:08,501 INFO L225 Difference]: With dead ends: 9218 [2018-10-25 00:08:08,501 INFO L226 Difference]: Without dead ends: 5648 [2018-10-25 00:08:08,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:08:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states. [2018-10-25 00:08:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 5620. [2018-10-25 00:08:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5620 states. [2018-10-25 00:08:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 6989 transitions. [2018-10-25 00:08:08,683 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 6989 transitions. Word has length 203 [2018-10-25 00:08:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:08,683 INFO L481 AbstractCegarLoop]: Abstraction has 5620 states and 6989 transitions. [2018-10-25 00:08:08,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 6989 transitions. [2018-10-25 00:08:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-25 00:08:08,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:08,706 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:08:08,707 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:08,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 247594945, now seen corresponding path program 1 times [2018-10-25 00:08:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:08,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 123 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-25 00:08:09,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:09,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:08:09,674 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-25 00:08:09,674 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [655], [657], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:08:09,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:08:09,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:08:10,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:08:10,353 INFO L272 AbstractInterpreter]: Visited 132 different actions 398 times. Merged at 9 different actions 30 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:08:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:10,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:08:10,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:08:10,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:08:10,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:10,404 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:08:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:10,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:08:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:08:10,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:08:11,200 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:08:11,306 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:08:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 123 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-25 00:08:11,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:08:11,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:08:11,960 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:08:11,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:08:11,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:08:11,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:08:11,961 INFO L87 Difference]: Start difference. First operand 5620 states and 6989 transitions. Second operand 9 states. [2018-10-25 00:08:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:16,708 INFO L93 Difference]: Finished difference Result 19370 states and 26069 transitions. [2018-10-25 00:08:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:08:16,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2018-10-25 00:08:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:16,741 INFO L225 Difference]: With dead ends: 19370 [2018-10-25 00:08:16,741 INFO L226 Difference]: Without dead ends: 6756 [2018-10-25 00:08:16,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-10-25 00:08:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2018-10-25 00:08:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6607. [2018-10-25 00:08:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6607 states. [2018-10-25 00:08:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 7670 transitions. [2018-10-25 00:08:16,958 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 7670 transitions. Word has length 212 [2018-10-25 00:08:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:16,958 INFO L481 AbstractCegarLoop]: Abstraction has 6607 states and 7670 transitions. [2018-10-25 00:08:16,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:08:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 7670 transitions. [2018-10-25 00:08:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-25 00:08:16,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:08:16,979 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:08:16,979 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:08:16,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:08:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1415499020, now seen corresponding path program 1 times [2018-10-25 00:08:16,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:08:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:16,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:08:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:08:16,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:08:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:08:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 00:08:17,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:08:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:08:17,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:08:17,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:08:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:08:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:17,216 INFO L87 Difference]: Start difference. First operand 6607 states and 7670 transitions. Second operand 3 states. [2018-10-25 00:08:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:08:18,385 INFO L93 Difference]: Finished difference Result 12269 states and 14364 transitions. [2018-10-25 00:08:18,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:08:18,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-25 00:08:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:08:18,389 INFO L225 Difference]: With dead ends: 12269 [2018-10-25 00:08:18,389 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:08:18,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:08:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:08:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:08:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:08:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:08:18,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 239 [2018-10-25 00:08:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:08:18,410 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:08:18,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:08:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:08:18,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:08:18,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:08:19,128 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 128 [2018-10-25 00:08:19,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:08:19,354 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 135 [2018-10-25 00:08:20,288 WARN L179 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-25 00:08:20,683 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2018-10-25 00:08:25,585 WARN L179 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 385 DAG size of output: 79 [2018-10-25 00:08:26,370 WARN L179 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 83 [2018-10-25 00:08:26,797 WARN L179 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 83 [2018-10-25 00:08:26,800 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:08:26,800 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a25~0)| ~a25~0)) [2018-10-25 00:08:26,800 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:08:26,800 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,800 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:08:26,801 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,802 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:08:26,803 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,804 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:08:26,805 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 520) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,806 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:08:26,807 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:08:26,808 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:08:26,809 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:08:26,810 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:08:26,811 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:08:26,812 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:08:26,813 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:08:26,814 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:08:26,815 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:08:26,816 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:08:26,817 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,817 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,817 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,817 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse15 (= ~a28~0 8)) (.cse11 (= ~a28~0 7))) (let ((.cse12 (= 8 |old(~a28~0)|)) (.cse8 (<= ~a17~0 |old(~a17~0)|)) (.cse9 (or .cse15 .cse11)) (.cse14 (= ~a11~0 |old(~a11~0)|)) (.cse10 (= |old(~a25~0)| ~a25~0)) (.cse16 (not (= 1 ~a21~0))) (.cse13 (not (= 1 |old(~a19~0)|))) (.cse17 (= 0 |old(~a28~0)|))) (let ((.cse3 (< 7 |old(~a17~0)|)) (.cse2 (or .cse16 (= 0 |old(~a17~0)|) .cse13 .cse17)) (.cse0 (and (not (= ~a28~0 0)) (= ~a19~0 1) (= ~a21~0 1) (not (= ~a17~0 0)))) (.cse7 (not (= 1 |old(~a11~0)|))) (.cse6 (= 1 |old(~a25~0)|)) (.cse1 (or .cse16 .cse13 .cse17 (not (= 8 |old(~a17~0)|)))) (.cse4 (and .cse8 .cse9 .cse14 .cse10)) (.cse5 (and (not (= 7 |old(~a28~0)|)) (not .cse12)))) (and (or .cse0 .cse1) (or .cse2 .cse0 .cse3) (or .cse4 .cse5 .cse6) (or .cse7 .cse5 .cse3 (and .cse8 .cse9 (= 1 ~a11~0) .cse10)) (or .cse11 .cse12 .cse5) (or .cse0 .cse2 .cse5) (or .cse2 .cse0 .cse7 .cse6) (or (or (not (= 11 |old(~a28~0)|)) (not .cse6)) (= ~a28~0 11) (or (not (= 0 |old(~a11~0)|)) (= |calculate_output_#in~input| 0)) .cse1) (or (= ~a17~0 8) .cse1) (or .cse13 (= 1 ~a19~0)) (or .cse4 .cse13 .cse5) (or .cse12 (and .cse8 .cse14 (not .cse15) .cse10)))))) [2018-10-25 00:08:26,817 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:08:26,818 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,819 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:08:26,820 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:08:26,821 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:08:26,822 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:08:26,823 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:08:26,824 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:08:26,825 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:08:26,825 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:08:26,825 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a28~0 7) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)) (not (= 7 |old(~a28~0)|))) [2018-10-25 00:08:26,825 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:08:26,825 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 |old(~a17~0)|))) (or (and (<= ~a17~0 7) (= 1 ~a11~0)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (and .cse0 (not (= ~a28~0 8))) (not (= |old(~a25~0)| 0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (and .cse0 (not (= ~a25~0 1))) (not (= ~x~0 24)) (and .cse0 (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)) (not (= 7 |old(~a28~0)|)))) [2018-10-25 00:08:26,825 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:08:26,825 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:08:26,826 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 |old(~a17~0)|))) (or (and (<= ~a17~0 7) (= 1 ~a11~0)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (and .cse0 (not (= ~a28~0 8))) (not (= |old(~a25~0)| 0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (and .cse0 (not (= ~a25~0 1))) (not (= ~x~0 24)) (and .cse0 (= 1 ~a19~0)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)) (not (= 7 |old(~a28~0)|)))) [2018-10-25 00:08:26,826 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:08:26,826 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:08:26,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:08:26 BoogieIcfgContainer [2018-10-25 00:08:26,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:08:26,841 INFO L168 Benchmark]: Toolchain (without parser) took 95329.16 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,842 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:08:26,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,844 INFO L168 Benchmark]: Boogie Preprocessor took 94.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,845 INFO L168 Benchmark]: RCFGBuilder took 3392.00 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.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,846 INFO L168 Benchmark]: TraceAbstraction took 90942.40 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:08:26,851 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.13 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 198.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3392.00 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.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90942.40 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.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 520]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a17 <= 7 && 1 == a11) || !(\old(a11) == 0)) || !(v == 22)) || !(u == 21)) || !(a21 == 1)) || !(y == 25)) || !(3 == c)) || (a17 <= \old(a17) && !(a28 == 8))) || !(\old(a25) == 0)) || !(a == 1)) || !(26 == z)) || !(1 == \old(a19))) || (a17 <= \old(a17) && !(a25 == 1))) || !(x == 24)) || (a17 <= \old(a17) && 1 == a19)) || !(8 == \old(a17))) || !(e == 5)) || !(d == 4)) || !(6 == f)) || !(w == 23)) || !(7 == \old(a28)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 90.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 60.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1569 SDtfs, 7196 SDslu, 1700 SDs, 0 SdLazy, 14130 SolverSat, 1996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1569 GetRequests, 1123 SyntacticMatches, 355 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6607occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9971019587196057 AbsIntWeakeningRatio, 0.22424242424242424 AbsIntAvgWeakeningVarsNumRemoved, 6.701515151515151 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 563 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 208 PreInvPairs, 382 NumberOfFragments, 687 HoareAnnotationTreeSize, 208 FomulaSimplifications, 28824 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19605 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2000 NumberOfCodeBlocks, 2000 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2402 ConstructedInterpolants, 0 QuantifiedInterpolants, 751554 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1109 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 1349/1446 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...