java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:51:24,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:51:24,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:51:24,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:51:24,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:51:24,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:51:24,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:51:24,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:51:24,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:51:24,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:51:24,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:51:24,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:51:24,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:51:24,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:51:24,900 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:51:24,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:51:24,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:51:24,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:51:24,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:51:24,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:51:24,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:51:24,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:51:24,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:51:24,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:51:24,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:51:24,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:51:24,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:51:24,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:51:24,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:51:24,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:51:24,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:51:24,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:51:24,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:51:24,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:51:24,927 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:51:24,928 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:51:24,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:51:24,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:51:24,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:51:24,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:51:24,961 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:51:24,961 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:51:24,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:51:24,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:51:24,962 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:51:24,962 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:51:24,963 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:51:24,963 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:51:24,963 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:51:24,964 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:51:24,964 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:51:24,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:51:24,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:51:24,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:51:24,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:51:24,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:51:24,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:51:24,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:51:24,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:51:24,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:51:24,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:51:24,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:51:24,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:51:24,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:51:24,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:51:24,969 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:51:24,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:51:24,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:51:24,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:51:24,971 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:51:24,971 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:51:25,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:51:25,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:51:25,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:51:25,065 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:51:25,066 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:51:25,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-07 12:51:25,131 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd4729d0/3cb246ea1b554bac983feb8770ba005b/FLAGe4be9d4f9 [2018-11-07 12:51:25,706 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:51:25,707 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-07 12:51:25,723 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd4729d0/3cb246ea1b554bac983feb8770ba005b/FLAGe4be9d4f9 [2018-11-07 12:51:25,748 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd4729d0/3cb246ea1b554bac983feb8770ba005b [2018-11-07 12:51:25,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:51:25,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:51:25,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:51:25,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:51:25,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:51:25,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:51:25" (1/1) ... [2018-11-07 12:51:25,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42126e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:25, skipping insertion in model container [2018-11-07 12:51:25,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:51:25" (1/1) ... [2018-11-07 12:51:25,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:51:25,873 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:51:26,357 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:51:26,363 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:51:26,476 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:51:26,495 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:51:26,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26 WrapperNode [2018-11-07 12:51:26,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:51:26,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:51:26,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:51:26,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:51:26,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:51:26,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:51:26,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:51:26,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:51:26,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... [2018-11-07 12:51:26,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:51:26,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:51:26,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:51:26,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:51:26,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 12:51:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:51:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:51:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:51:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:51:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:51:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:51:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:51:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:51:26,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:51:30,035 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:51:30,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:51:30 BoogieIcfgContainer [2018-11-07 12:51:30,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:51:30,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:51:30,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:51:30,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:51:30,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:51:25" (1/3) ... [2018-11-07 12:51:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e88c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:51:30, skipping insertion in model container [2018-11-07 12:51:30,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:51:26" (2/3) ... [2018-11-07 12:51:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e88c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:51:30, skipping insertion in model container [2018-11-07 12:51:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:51:30" (3/3) ... [2018-11-07 12:51:30,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-11-07 12:51:30,056 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:51:30,064 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:51:30,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:51:30,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:51:30,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:51:30,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:51:30,125 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:51:30,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:51:30,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:51:30,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:51:30,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:51:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:51:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 12:51:30,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:30,173 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] [2018-11-07 12:51:30,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:30,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash 117916544, now seen corresponding path program 1 times [2018-11-07 12:51:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:30,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:30,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:30,866 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:51:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:30,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:51:30,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:51:30,951 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:30,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:51:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:51:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:51:30,980 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:51:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:32,551 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 12:51:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:51:32,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-11-07 12:51:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:32,574 INFO L225 Difference]: With dead ends: 618 [2018-11-07 12:51:32,575 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 12:51:32,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:51:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 12:51:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 12:51:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 12:51:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 12:51:32,665 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 122 [2018-11-07 12:51:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:32,667 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 12:51:32,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:51:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 12:51:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 12:51:32,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:32,674 INFO L375 BasicCegarLoop]: trace histogram [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-11-07 12:51:32,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:32,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash -735277163, now seen corresponding path program 1 times [2018-11-07 12:51:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:32,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:32,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:51:32,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:51:32,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:32,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:51:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:51:32,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:51:32,912 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 12:51:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:35,079 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-11-07 12:51:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 12:51:35,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-11-07 12:51:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:35,094 INFO L225 Difference]: With dead ends: 1229 [2018-11-07 12:51:35,094 INFO L226 Difference]: Without dead ends: 856 [2018-11-07 12:51:35,099 INFO L604 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-11-07 12:51:35,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-07 12:51:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-11-07 12:51:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-11-07 12:51:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-11-07 12:51:35,185 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 138 [2018-11-07 12:51:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:35,185 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-11-07 12:51:35,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:51:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-11-07 12:51:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-07 12:51:35,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:35,193 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:35,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:35,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:35,194 INFO L82 PathProgramCache]: Analyzing trace with hash 336904770, now seen corresponding path program 1 times [2018-11-07 12:51:35,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:35,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:35,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:51:35,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:51:35,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:35,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:51:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:51:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:51:35,549 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 5 states. [2018-11-07 12:51:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:38,818 INFO L93 Difference]: Finished difference Result 1778 states and 2834 transitions. [2018-11-07 12:51:38,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 12:51:38,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-11-07 12:51:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:38,828 INFO L225 Difference]: With dead ends: 1778 [2018-11-07 12:51:38,829 INFO L226 Difference]: Without dead ends: 813 [2018-11-07 12:51:38,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:51:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-11-07 12:51:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2018-11-07 12:51:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-11-07 12:51:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1260 transitions. [2018-11-07 12:51:38,882 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1260 transitions. Word has length 149 [2018-11-07 12:51:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:38,883 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1260 transitions. [2018-11-07 12:51:38,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:51:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1260 transitions. [2018-11-07 12:51:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 12:51:38,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:38,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:38,892 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:38,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 981001735, now seen corresponding path program 1 times [2018-11-07 12:51:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:38,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:38,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:38,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:39,178 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:51:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 12:51:39,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:39,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:39,249 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 12:51:39,252 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:51:39,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:39,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:40,038 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:40,040 INFO L272 AbstractInterpreter]: Visited 123 different actions 123 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:51:40,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:40,086 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:40,934 INFO L227 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 81.13% of their original sizes. [2018-11-07 12:51:40,935 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:42,449 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-07 12:51:42,450 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:42,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:42,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:51:42,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:42,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:51:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:51:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:51:42,453 INFO L87 Difference]: Start difference. First operand 813 states and 1260 transitions. Second operand 14 states. [2018-11-07 12:52:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:02,949 INFO L93 Difference]: Finished difference Result 1920 states and 2965 transitions. [2018-11-07 12:52:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 12:52:02,950 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2018-11-07 12:52:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:02,956 INFO L225 Difference]: With dead ends: 1920 [2018-11-07 12:52:02,957 INFO L226 Difference]: Without dead ends: 1113 [2018-11-07 12:52:02,960 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:52:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-07 12:52:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 960. [2018-11-07 12:52:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-11-07 12:52:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1414 transitions. [2018-11-07 12:52:02,989 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1414 transitions. Word has length 190 [2018-11-07 12:52:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:02,989 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 1414 transitions. [2018-11-07 12:52:02,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:52:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1414 transitions. [2018-11-07 12:52:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 12:52:02,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:02,995 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-07 12:52:02,995 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:02,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -473493464, now seen corresponding path program 1 times [2018-11-07 12:52:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:02,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:02,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 73 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:52:03,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:03,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:03,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-11-07 12:52:03,239 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:03,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:03,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:04,000 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:04,001 INFO L272 AbstractInterpreter]: Visited 127 different actions 380 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:52:04,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:04,011 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:04,399 INFO L227 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 80.93% of their original sizes. [2018-11-07 12:52:04,400 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:04,607 INFO L415 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2018-11-07 12:52:04,607 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-11-07 12:52:04,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:52:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:52:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:52:04,609 INFO L87 Difference]: Start difference. First operand 960 states and 1414 transitions. Second operand 10 states. [2018-11-07 12:52:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:13,124 INFO L93 Difference]: Finished difference Result 2355 states and 3474 transitions. [2018-11-07 12:52:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:52:13,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 200 [2018-11-07 12:52:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:13,132 INFO L225 Difference]: With dead ends: 2355 [2018-11-07 12:52:13,133 INFO L226 Difference]: Without dead ends: 1401 [2018-11-07 12:52:13,136 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:52:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-11-07 12:52:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1328. [2018-11-07 12:52:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-11-07 12:52:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1862 transitions. [2018-11-07 12:52:13,175 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1862 transitions. Word has length 200 [2018-11-07 12:52:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:13,175 INFO L480 AbstractCegarLoop]: Abstraction has 1328 states and 1862 transitions. [2018-11-07 12:52:13,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:52:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1862 transitions. [2018-11-07 12:52:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 12:52:13,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:13,182 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:52:13,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:13,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 104113150, now seen corresponding path program 1 times [2018-11-07 12:52:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:13,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:13,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:52:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:13,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:13,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-07 12:52:13,649 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:13,661 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:13,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:14,059 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:14,059 INFO L272 AbstractInterpreter]: Visited 126 different actions 246 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:52:14,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:14,095 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:14,535 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 81.03% of their original sizes. [2018-11-07 12:52:14,535 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:14,934 INFO L415 sIntCurrentIteration]: We unified 206 AI predicates to 206 [2018-11-07 12:52:14,934 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:14,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:14,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:52:14,934 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:14,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:52:14,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:52:14,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:52:14,936 INFO L87 Difference]: Start difference. First operand 1328 states and 1862 transitions. Second operand 18 states. [2018-11-07 12:52:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:26,916 INFO L93 Difference]: Finished difference Result 3105 states and 4362 transitions. [2018-11-07 12:52:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:52:26,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2018-11-07 12:52:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:26,924 INFO L225 Difference]: With dead ends: 3105 [2018-11-07 12:52:26,925 INFO L226 Difference]: Without dead ends: 1783 [2018-11-07 12:52:26,929 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:52:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-11-07 12:52:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1773. [2018-11-07 12:52:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2018-11-07 12:52:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2390 transitions. [2018-11-07 12:52:26,978 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2390 transitions. Word has length 207 [2018-11-07 12:52:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:26,978 INFO L480 AbstractCegarLoop]: Abstraction has 1773 states and 2390 transitions. [2018-11-07 12:52:26,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:52:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2390 transitions. [2018-11-07 12:52:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 12:52:26,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:26,986 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:52:26,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:26,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1037038642, now seen corresponding path program 1 times [2018-11-07 12:52:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:26,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 12:52:27,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:27,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:27,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-11-07 12:52:27,874 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:27,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:27,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:29,733 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:29,733 INFO L272 AbstractInterpreter]: Visited 128 different actions 1022 times. Merged at 8 different actions 75 times. Widened at 1 different actions 4 times. Found 16 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:52:29,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:29,741 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:30,109 INFO L227 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 80.93% of their original sizes. [2018-11-07 12:52:30,110 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:30,326 INFO L415 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2018-11-07 12:52:30,327 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:30,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:30,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-07 12:52:30,327 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:52:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:52:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:52:30,329 INFO L87 Difference]: Start difference. First operand 1773 states and 2390 transitions. Second operand 11 states. [2018-11-07 12:52:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:38,923 INFO L93 Difference]: Finished difference Result 4180 states and 5709 transitions. [2018-11-07 12:52:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 12:52:38,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 226 [2018-11-07 12:52:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:38,933 INFO L225 Difference]: With dead ends: 4180 [2018-11-07 12:52:38,933 INFO L226 Difference]: Without dead ends: 2413 [2018-11-07 12:52:38,938 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-07 12:52:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2018-11-07 12:52:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2331. [2018-11-07 12:52:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2018-11-07 12:52:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 3093 transitions. [2018-11-07 12:52:39,001 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 3093 transitions. Word has length 226 [2018-11-07 12:52:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:39,002 INFO L480 AbstractCegarLoop]: Abstraction has 2331 states and 3093 transitions. [2018-11-07 12:52:39,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:52:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3093 transitions. [2018-11-07 12:52:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 12:52:39,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:39,010 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:52:39,010 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:39,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash 253386791, now seen corresponding path program 1 times [2018-11-07 12:52:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:39,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 12:52:39,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:39,473 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:39,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-11-07 12:52:39,474 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:52:39,479 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:39,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:39,867 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:39,867 INFO L272 AbstractInterpreter]: Visited 127 different actions 250 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:52:39,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:39,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:40,366 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 81.57% of their original sizes. [2018-11-07 12:52:40,366 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:40,954 INFO L415 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2018-11-07 12:52:40,954 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:40,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-07 12:52:40,955 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:40,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 12:52:40,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 12:52:40,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:52:40,956 INFO L87 Difference]: Start difference. First operand 2331 states and 3093 transitions. Second operand 20 states. [2018-11-07 12:53:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:00,428 INFO L93 Difference]: Finished difference Result 5247 states and 6855 transitions. [2018-11-07 12:53:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 12:53:00,429 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2018-11-07 12:53:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:00,440 INFO L225 Difference]: With dead ends: 5247 [2018-11-07 12:53:00,441 INFO L226 Difference]: Without dead ends: 2922 [2018-11-07 12:53:00,447 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 12:53:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-11-07 12:53:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2771. [2018-11-07 12:53:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2018-11-07 12:53:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3593 transitions. [2018-11-07 12:53:00,850 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3593 transitions. Word has length 228 [2018-11-07 12:53:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:00,850 INFO L480 AbstractCegarLoop]: Abstraction has 2771 states and 3593 transitions. [2018-11-07 12:53:00,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 12:53:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3593 transitions. [2018-11-07 12:53:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 12:53:00,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:00,860 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:00,860 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:00,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash -591739514, now seen corresponding path program 1 times [2018-11-07 12:53:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:00,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:01,126 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 12:53:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:01,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:01,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:01,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-07 12:53:01,408 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [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], [301], [306], [308], [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], [647], [649], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:53:01,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:01,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:01,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:01,918 INFO L272 AbstractInterpreter]: Visited 130 different actions 384 times. Merged at 8 different actions 22 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:53:01,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:01,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:01,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:01,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 12:53:01,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:01,943 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:02,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:53:02,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:53:03,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:53:03,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-07 12:53:03,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:53:03,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 12:53:03,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 12:53:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:53:03,044 INFO L87 Difference]: Start difference. First operand 2771 states and 3593 transitions. Second operand 15 states. [2018-11-07 12:53:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:07,328 INFO L93 Difference]: Finished difference Result 7719 states and 10310 transitions. [2018-11-07 12:53:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 12:53:07,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2018-11-07 12:53:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:07,329 INFO L225 Difference]: With dead ends: 7719 [2018-11-07 12:53:07,329 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:53:07,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 12:53:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:53:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:53:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:53:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:53:07,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2018-11-07 12:53:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:07,358 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:53:07,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 12:53:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:53:07,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:53:07,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:53:07,996 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 165 [2018-11-07 12:53:08,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:08,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:08,299 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 198 [2018-11-07 12:53:09,005 WARN L179 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-07 12:53:09,343 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-07 12:53:11,591 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 304 DAG size of output: 111 [2018-11-07 12:53:11,988 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 80 [2018-11-07 12:53:12,885 WARN L179 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 80 [2018-11-07 12:53:12,889 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|)) [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,890 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:53:12,891 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,892 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:53:12,893 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:53:12,894 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:53:12,895 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,896 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:53:12,897 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,898 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:53:12,899 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:53:12,900 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:53:12,901 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:53:12,902 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,903 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:53:12,904 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,905 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:53:12,906 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,907 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,908 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse5 (< |old(~a28~0)| 7)) (.cse24 (not (= 0 |old(~a25~0)|))) (.cse7 (not (= 1 |old(~a19~0)|))) (.cse8 (< 1 |old(~a25~0)|)) (.cse23 (not (= 0 |old(~a11~0)|))) (.cse11 (not (= 1 ~a21~0))) (.cse12 (<= ~a25~0 1))) (let ((.cse15 (= |old(~a28~0)| ~a28~0)) (.cse16 (= |old(~a19~0)| ~a19~0)) (.cse17 (= ~a11~0 |old(~a11~0)|)) (.cse3 (< |old(~a25~0)| 0)) (.cse2 (<= 0 ~a25~0)) (.cse19 (= 7 ~a17~0)) (.cse20 (not (= 7 |old(~a17~0)|))) (.cse22 (not (= 1 |old(~a25~0)|))) (.cse1 (or (and (<= ~a11~0 5) .cse12) (and (<= 9 ~a28~0) .cse12))) (.cse4 (and (or .cse11 (< 5 |old(~a11~0)|)) (or .cse11 (< |old(~a28~0)| 9)))) (.cse13 (< 6 |old(~a11~0)|)) (.cse14 (< 21 |old(~a28~0)|)) (.cse18 (= |old(~a17~0)| |old(~a28~0)|)) (.cse10 (< |calculate_output_#in~input| 1)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse21 (let ((.cse25 (< 11 |old(~a28~0)|))) (and (or .cse11 .cse7 .cse23 .cse25 .cse5 .cse24) (or .cse11 (< |old(~a28~0)| 8) .cse7 .cse8 .cse23 .cse25)))) (.cse6 (< 10 |old(~a28~0)|)) (.cse9 (not (= |old(~a17~0)| 8)))) (and (or .cse0 (< 1 |old(~a11~0)|) (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 (< |old(~a11~0)| 0) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse5 .cse7 .cse13 .cse8 .cse14 .cse9 (= |old(~a11~0)| |old(~a19~0)|) .cse10) (or .cse11 (and .cse15 .cse16 .cse17 (= ~a17~0 |old(~a17~0)|)) .cse9) (or .cse11 .cse18 (and .cse15 .cse16 .cse17 .cse19) .cse20) (or .cse0 .cse21 .cse3 .cse9 .cse2 .cse10) (or .cse11 (and (= 7 ~a28~0) (= 1 ~a11~0) .cse19 (= 1 ~a25~0) (= 1 ~a19~0)) (not (= 7 |old(~a28~0)|)) .cse22 .cse7 (not (= 1 |old(~a11~0)|)) .cse20) (or .cse0 (or (not (= 11 |old(~a28~0)|)) .cse22) .cse23 .cse4 (= ~a25~0 1) .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse13 .cse8 .cse18 .cse14 .cse9 .cse10) (or .cse18 (= ~a25~0 0) .cse24 .cse10 .cse0 .cse21 .cse6 .cse9)))) [2018-11-07 12:53:12,908 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,908 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,908 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:53:12,908 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:53:12,909 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,910 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:53:12,911 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,912 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:53:12,913 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:53:12,914 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:53:12,915 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:53:12,915 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-11-07 12:53:12,916 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:53:12,916 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:53:12,916 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:53:12,916 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:53:12,916 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 7 ~a17~0))) (or (= |old(~a17~0)| ~a17~0) (and (= 1 ~a11~0) .cse0 (= 1 ~a25~0) (= 1 ~a19~0)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (not (= ~a28~0 ~a17~0)) .cse0) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 12:53:12,916 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:53:12,917 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:53:12,917 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 7 ~a17~0))) (or (and (not (= ~a28~0 ~a17~0)) .cse0) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (= |old(~a17~0)| ~a17~0) (and (= 1 ~a11~0) .cse0 (= 1 ~a25~0) (= 1 ~a19~0)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) [2018-11-07 12:53:12,917 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:53:12,917 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:53:12,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:53:12 BoogieIcfgContainer [2018-11-07 12:53:12,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:53:12,932 INFO L168 Benchmark]: Toolchain (without parser) took 107170.30 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -395.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 12:53:12,933 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-11-07 12:53:12,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.96 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-11-07 12:53:12,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:53:12,936 INFO L168 Benchmark]: Boogie Preprocessor took 104.09 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:53:12,936 INFO L168 Benchmark]: RCFGBuilder took 3288.44 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: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2018-11-07 12:53:12,937 INFO L168 Benchmark]: TraceAbstraction took 102894.25 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 1.8 GB in the end (delta: 279.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 12:53:12,942 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 731.96 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 146.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.09 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3288.44 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: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102894.25 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 1.8 GB in the end (delta: 279.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: 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: ((((((((((((((((((\old(a17) == a17 || (((1 == a11 && 7 == a17) && 1 == a25) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || (!(a28 == a17) && 7 == a17)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 102.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 80.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1557 SDtfs, 8771 SDslu, 3216 SDs, 0 SdLazy, 15519 SolverSat, 1931 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1630 GetRequests, 1459 SyntacticMatches, 6 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2771occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.8s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9974668492101842 AbsIntWeakeningRatio, 0.19980879541108987 AbsIntAvgWeakeningVarsNumRemoved, 22.544933078393882 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 502 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 98 PreInvPairs, 162 NumberOfFragments, 819 HoareAnnotationTreeSize, 98 FomulaSimplifications, 22313 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15503 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231937 SizeOfPredicates, 1 NumberOfNonLiveVariables, 536 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 924/1039 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...