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-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:47:09,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:47:09,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:47:09,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:47:09,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:47:09,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:47:09,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:47:09,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:47:09,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:47:09,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:47:09,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:47:09,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:47:09,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:47:09,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:47:09,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:47:09,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:47:09,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:47:09,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:47:09,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:47:09,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:47:09,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:47:09,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:47:09,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:47:09,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:47:09,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:47:09,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:47:09,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:47:09,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:47:09,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:47:09,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:47:09,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:47:09,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:47:09,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:47:09,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:47:09,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:47:09,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:47:09,133 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-LIM.epf [2018-11-07 18:47:09,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:47:09,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:47:09,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:47:09,169 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:47:09,169 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:47:09,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:47:09,170 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:47:09,170 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:47:09,170 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:47:09,170 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:47:09,170 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:47:09,171 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:47:09,171 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:47:09,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:47:09,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:47:09,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:47:09,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:47:09,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:47:09,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:47:09,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:47:09,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:47:09,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:47:09,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:47:09,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:47:09,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:47:09,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:47:09,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:47:09,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:47:09,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:47:09,175 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:47:09,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:47:09,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:47:09,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:47:09,176 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:47:09,176 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:47:09,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:47:09,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:47:09,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:47:09,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:47:09,266 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:47:09,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 18:47:09,339 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc003e71/03467de035ca4f1a993d296189260778/FLAG822a6d098 [2018-11-07 18:47:09,929 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:47:09,930 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 18:47:09,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc003e71/03467de035ca4f1a993d296189260778/FLAG822a6d098 [2018-11-07 18:47:09,965 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc003e71/03467de035ca4f1a993d296189260778 [2018-11-07 18:47:09,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:47:09,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:47:09,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:47:09,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:47:09,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:47:09,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:09" (1/1) ... [2018-11-07 18:47:09,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:09, skipping insertion in model container [2018-11-07 18:47:09,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:09" (1/1) ... [2018-11-07 18:47:09,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:47:10,067 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:47:10,584 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:47:10,589 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:47:10,715 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:47:10,733 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:47:10,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10 WrapperNode [2018-11-07 18:47:10,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:47:10,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:47:10,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:47:10,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:47:10,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:47:10,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:47:10,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:47:10,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:47:10,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (1/1) ... [2018-11-07 18:47:10,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:47:10,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:47:10,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:47:10,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:47:10,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (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 18:47:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:47:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:47:11,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:47:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:47:11,067 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:47:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:47:11,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:47:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:47:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:47:14,244 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:47:14,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:14 BoogieIcfgContainer [2018-11-07 18:47:14,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:47:14,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:47:14,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:47:14,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:47:14,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:47:09" (1/3) ... [2018-11-07 18:47:14,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bf892d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:14, skipping insertion in model container [2018-11-07 18:47:14,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:10" (2/3) ... [2018-11-07 18:47:14,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bf892d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:14, skipping insertion in model container [2018-11-07 18:47:14,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:14" (3/3) ... [2018-11-07 18:47:14,258 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49_true-unreach-call_false-termination.c [2018-11-07 18:47:14,271 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:47:14,283 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:47:14,300 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:47:14,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:47:14,341 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:47:14,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:47:14,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:47:14,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:47:14,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:47:14,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:47:14,342 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:47:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 18:47:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 18:47:14,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:14,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:14,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:14,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1826364152, now seen corresponding path program 1 times [2018-11-07 18:47:14,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:14,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:14,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:15,079 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:47:15,197 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 18:47:15,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:15,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:47:15,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:15,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:47:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:47:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:47:15,227 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 18:47:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:16,842 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 18:47:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:47:16,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-07 18:47:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:16,864 INFO L225 Difference]: With dead ends: 621 [2018-11-07 18:47:16,864 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 18:47:16,872 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 18:47:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 18:47:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 18:47:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 18:47:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 18:47:16,947 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 132 [2018-11-07 18:47:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:16,948 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 18:47:16,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:47:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 18:47:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 18:47:16,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:16,958 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:16,959 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:16,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:16,959 INFO L82 PathProgramCache]: Analyzing trace with hash 660432277, now seen corresponding path program 1 times [2018-11-07 18:47:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:16,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:16,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:17,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:17,341 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:17,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:17,344 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 18:47:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:18,770 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 18:47:18,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:18,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-07 18:47:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:18,776 INFO L225 Difference]: With dead ends: 903 [2018-11-07 18:47:18,776 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 18:47:18,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:47:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 18:47:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 18:47:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 18:47:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 18:47:18,811 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 141 [2018-11-07 18:47:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:18,812 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 18:47:18,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 18:47:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 18:47:18,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:18,817 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:18,817 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:18,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1332602505, now seen corresponding path program 1 times [2018-11-07 18:47:18,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:18,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:18,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:18,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:18,819 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:19,210 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 18:47:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:19,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:19,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:19,387 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:19,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:19,389 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 18:47:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:20,995 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 18:47:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:20,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2018-11-07 18:47:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:20,999 INFO L225 Difference]: With dead ends: 901 [2018-11-07 18:47:21,000 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 18:47:21,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 18:47:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 18:47:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 18:47:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 18:47:21,022 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 147 [2018-11-07 18:47:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:21,023 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 18:47:21,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 18:47:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 18:47:21,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:21,026 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:21,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:21,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash -203936942, now seen corresponding path program 1 times [2018-11-07 18:47:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:21,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:21,267 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:47:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:21,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:47:21,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:21,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:47:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:47:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:47:21,613 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 18:47:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:24,649 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 18:47:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:47:24,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-07 18:47:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:24,655 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 18:47:24,655 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 18:47:24,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:47:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 18:47:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 18:47:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 18:47:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 18:47:24,695 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 155 [2018-11-07 18:47:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:24,695 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 18:47:24,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:47:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 18:47:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 18:47:24,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:24,700 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:24,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:24,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:24,700 INFO L82 PathProgramCache]: Analyzing trace with hash -749626802, now seen corresponding path program 1 times [2018-11-07 18:47:24,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:24,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:24,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:24,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:25,071 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 18:47:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:25,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:25,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:25,149 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:25,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:25,150 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 18:47:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:26,259 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 18:47:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:26,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2018-11-07 18:47:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:26,273 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 18:47:26,273 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 18:47:26,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 18:47:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 18:47:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 18:47:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 18:47:26,310 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 157 [2018-11-07 18:47:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 18:47:26,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 18:47:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 18:47:26,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:26,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:26,315 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:26,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -650421942, now seen corresponding path program 1 times [2018-11-07 18:47:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:26,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:26,580 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 18:47:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:47:26,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:26,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:47:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:47:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:47:26,582 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 18:47:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:28,118 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 18:47:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:47:28,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-07 18:47:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:28,128 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 18:47:28,128 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 18:47:28,131 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 18:47:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 18:47:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 18:47:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 18:47:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 18:47:28,161 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 159 [2018-11-07 18:47:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:28,161 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 18:47:28,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:47:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 18:47:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 18:47:28,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:28,170 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:28,171 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:28,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1376765762, now seen corresponding path program 1 times [2018-11-07 18:47:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:28,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:28,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:28,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:47:28,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:47:28,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:28,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:47:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:47:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:47:28,387 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 18:47:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:29,511 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 18:47:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:47:29,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-11-07 18:47:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:29,523 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 18:47:29,523 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 18:47:29,529 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 18:47:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 18:47:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 18:47:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 18:47:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 18:47:29,591 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 163 [2018-11-07 18:47:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:29,591 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 18:47:29,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:47:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 18:47:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 18:47:29,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:29,599 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:47:29,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:29,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash 213430480, now seen corresponding path program 1 times [2018-11-07 18:47:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:29,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:29,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:29,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:29,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:30,047 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 18:47:30,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:30,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:47:30,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-07 18:47:30,057 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:47:30,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:47:30,125 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:47:31,447 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:47:31,449 INFO L272 AbstractInterpreter]: Visited 136 different actions 268 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 18:47:31,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:31,503 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:47:32,433 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 81.31% of their original sizes. [2018-11-07 18:47:32,433 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:47:34,934 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-07 18:47:34,934 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:47:34,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:47:34,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:47:34,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:34,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:47:34,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:47:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:47:34,939 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-07 18:47:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:47:51,206 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-07 18:47:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 18:47:51,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2018-11-07 18:47:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:47:51,217 INFO L225 Difference]: With dead ends: 3716 [2018-11-07 18:47:51,217 INFO L226 Difference]: Without dead ends: 2164 [2018-11-07 18:47:51,224 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-07 18:47:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-07 18:47:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-07 18:47:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-07 18:47:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-07 18:47:51,278 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 198 [2018-11-07 18:47:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:47:51,279 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-07 18:47:51,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:47:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-07 18:47:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 18:47:51,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:47:51,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:47:51,289 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:47:51,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash 981666770, now seen corresponding path program 1 times [2018-11-07 18:47:51,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:47:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:51,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:47:51,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:47:51,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:47:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:47:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:47:51,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:47:51,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:47:51,584 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-07 18:47:51,585 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:47:51,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:47:51,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:47:51,999 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:47:51,999 INFO L272 AbstractInterpreter]: Visited 136 different actions 269 times. Merged at 5 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:47:52,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:47:52,007 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:47:52,520 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 81.86% of their original sizes. [2018-11-07 18:47:52,521 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:47:54,007 INFO L415 sIntCurrentIteration]: We unified 200 AI predicates to 200 [2018-11-07 18:47:54,007 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:47:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:47:54,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 18:47:54,008 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:47:54,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 18:47:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 18:47:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:47:54,009 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 17 states. [2018-11-07 18:48:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:18,090 INFO L93 Difference]: Finished difference Result 5234 states and 7048 transitions. [2018-11-07 18:48:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 18:48:18,090 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2018-11-07 18:48:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:18,104 INFO L225 Difference]: With dead ends: 5234 [2018-11-07 18:48:18,105 INFO L226 Difference]: Without dead ends: 3088 [2018-11-07 18:48:18,113 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 142 SyntacticMatches, 43 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 18:48:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2018-11-07 18:48:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3062. [2018-11-07 18:48:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2018-11-07 18:48:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 3961 transitions. [2018-11-07 18:48:18,194 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 3961 transitions. Word has length 201 [2018-11-07 18:48:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:18,194 INFO L480 AbstractCegarLoop]: Abstraction has 3062 states and 3961 transitions. [2018-11-07 18:48:18,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 18:48:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 3961 transitions. [2018-11-07 18:48:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-07 18:48:18,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:18,206 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:18,207 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:18,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1831098819, now seen corresponding path program 1 times [2018-11-07 18:48:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:18,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:18,473 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:48:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:48:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:18,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:18,991 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-07 18:48:18,991 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:18,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:18,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:19,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:48:19,504 INFO L272 AbstractInterpreter]: Visited 138 different actions 410 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:19,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:19,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:48:19,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:19,517 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 18:48:19,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:19,529 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:48:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:19,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:48:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:48:20,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:48:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:48:20,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:48:20,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-07 18:48:20,907 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:48:20,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 18:48:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 18:48:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:48:20,909 INFO L87 Difference]: Start difference. First operand 3062 states and 3961 transitions. Second operand 14 states. [2018-11-07 18:48:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:25,817 INFO L93 Difference]: Finished difference Result 8821 states and 12073 transitions. [2018-11-07 18:48:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 18:48:25,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 203 [2018-11-07 18:48:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:25,833 INFO L225 Difference]: With dead ends: 8821 [2018-11-07 18:48:25,834 INFO L226 Difference]: Without dead ends: 3684 [2018-11-07 18:48:25,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 18:48:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2018-11-07 18:48:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3656. [2018-11-07 18:48:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2018-11-07 18:48:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4282 transitions. [2018-11-07 18:48:25,956 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 4282 transitions. Word has length 203 [2018-11-07 18:48:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:25,956 INFO L480 AbstractCegarLoop]: Abstraction has 3656 states and 4282 transitions. [2018-11-07 18:48:25,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 18:48:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 4282 transitions. [2018-11-07 18:48:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-07 18:48:25,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:25,971 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:25,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:25,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1548207839, now seen corresponding path program 1 times [2018-11-07 18:48:25,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:25,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 52 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 18:48:26,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:26,483 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:26,484 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-11-07 18:48:26,484 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [256], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:26,495 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:26,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:27,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:27,182 INFO L272 AbstractInterpreter]: Visited 137 different actions 276 times. Merged at 7 different actions 13 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:48:27,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:27,208 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:28,196 INFO L227 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-07 18:48:28,197 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:28,731 INFO L415 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2018-11-07 18:48:28,732 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:28,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:28,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:48:28,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:28,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:48:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:48:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:48:28,734 INFO L87 Difference]: Start difference. First operand 3656 states and 4282 transitions. Second operand 18 states. [2018-11-07 18:48:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:40,898 INFO L93 Difference]: Finished difference Result 7002 states and 8455 transitions. [2018-11-07 18:48:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 18:48:40,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 264 [2018-11-07 18:48:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:40,915 INFO L225 Difference]: With dead ends: 7002 [2018-11-07 18:48:40,916 INFO L226 Difference]: Without dead ends: 4552 [2018-11-07 18:48:40,923 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:48:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2018-11-07 18:48:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4547. [2018-11-07 18:48:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4547 states. [2018-11-07 18:48:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 5280 transitions. [2018-11-07 18:48:41,029 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 5280 transitions. Word has length 264 [2018-11-07 18:48:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:41,030 INFO L480 AbstractCegarLoop]: Abstraction has 4547 states and 5280 transitions. [2018-11-07 18:48:41,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:48:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 5280 transitions. [2018-11-07 18:48:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-07 18:48:41,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:41,046 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:41,046 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:41,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1918756425, now seen corresponding path program 1 times [2018-11-07 18:48:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:41,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:41,407 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 18:48:41,600 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:48:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 232 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:48:42,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:42,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:42,224 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-11-07 18:48:42,224 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:42,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:42,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:42,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:42,689 INFO L272 AbstractInterpreter]: Visited 138 different actions 409 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:48:42,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:42,694 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:43,190 INFO L227 lantSequenceWeakener]: Weakened 278 states. On average, predicates are now at 80.96% of their original sizes. [2018-11-07 18:48:43,190 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:43,418 INFO L415 sIntCurrentIteration]: We unified 281 AI predicates to 281 [2018-11-07 18:48:43,418 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:43,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:43,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2018-11-07 18:48:43,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:43,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:48:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:48:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:48:43,420 INFO L87 Difference]: Start difference. First operand 4547 states and 5280 transitions. Second operand 11 states. [2018-11-07 18:48:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:51,793 INFO L93 Difference]: Finished difference Result 8865 states and 10590 transitions. [2018-11-07 18:48:51,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 18:48:51,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-11-07 18:48:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:51,819 INFO L225 Difference]: With dead ends: 8865 [2018-11-07 18:48:51,819 INFO L226 Difference]: Without dead ends: 6715 [2018-11-07 18:48:51,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:48:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2018-11-07 18:48:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 6702. [2018-11-07 18:48:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-07 18:48:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 7883 transitions. [2018-11-07 18:48:51,984 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 7883 transitions. Word has length 282 [2018-11-07 18:48:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:51,985 INFO L480 AbstractCegarLoop]: Abstraction has 6702 states and 7883 transitions. [2018-11-07 18:48:51,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:48:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 7883 transitions. [2018-11-07 18:48:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-07 18:48:52,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:52,007 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:52,008 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:52,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1757225332, now seen corresponding path program 1 times [2018-11-07 18:48:52,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:52,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:52,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:48:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 178 proven. 13 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 18:48:52,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:48:52,474 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:48:52,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-11-07 18:48:52,475 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:48:52,478 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:48:52,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:48:53,168 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:48:53,169 INFO L272 AbstractInterpreter]: Visited 137 different actions 409 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:48:53,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:53,208 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:48:53,588 INFO L227 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 80.95% of their original sizes. [2018-11-07 18:48:53,589 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:48:53,683 INFO L415 sIntCurrentIteration]: We unified 284 AI predicates to 284 [2018-11-07 18:48:53,684 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:48:53,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:48:53,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:48:53,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:48:53,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:48:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:48:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:48:53,685 INFO L87 Difference]: Start difference. First operand 6702 states and 7883 transitions. Second operand 11 states. [2018-11-07 18:48:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:48:59,144 INFO L93 Difference]: Finished difference Result 12160 states and 14669 transitions. [2018-11-07 18:48:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 18:48:59,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 285 [2018-11-07 18:48:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:48:59,173 INFO L225 Difference]: With dead ends: 12160 [2018-11-07 18:48:59,174 INFO L226 Difference]: Without dead ends: 8380 [2018-11-07 18:48:59,186 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 295 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:48:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8380 states. [2018-11-07 18:48:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8380 to 8361. [2018-11-07 18:48:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8361 states. [2018-11-07 18:48:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 9658 transitions. [2018-11-07 18:48:59,363 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 9658 transitions. Word has length 285 [2018-11-07 18:48:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:48:59,364 INFO L480 AbstractCegarLoop]: Abstraction has 8361 states and 9658 transitions. [2018-11-07 18:48:59,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:48:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 9658 transitions. [2018-11-07 18:48:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 18:48:59,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:48:59,388 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:48:59,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:48:59,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:48:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash 135291216, now seen corresponding path program 1 times [2018-11-07 18:48:59,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:48:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:48:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:48:59,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:48:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 161 proven. 104 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 18:49:00,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:00,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:49:00,378 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-11-07 18:49:00,379 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], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:49:00,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:49:00,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:49:01,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:49:01,408 INFO L272 AbstractInterpreter]: Visited 141 different actions 706 times. Merged at 9 different actions 53 times. Widened at 1 different actions 2 times. Found 13 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 18:49:01,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:01,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:49:01,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:01,415 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:49:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:01,424 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:49:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:01,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:49:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-07 18:49:01,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:49:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 172 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-07 18:49:01,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:49:01,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:49:01,868 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:49:01,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:49:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:49:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:49:01,870 INFO L87 Difference]: Start difference. First operand 8361 states and 9658 transitions. Second operand 11 states. [2018-11-07 18:49:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:49:04,057 INFO L93 Difference]: Finished difference Result 16898 states and 20062 transitions. [2018-11-07 18:49:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 18:49:04,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 296 [2018-11-07 18:49:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:49:04,095 INFO L225 Difference]: With dead ends: 16898 [2018-11-07 18:49:04,095 INFO L226 Difference]: Without dead ends: 8538 [2018-11-07 18:49:04,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 597 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:49:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2018-11-07 18:49:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 7688. [2018-11-07 18:49:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7688 states. [2018-11-07 18:49:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7688 states to 7688 states and 8447 transitions. [2018-11-07 18:49:04,317 INFO L78 Accepts]: Start accepts. Automaton has 7688 states and 8447 transitions. Word has length 296 [2018-11-07 18:49:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:49:04,317 INFO L480 AbstractCegarLoop]: Abstraction has 7688 states and 8447 transitions. [2018-11-07 18:49:04,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:49:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7688 states and 8447 transitions. [2018-11-07 18:49:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-07 18:49:04,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:49:04,341 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:49:04,342 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:49:04,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -808458143, now seen corresponding path program 1 times [2018-11-07 18:49:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:49:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:49:04,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:49:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:49:04,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:04,783 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:49:04,783 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 327 with the following transitions: [2018-11-07 18:49:04,783 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 18:49:04,786 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:49:04,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:49:05,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:49:05,623 INFO L272 AbstractInterpreter]: Visited 141 different actions 698 times. Merged at 9 different actions 46 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:49:05,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:49:05,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:49:05,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:49:05,631 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:49:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:49:05,644 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:49:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:49:05,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:49:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:49:05,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:49:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 18:49:06,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:49:06,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 18:49:06,104 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:49:06,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:49:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:49:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 18:49:06,105 INFO L87 Difference]: Start difference. First operand 7688 states and 8447 transitions. Second operand 6 states. [2018-11-07 18:49:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:49:06,944 INFO L93 Difference]: Finished difference Result 14066 states and 15643 transitions. [2018-11-07 18:49:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:49:06,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-11-07 18:49:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:49:06,950 INFO L225 Difference]: With dead ends: 14066 [2018-11-07 18:49:06,950 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:49:06,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:49:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:49:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:49:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:49:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:49:06,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 326 [2018-11-07 18:49:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:49:06,980 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:49:06,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:49:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:49:06,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:49:06,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:49:07,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:07,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,250 WARN L179 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 235 [2018-11-07 18:49:08,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:49:08,942 WARN L179 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 249 [2018-11-07 18:49:09,372 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-07 18:49:09,681 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2018-11-07 18:49:17,504 WARN L179 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 445 DAG size of output: 128 [2018-11-07 18:49:18,896 WARN L179 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 259 DAG size of output: 110 [2018-11-07 18:49:20,552 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 274 DAG size of output: 109 [2018-11-07 18:49:20,555 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:49:20,555 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 18:49:20,556 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:49:20,557 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 18:49:20,558 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:49:20,559 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 18:49:20,560 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:49:20,560 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 18:49:20,560 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 18:49:20,560 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,561 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 18:49:20,562 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 18:49:20,563 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 18:49:20,564 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,565 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,566 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 18:49:20,567 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,568 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 18:49:20,569 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 18:49:20,570 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 18:49:20,571 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,572 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,574 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (= 1 |old(~a19~0)|))) (let ((.cse13 (= |old(~a17~0)| ~a17~0)) (.cse9 (= |old(~a25~0)| ~a25~0)) (.cse14 (= ~a19~0 |old(~a19~0)|)) (.cse15 (= ~a28~0 |old(~a28~0)|)) (.cse33 (not (= ~a11~0 1))) (.cse19 (<= 0 ~a11~0)) (.cse20 (<= ~a11~0 1)) (.cse39 (< |old(~a11~0)| 0)) (.cse38 (< 1 |old(~a11~0)|)) (.cse1 (not (= 1 ~a21~0))) (.cse12 (not .cse0)) (.cse36 (< 1 |old(~a25~0)|)) (.cse25 (not (= 0 |old(~a11~0)|))) (.cse35 (< |old(~a25~0)| 0)) (.cse28 (< |old(~a28~0)| 7)) (.cse30 (= 1 |old(~a11~0)|)) (.cse8 (= 1 |old(~a25~0)|))) (let ((.cse22 (not (= 0 |old(~a25~0)|))) (.cse11 (not .cse8)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse4 (= 1 ~a11~0)) (.cse5 (= 8 ~a17~0)) (.cse6 (= 1 ~a19~0)) (.cse27 (= 9 |old(~a28~0)|)) (.cse7 (not .cse30)) (.cse21 (let ((.cse40 (< 11 |old(~a28~0)|))) (and (or .cse1 .cse39 .cse12 .cse36 (< |old(~a28~0)| 9) .cse38 .cse40 .cse35) (or .cse1 .cse12 .cse36 .cse25 .cse40 .cse35 .cse28)))) (.cse24 (< 1 |old(~a19~0)|)) (.cse26 (= ~a11~0 0)) (.cse29 (< |old(~a19~0)| 0)) (.cse16 (< 7 |old(~a28~0)|)) (.cse18 (< 6 |calculate_output_#in~input|)) (.cse2 (not (= 7 |old(~a28~0)|))) (.cse37 (and .cse19 .cse20)) (.cse23 (< |calculate_output_#in~input| 1)) (.cse31 (and .cse13 .cse9 .cse14 .cse15 .cse33)) (.cse10 (not (= 10 |old(~a28~0)|))) (.cse17 (not (= |old(~a17~0)| 8))) (.cse32 (= 8 |old(~a28~0)|)) (.cse34 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse5 (not .cse6)) .cse7 .cse8) (or (and .cse4 .cse5 .cse6 .cse9 (= 10 ~a28~0)) .cse1 .cse10 .cse11 .cse12 .cse3 .cse7) (or .cse1 (and .cse13 .cse9 .cse14 .cse15) .cse16 .cse12 .cse17) (or .cse18 (and .cse19 .cse20 (= ~a25~0 0) (= ~a17~0 8) .cse15 .cse14) .cse21 .cse17 .cse22 .cse23) (or .cse24 .cse18 .cse1 .cse25 .cse26 .cse27 .cse28 .cse29 (< 10 |old(~a28~0)|) .cse17 .cse22 .cse23) (or .cse1 .cse30 .cse31 .cse12 .cse17) (or .cse31 .cse1 .cse30 .cse27 .cse17 .cse8) (or .cse1 .cse30 .cse32 .cse33 .cse34) (or .cse1 .cse2 .cse11 .cse12 .cse7 (and .cse4 .cse6) (not (= 7 |old(~a17~0)|))) (or .cse1 .cse11 .cse12 .cse3 (and .cse4 (= 1 ~a25~0) (= 9 ~a28~0) .cse5 .cse6) (not .cse27) .cse7) (or (or .cse24 .cse18 .cse1 .cse16 .cse25 .cse35 .cse28 .cse29 .cse36 .cse17 .cse23) .cse26) (or .cse18 .cse30 .cse37 .cse21 .cse17 .cse23) (or .cse24 .cse18 .cse1 .cse25 .cse26 .cse35 .cse29 .cse10 .cse36 .cse17 .cse23) (or (and .cse14 (and .cse13 .cse9 .cse15 .cse33)) (or .cse1 .cse16 .cse30 .cse17)) (or .cse18 .cse1 .cse2 .cse38 .cse35 .cse39 .cse12 .cse36 .cse37 .cse17 .cse23) (or .cse1 .cse30 .cse31 .cse10 .cse17) (or (and .cse13 .cse9 .cse15) .cse1 .cse32 .cse34))))) [2018-11-07 18:49:20,574 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,574 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,574 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 18:49:20,574 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 18:49:20,575 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 18:49:20,576 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:49:20,577 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 18:49:20,578 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:49:20,579 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 18:49:20,580 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:49:20,580 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 18:49:20,580 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:49:20,581 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:49:20,581 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (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)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:49:20,581 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 18:49:20,581 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse8 (not (= ~a11~0 1))) (.cse9 (not (= ~a28~0 9)))) (let ((.cse3 (= 1 ~a25~0)) (.cse4 (= 8 ~a17~0)) (.cse7 (not (= ~a25~0 1))) (.cse6 (= 10 ~a28~0)) (.cse0 (<= ~a28~0 7)) (.cse10 (and .cse5 .cse8 .cse9)) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse2 (= 1 ~a19~0))) (or (and (<= ~a17~0 7) (not (= ~a28~0 8))) (and .cse0 .cse1 .cse2) (and .cse3 (= 9 ~a28~0) .cse4 .cse2) (not .cse5) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 .cse4 .cse2 .cse6) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and (= 7 ~a28~0) .cse7 .cse4) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse7 .cse1 .cse8 .cse9) (and .cse7 (and (<= ~a28~0 11) (<= 0 ~a25~0) (= ~a17~0 8) (= ~a19~0 1) (<= 9 ~a28~0) (<= ~a25~0 1))) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse1 .cse10 .cse6) (not (= 3 ~c~0)) (and .cse0 .cse1 .cse10) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse1 .cse2 .cse8) (not (= 6 ~f~0))))) [2018-11-07 18:49:20,581 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:49:20,581 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:49:20,582 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a28~0 7)) (.cse3 (= 1 ~a25~0)) (.cse4 (= 8 ~a17~0)) (.cse7 (not (= ~a25~0 1))) (.cse6 (= 10 ~a28~0)) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse2 (= 1 ~a19~0)) (.cse5 (not (= ~a11~0 1)))) (or (and (<= ~a17~0 7) (not (= ~a28~0 8))) (and .cse0 .cse1 .cse2) (and .cse3 (= 9 ~a28~0) .cse4 .cse2) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 .cse5) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse3 .cse4 .cse2 .cse6) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (and (<= ~a28~0 11) (= ~a19~0 1) (<= 9 ~a28~0)) (= ~a25~0 0) (= ~a17~0 8)) (not (= 21 ~u~0)) (and (= 7 ~a28~0) .cse7 .cse4) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse7 .cse1 .cse5 (not (= ~a28~0 9))) (and .cse1 .cse6 .cse5) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and .cse1 .cse2 .cse5) (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 18:49:20,582 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 18:49:20,582 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 18:49:20,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:49:20 BoogieIcfgContainer [2018-11-07 18:49:20,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:49:20,616 INFO L168 Benchmark]: Toolchain (without parser) took 130640.88 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 2.3 GB in the end (delta: -874.9 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-11-07 18:49:20,617 INFO L168 Benchmark]: CDTParser took 0.21 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 18:49:20,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.41 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 18:49:20,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:49:20,619 INFO L168 Benchmark]: Boogie Preprocessor took 124.47 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:49:20,623 INFO L168 Benchmark]: RCFGBuilder took 3256.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2018-11-07 18:49:20,624 INFO L168 Benchmark]: TraceAbstraction took 126366.23 ms. Allocated memory was 2.2 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 2.3 GB in the end (delta: -209.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-11-07 18:49:20,641 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.21 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 757.41 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 129.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.47 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3256.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 126366.23 ms. Allocated memory was 2.2 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 2.3 GB in the end (delta: -209.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a17 <= 7 && !(a28 == 8)) || ((a28 <= 7 && \old(a17) == a17) && 1 == a19)) || (((1 == a25 && 9 == a28) && 8 == a17) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || !(1 == \old(a19))) || !(x == 24)) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || !(22 == v)) || !(\old(a11) == 0)) || (((!(a25 == 1) && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9))) || (!(a25 == 1) && ((((a28 <= 11 && 0 <= a25) && a17 == 8) && a19 == 1) && 9 <= a28) && a25 <= 1)) || !(z == 26)) || !(0 == \old(a25))) || ((\old(a17) == a17 && (a21 == 1 && !(a11 == 1)) && !(a28 == 9)) && 10 == a28)) || !(3 == c)) || ((a28 <= 7 && \old(a17) == a17) && (a21 == 1 && !(a11 == 1)) && !(a28 == 9))) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || ((\old(a17) == a17 && 1 == a19) && !(a11 == 1))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 126.2s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 86.1s AutomataDifference, 0.0s DeadEndRemovalTime, 13.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1684 SDtfs, 15612 SDslu, 2773 SDs, 0 SdLazy, 18738 SolverSat, 2977 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3080 GetRequests, 2807 SyntacticMatches, 56 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8361occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.2s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9976554534297618 AbsIntWeakeningRatio, 0.16408163265306122 AbsIntAvgWeakeningVarsNumRemoved, 28.185306122448978 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 993 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 286 PreInvPairs, 468 NumberOfFragments, 1296 HoareAnnotationTreeSize, 286 FomulaSimplifications, 32501 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 30142 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 3934 NumberOfCodeBlocks, 3934 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4738 ConstructedInterpolants, 0 QuantifiedInterpolants, 3951510 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1824 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 3267/3600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...