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_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:12:23,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:12:23,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:12:23,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:12:23,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:12:23,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:12:23,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:12:23,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:12:23,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:12:23,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:12:23,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:12:23,204 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:12:23,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:12:23,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:12:23,209 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:12:23,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:12:23,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:12:23,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:12:23,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:12:23,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:12:23,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:12:23,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:12:23,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:12:23,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:12:23,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:12:23,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:12:23,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:12:23,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:12:23,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:12:23,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:12:23,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:12:23,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:12:23,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:12:23,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:12:23,250 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:12:23,251 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:12:23,251 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-12 17:12:23,266 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:12:23,266 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:12:23,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:12:23,267 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:12:23,268 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:12:23,268 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:12:23,268 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:12:23,268 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:12:23,268 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:12:23,269 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:12:23,269 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:12:23,269 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:12:23,269 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:12:23,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:12:23,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:12:23,270 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:12:23,270 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:12:23,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:12:23,271 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:12:23,271 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:12:23,271 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:12:23,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:12:23,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:12:23,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:12:23,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:12:23,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:12:23,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:12:23,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:12:23,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:12:23,273 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:12:23,273 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:12:23,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:12:23,273 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:12:23,274 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:12:23,274 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:12:23,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:12:23,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:12:23,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:12:23,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:12:23,368 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:12:23,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label11_true-unreach-call_false-termination.c [2018-11-12 17:12:23,437 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfa5a64/a89d55541db94073856c0f7b0d61ea80/FLAGf652abd04 [2018-11-12 17:12:24,036 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:12:24,040 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label11_true-unreach-call_false-termination.c [2018-11-12 17:12:24,064 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfa5a64/a89d55541db94073856c0f7b0d61ea80/FLAGf652abd04 [2018-11-12 17:12:24,084 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfa5a64/a89d55541db94073856c0f7b0d61ea80 [2018-11-12 17:12:24,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:12:24,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:12:24,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:24,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:12:24,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:12:24,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d32a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24, skipping insertion in model container [2018-11-12 17:12:24,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:12:24,192 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:12:24,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:24,649 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:12:24,801 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:12:24,821 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:12:24,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24 WrapperNode [2018-11-12 17:12:24,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:12:24,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:24,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:12:24,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:12:24,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:12:24,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:12:24,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:12:24,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:12:24,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:24,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:25,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:25,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:25,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (1/1) ... [2018-11-12 17:12:25,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:12:25,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:12:25,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:12:25,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:12:25,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (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-12 17:12:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:12:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:12:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:12:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:12:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:12:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:12:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:12:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:12:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:12:28,419 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:12:28,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:28 BoogieIcfgContainer [2018-11-12 17:12:28,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:12:28,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:12:28,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:12:28,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:12:28,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:12:24" (1/3) ... [2018-11-12 17:12:28,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320883b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:28, skipping insertion in model container [2018-11-12 17:12:28,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:24" (2/3) ... [2018-11-12 17:12:28,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320883b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:28, skipping insertion in model container [2018-11-12 17:12:28,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:28" (3/3) ... [2018-11-12 17:12:28,438 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label11_true-unreach-call_false-termination.c [2018-11-12 17:12:28,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:12:28,460 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:12:28,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:12:28,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:12:28,529 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:12:28,530 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:12:28,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:12:28,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:12:28,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:12:28,531 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:12:28,531 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:12:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:12:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 17:12:28,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:28,592 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] [2018-11-12 17:12:28,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:28,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2043699759, now seen corresponding path program 1 times [2018-11-12 17:12:28,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:28,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:28,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:29,292 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:12:29,441 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-12 17:12:29,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:29,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:12:29,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:12:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:12:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:12:29,470 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:12:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:30,802 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-12 17:12:30,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:12:30,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-11-12 17:12:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:30,824 INFO L225 Difference]: With dead ends: 618 [2018-11-12 17:12:30,824 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 17:12:30,831 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-12 17:12:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 17:12:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 17:12:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 17:12:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-12 17:12:30,930 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 115 [2018-11-12 17:12:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:30,931 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-12 17:12:30,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:12:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-12 17:12:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-12 17:12:30,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:30,943 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:30,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:30,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -5418054, now seen corresponding path program 1 times [2018-11-12 17:12:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:30,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:30,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:30,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:30,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:31,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:31,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:31,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:31,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:31,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:31,178 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-12 17:12:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:33,416 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-11-12 17:12:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:12:33,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-12 17:12:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:33,431 INFO L225 Difference]: With dead ends: 1229 [2018-11-12 17:12:33,431 INFO L226 Difference]: Without dead ends: 856 [2018-11-12 17:12:33,435 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-12 17:12:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-12 17:12:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-11-12 17:12:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-11-12 17:12:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-11-12 17:12:33,512 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 131 [2018-11-12 17:12:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:33,512 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-11-12 17:12:33,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-11-12 17:12:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-12 17:12:33,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:33,518 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] [2018-11-12 17:12:33,519 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:33,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1859180197, now seen corresponding path program 1 times [2018-11-12 17:12:33,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:33,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:33,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:33,801 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-12 17:12:33,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:33,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:33,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:33,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:33,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:33,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:33,803 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-11-12 17:12:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:37,351 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-11-12 17:12:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:37,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-11-12 17:12:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:37,374 INFO L225 Difference]: With dead ends: 2557 [2018-11-12 17:12:37,375 INFO L226 Difference]: Without dead ends: 1740 [2018-11-12 17:12:37,381 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-12 17:12:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-11-12 17:12:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-11-12 17:12:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-11-12 17:12:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-11-12 17:12:37,470 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 138 [2018-11-12 17:12:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:37,471 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-11-12 17:12:37,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-11-12 17:12:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 17:12:37,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:37,481 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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-12 17:12:37,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:37,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:37,481 INFO L82 PathProgramCache]: Analyzing trace with hash -617935475, now seen corresponding path program 1 times [2018-11-12 17:12:37,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:37,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:37,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:37,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 17:12:37,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:37,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:37,692 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-12 17:12:37,694 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [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], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:37,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:37,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:38,542 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:38,544 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1714 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:12:38,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:38,587 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:39,234 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 81.2% of their original sizes. [2018-11-12 17:12:39,235 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:39,650 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-12 17:12:39,651 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:39,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:39,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-12 17:12:39,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:39,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:12:39,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:12:39,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:12:39,654 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 14 states. [2018-11-12 17:12:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:53,781 INFO L93 Difference]: Finished difference Result 3656 states and 5500 transitions. [2018-11-12 17:12:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:12:53,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 140 [2018-11-12 17:12:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:53,792 INFO L225 Difference]: With dead ends: 3656 [2018-11-12 17:12:53,793 INFO L226 Difference]: Without dead ends: 1980 [2018-11-12 17:12:53,799 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:12:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-11-12 17:12:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1827. [2018-11-12 17:12:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-11-12 17:12:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-11-12 17:12:53,863 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 140 [2018-11-12 17:12:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:53,863 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-11-12 17:12:53,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:12:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-11-12 17:12:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-12 17:12:53,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:53,871 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:53,871 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:53,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:53,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2084827630, now seen corresponding path program 1 times [2018-11-12 17:12:53,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:53,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:12:54,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:54,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:54,088 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-11-12 17:12:54,089 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [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], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:54,094 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:54,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:55,053 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:55,054 INFO L272 AbstractInterpreter]: Visited 120 different actions 353 times. Merged at 7 different actions 15 times. Never widened. Performed 5358 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:12:55,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:55,083 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:55,646 INFO L227 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 80.94% of their original sizes. [2018-11-12 17:12:55,647 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:56,283 INFO L415 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2018-11-12 17:12:56,283 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:56,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:56,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:12:56,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:56,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:12:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:12:56,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:12:56,285 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 11 states. [2018-11-12 17:13:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:05,542 INFO L93 Difference]: Finished difference Result 5048 states and 7511 transitions. [2018-11-12 17:13:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:05,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2018-11-12 17:13:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:05,559 INFO L225 Difference]: With dead ends: 5048 [2018-11-12 17:13:05,559 INFO L226 Difference]: Without dead ends: 3227 [2018-11-12 17:13:05,568 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:13:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-11-12 17:13:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3103. [2018-11-12 17:13:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3103 states. [2018-11-12 17:13:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4216 transitions. [2018-11-12 17:13:05,656 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4216 transitions. Word has length 150 [2018-11-12 17:13:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 3103 states and 4216 transitions. [2018-11-12 17:13:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4216 transitions. [2018-11-12 17:13:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 17:13:05,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:05,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:05,665 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:05,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1597518138, now seen corresponding path program 1 times [2018-11-12 17:13:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:05,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:05,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:05,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:05,778 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-12 17:13:05,778 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], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:05,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:05,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:06,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:06,183 INFO L272 AbstractInterpreter]: Visited 119 different actions 234 times. Merged at 5 different actions 7 times. Never widened. Performed 3308 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3308 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:13:06,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:06,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:06,572 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 81.08% of their original sizes. [2018-11-12 17:13:06,573 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:07,189 INFO L415 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-11-12 17:13:07,189 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:07,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:07,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:13:07,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:07,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:13:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:13:07,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:13:07,191 INFO L87 Difference]: Start difference. First operand 3103 states and 4216 transitions. Second operand 18 states. [2018-11-12 17:13:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:19,993 INFO L93 Difference]: Finished difference Result 7106 states and 9667 transitions. [2018-11-12 17:13:19,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:13:19,994 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 156 [2018-11-12 17:13:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:20,012 INFO L225 Difference]: With dead ends: 7106 [2018-11-12 17:13:20,012 INFO L226 Difference]: Without dead ends: 4009 [2018-11-12 17:13:20,021 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:13:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-12 17:13:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3997. [2018-11-12 17:13:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3997 states. [2018-11-12 17:13:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5290 transitions. [2018-11-12 17:13:20,123 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5290 transitions. Word has length 156 [2018-11-12 17:13:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:20,124 INFO L480 AbstractCegarLoop]: Abstraction has 3997 states and 5290 transitions. [2018-11-12 17:13:20,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:13:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5290 transitions. [2018-11-12 17:13:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 17:13:20,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:20,136 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:20,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:20,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash -630992110, now seen corresponding path program 1 times [2018-11-12 17:13:20,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:20,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:20,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:20,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 59 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:13:20,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:20,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:20,601 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-12 17:13:20,602 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:20,607 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:20,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:21,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:21,208 INFO L272 AbstractInterpreter]: Visited 121 different actions 486 times. Merged at 8 different actions 35 times. Never widened. Performed 6920 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6920 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:21,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:21,219 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:21,452 INFO L227 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 80.92% of their original sizes. [2018-11-12 17:13:21,453 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:21,564 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-12 17:13:21,564 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:21,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:21,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:13:21,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:21,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:21,566 INFO L87 Difference]: Start difference. First operand 3997 states and 5290 transitions. Second operand 11 states. [2018-11-12 17:13:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:31,028 INFO L93 Difference]: Finished difference Result 8833 states and 11836 transitions. [2018-11-12 17:13:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:31,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2018-11-12 17:13:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:31,048 INFO L225 Difference]: With dead ends: 8833 [2018-11-12 17:13:31,048 INFO L226 Difference]: Without dead ends: 4842 [2018-11-12 17:13:31,059 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 187 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:13:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2018-11-12 17:13:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4757. [2018-11-12 17:13:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4757 states. [2018-11-12 17:13:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6223 transitions. [2018-11-12 17:13:31,173 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6223 transitions. Word has length 175 [2018-11-12 17:13:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:31,173 INFO L480 AbstractCegarLoop]: Abstraction has 4757 states and 6223 transitions. [2018-11-12 17:13:31,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6223 transitions. [2018-11-12 17:13:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 17:13:31,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:31,185 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:31,185 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:31,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1692770289, now seen corresponding path program 1 times [2018-11-12 17:13:31,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:31,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:31,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:13:31,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:31,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:31,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-12 17:13:31,304 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:31,307 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:31,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:31,932 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:31,932 INFO L272 AbstractInterpreter]: Visited 120 different actions 477 times. Merged at 8 different actions 30 times. Never widened. Performed 6896 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6896 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:13:31,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:31,938 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:32,177 INFO L227 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 80.89% of their original sizes. [2018-11-12 17:13:32,178 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:32,357 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-12 17:13:32,358 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:32,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:32,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-12 17:13:32,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:32,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:13:32,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:13:32,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:13:32,359 INFO L87 Difference]: Start difference. First operand 4757 states and 6223 transitions. Second operand 10 states. [2018-11-12 17:13:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:38,546 INFO L93 Difference]: Finished difference Result 11055 states and 14835 transitions. [2018-11-12 17:13:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:13:38,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2018-11-12 17:13:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:38,572 INFO L225 Difference]: With dead ends: 11055 [2018-11-12 17:13:38,573 INFO L226 Difference]: Without dead ends: 6304 [2018-11-12 17:13:38,587 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:13:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2018-11-12 17:13:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6192. [2018-11-12 17:13:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6192 states. [2018-11-12 17:13:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6192 states to 6192 states and 8015 transitions. [2018-11-12 17:13:38,743 INFO L78 Accepts]: Start accepts. Automaton has 6192 states and 8015 transitions. Word has length 175 [2018-11-12 17:13:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:38,744 INFO L480 AbstractCegarLoop]: Abstraction has 6192 states and 8015 transitions. [2018-11-12 17:13:38,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:13:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6192 states and 8015 transitions. [2018-11-12 17:13:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-12 17:13:38,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:38,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:38,758 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:38,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1126269754, now seen corresponding path program 1 times [2018-11-12 17:13:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:38,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:38,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:13:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:39,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:39,222 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-12 17:13:39,223 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], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:39,225 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:39,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:40,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:40,067 INFO L272 AbstractInterpreter]: Visited 121 different actions 483 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 6926 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6926 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:13:40,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:40,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:40,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:40,074 INFO L192 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-12 17:13:40,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:40,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:40,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:13:40,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:13:40,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:13:40,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:13:40,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:13:40,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:13:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:13:40,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:13:40,795 INFO L87 Difference]: Start difference. First operand 6192 states and 8015 transitions. Second operand 9 states. [2018-11-12 17:13:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:45,022 INFO L93 Difference]: Finished difference Result 14524 states and 19404 transitions. [2018-11-12 17:13:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:13:45,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2018-11-12 17:13:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:45,056 INFO L225 Difference]: With dead ends: 14524 [2018-11-12 17:13:45,056 INFO L226 Difference]: Without dead ends: 4839 [2018-11-12 17:13:45,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:13:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2018-11-12 17:13:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4329. [2018-11-12 17:13:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4329 states. [2018-11-12 17:13:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 5202 transitions. [2018-11-12 17:13:45,195 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 5202 transitions. Word has length 183 [2018-11-12 17:13:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:45,195 INFO L480 AbstractCegarLoop]: Abstraction has 4329 states and 5202 transitions. [2018-11-12 17:13:45,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:13:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 5202 transitions. [2018-11-12 17:13:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-12 17:13:45,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:45,204 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:13:45,204 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:45,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1798336570, now seen corresponding path program 1 times [2018-11-12 17:13:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:45,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:45,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:45,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:45,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-12 17:13:45,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [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], [324], [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], [591], [593], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:45,777 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:45,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:46,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:46,268 INFO L272 AbstractInterpreter]: Visited 120 different actions 353 times. Merged at 7 different actions 17 times. Never widened. Performed 5321 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:46,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:46,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:46,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:46,283 INFO L192 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-12 17:13:46,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:46,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:46,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:13:46,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:13:46,592 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:46,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2018-11-12 17:13:46,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:46,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:46,594 INFO L87 Difference]: Start difference. First operand 4329 states and 5202 transitions. Second operand 3 states. [2018-11-12 17:13:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:47,429 INFO L93 Difference]: Finished difference Result 10303 states and 12664 transitions. [2018-11-12 17:13:47,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:47,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-11-12 17:13:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:47,431 INFO L225 Difference]: With dead ends: 10303 [2018-11-12 17:13:47,431 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:13:47,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:13:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:13:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:13:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:13:47,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2018-11-12 17:13:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:47,455 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:13:47,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:13:47,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:13:47,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:13:48,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,083 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 153 [2018-11-12 17:13:48,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:48,479 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 166 [2018-11-12 17:13:49,425 WARN L179 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-12 17:13:50,251 WARN L179 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-12 17:13:53,287 WARN L179 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 336 DAG size of output: 116 [2018-11-12 17:13:53,764 WARN L179 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 91 [2018-11-12 17:13:54,398 WARN L179 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 88 [2018-11-12 17:13:54,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:54,402 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a25~0)| ~a25~0)) [2018-11-12 17:13:54,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:54,402 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,402 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:13:54,403 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:13:54,404 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:13:54,405 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:13:54,406 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:13:54,407 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:13:54,408 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:13:54,409 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:13:54,410 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:13:54,411 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:13:54,412 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:13:54,413 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:13:54,414 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:13:54,415 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:13:54,416 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,417 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:13:54,418 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,419 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,420 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,420 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse28 (< |old(~a11~0)| 0)) (.cse29 (< |old(~a28~0)| 9)) (.cse27 (< 1 |old(~a11~0)|)) (.cse14 (not (= 1 ~a21~0))) (.cse19 (not (= 1 |old(~a19~0)|))) (.cse20 (< 1 |old(~a25~0)|)) (.cse30 (not (= 0 |old(~a11~0)|))) (.cse21 (< 11 |old(~a28~0)|)) (.cse15 (< |old(~a25~0)| 0)) (.cse17 (< |old(~a28~0)| 7)) (.cse0 (= |old(~a19~0)| ~a19~0)) (.cse11 (<= ~a17~0 7)) (.cse1 (= ~a11~0 |old(~a11~0)|)) (.cse2 (= |old(~a25~0)| ~a25~0))) (let ((.cse24 (= 1 |old(~a25~0)|)) (.cse12 (= ~a19~0 1)) (.cse25 (= |old(~a11~0)| |old(~a19~0)|)) (.cse26 (and .cse0 .cse11 .cse1 .cse2)) (.cse18 (< 7 |old(~a17~0)|)) (.cse10 (<= ~a28~0 11)) (.cse6 (and (or .cse14 .cse28 .cse19 .cse20 .cse29 .cse27 .cse21 .cse15) (or .cse14 .cse19 .cse20 .cse30 .cse21 .cse15 .cse17))) (.cse23 (< 8 |old(~a17~0)|)) (.cse22 (< |old(~a17~0)| 7)) (.cse3 (< 6 |calculate_output_#in~input|)) (.cse4 (<= ~a28~0 10)) (.cse9 (<= 7 ~a28~0)) (.cse13 (<= 7 ~a17~0)) (.cse16 (not (= 1 |old(~a11~0)|))) (.cse5 (< 10 |old(~a28~0)|)) (.cse7 (not (= 8 |old(~a17~0)|))) (.cse8 (< |calculate_output_#in~input| 1))) (and (or (= 7 |old(~a17~0)|) (and (<= ~a17~0 |old(~a17~0)|) .cse0 .cse1 (not (= ~a17~0 7)) .cse2)) (or .cse3 (and .cse4 (or (= ~a25~0 0) (<= 8 ~a28~0))) (< |old(~a28~0)| 8) .cse5 .cse6 .cse7 .cse8) (or (and .cse2 .cse9 .cse10 .cse11 (= 1 ~a11~0) .cse12 .cse13) .cse3 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse8 .cse22) (or .cse3 .cse9 .cse6 .cse23 .cse8 .cse22) (or .cse3 (or (not (= 11 |old(~a28~0)|)) (not .cse24)) (= ~a28~0 11) .cse6 .cse7 .cse25 .cse8) (or .cse18 .cse24 .cse26) (or .cse3 .cse14 .cse27 .cse17 .cse18 .cse28 .cse19 (and .cse2 (<= 0 ~a11~0) .cse11 (<= ~a11~0 1) .cse12 (not (= ~a19~0 ~a11~0))) .cse25 .cse8) (or .cse26 .cse29 .cse18) (or (or .cse14 .cse3 (not (= 7 |old(~a28~0)|)) .cse30) .cse19 (= ~a28~0 7) .cse7 (not (= 0 |old(~a25~0)|)) .cse8) (or (<= 9 ~a28~0) .cse29) (or .cse3 (and .cse10 .cse13) .cse6 .cse23 .cse8 .cse22) (or .cse3 .cse14 (and .cse4 .cse9 .cse13) .cse15 .cse16 .cse17 .cse5 .cse19 .cse20 .cse7 .cse8)))) [2018-11-12 17:13:54,420 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:13:54,421 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,422 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:13:54,423 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:54,424 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:54,425 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:13:54,426 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:13:54,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:54,428 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-12 17:13:54,428 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:13:54,428 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:54,428 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)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a28~0 7) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:13:54,428 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:13:54,429 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 7))) (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (<= 7 ~a28~0) (<= 0 ~a11~0) (<= ~a11~0 1) (= ~a19~0 1) (<= ~a17~0 8)) (and .cse0 (not (= ~a25~0 1))) (not (= ~a21~0 1)) (and (<= ~a17~0 |old(~a17~0)|) (not (= ~a17~0 7))) (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)) (and .cse0 (<= 9 ~a28~0)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) [2018-11-12 17:13:54,429 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:54,429 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:54,429 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 7))) (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and .cse0 (not (= ~a25~0 1))) (not (= ~a21~0 1)) (and (<= ~a17~0 |old(~a17~0)|) (not (= ~a17~0 7))) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (<= 7 ~a28~0) (<= 0 ~a11~0) (<= ~a11~0 1) (= ~a19~0 1) (<= ~a17~0 8)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse0 (<= 9 ~a28~0)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)))) [2018-11-12 17:13:54,429 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:13:54,429 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:13:54,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:13:54 BoogieIcfgContainer [2018-11-12 17:13:54,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:13:54,443 INFO L168 Benchmark]: Toolchain (without parser) took 90347.22 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -170.2 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:54,444 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:13:54,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.64 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-12 17:13:54,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:54,447 INFO L168 Benchmark]: Boogie Preprocessor took 97.87 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-12 17:13:54,447 INFO L168 Benchmark]: RCFGBuilder took 3371.90 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:54,448 INFO L168 Benchmark]: TraceAbstraction took 86015.64 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 479.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:54,452 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.64 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 127.94 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.87 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 3371.90 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86015.64 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 479.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 496]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(a11) == 0) || !(v == 22)) || !(u == 21)) || ((((7 <= a28 && 0 <= a11) && a11 <= 1) && a19 == 1) && a17 <= 8)) || (a17 <= 7 && !(a25 == 1))) || !(a21 == 1)) || (a17 <= \old(a17) && !(a17 == 7))) || !(y == 25)) || !(3 == c)) || !(\old(a25) == 0)) || !(\old(a28) == 7)) || !(a == 1)) || !(26 == z)) || !(1 == \old(a19))) || !(x == 24)) || (a17 <= 7 && 9 <= a28)) || !(8 == \old(a17))) || !(e == 5)) || !(d == 4)) || !(6 == f)) || !(w == 23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 85.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 64.3s AutomataDifference, 0.0s DeadEndRemovalTime, 6.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1842 SDtfs, 9523 SDslu, 2693 SDs, 0 SdLazy, 13017 SolverSat, 2560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1685 GetRequests, 1512 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6192occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.9964786472669265 AbsIntWeakeningRatio, 0.23893805309734514 AbsIntAvgWeakeningVarsNumRemoved, 27.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1087 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 209 PreInvPairs, 319 NumberOfFragments, 1013 HoareAnnotationTreeSize, 209 FomulaSimplifications, 42199 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14580 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1942 NumberOfCodeBlocks, 1942 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2309 ConstructedInterpolants, 0 QuantifiedInterpolants, 955261 SizeOfPredicates, 2 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 878/949 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...