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_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:11:36,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:11:36,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:11:36,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:11:36,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:11:36,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:11:36,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:11:36,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:11:36,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:11:36,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:11:36,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:11:36,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:11:36,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:11:36,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:11:36,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:11:36,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:11:36,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:11:36,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:11:36,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:11:36,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:11:36,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:11:36,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:11:36,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:11:36,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:11:36,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:11:36,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:11:36,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:11:36,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:11:36,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:11:36,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:11:36,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:11:36,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:11:36,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:11:36,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:11:36,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:11:36,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:11:36,284 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:11:36,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:11:36,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:11:36,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:11:36,305 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:11:36,305 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:11:36,305 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:11:36,305 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:11:36,305 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:11:36,306 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:11:36,306 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:11:36,307 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:11:36,307 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:11:36,307 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:11:36,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:11:36,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:11:36,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:11:36,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:11:36,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:11:36,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:11:36,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:11:36,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:11:36,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:11:36,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:11:36,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:11:36,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:11:36,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:11:36,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:11:36,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:11:36,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:11:36,313 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:11:36,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:11:36,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:11:36,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:11:36,314 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:11:36,314 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:11:36,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:11:36,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:11:36,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:11:36,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:11:36,398 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:11:36,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-11-12 17:11:36,462 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55219c76f/c6cb52135cc948f985c88c6a068ff03d/FLAGd8a196457 [2018-11-12 17:11:37,040 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:11:37,041 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-11-12 17:11:37,053 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55219c76f/c6cb52135cc948f985c88c6a068ff03d/FLAGd8a196457 [2018-11-12 17:11:37,079 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55219c76f/c6cb52135cc948f985c88c6a068ff03d [2018-11-12 17:11:37,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:11:37,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:11:37,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:37,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:11:37,100 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:11:37,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:37,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48866cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37, skipping insertion in model container [2018-11-12 17:11:37,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:37,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:11:37,187 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:11:37,666 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:37,671 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:11:37,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:37,827 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:11:37,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37 WrapperNode [2018-11-12 17:11:37,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:37,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:37,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:11:37,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:11:37,850 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:11:37" (1/1) ... [2018-11-12 17:11:37,869 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:11:37" (1/1) ... [2018-11-12 17:11:37,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:37,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:11:37,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:11:37,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:11:37,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:37,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:37,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:37,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:38,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:38,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:38,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (1/1) ... [2018-11-12 17:11:38,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:11:38,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:11:38,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:11:38,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:11:38,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (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:11:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:11:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:11:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:11:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:11:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:11:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:11:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:11:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:11:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:11:41,381 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:11:41,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:41 BoogieIcfgContainer [2018-11-12 17:11:41,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:11:41,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:11:41,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:11:41,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:11:41,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:11:37" (1/3) ... [2018-11-12 17:11:41,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5634d3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:41, skipping insertion in model container [2018-11-12 17:11:41,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:37" (2/3) ... [2018-11-12 17:11:41,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5634d3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:41, skipping insertion in model container [2018-11-12 17:11:41,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:41" (3/3) ... [2018-11-12 17:11:41,397 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-11-12 17:11:41,409 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:11:41,424 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:11:41,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:11:41,493 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:11:41,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:11:41,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:11:41,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:11:41,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:11:41,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:11:41,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:11:41,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:11:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:11:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-12 17:11:41,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:41,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:41,548 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:41,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash -782709097, now seen corresponding path program 1 times [2018-11-12 17:11:41,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:41,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:41,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:41,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:42,207 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:11:42,388 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:11:42,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:42,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:11:42,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:42,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:11:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:11:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:11:42,421 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:11:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:43,897 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-12 17:11:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:11:43,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-11-12 17:11:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:43,921 INFO L225 Difference]: With dead ends: 621 [2018-11-12 17:11:43,921 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:11:43,928 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:11:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:11:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:11:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:11:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-12 17:11:44,007 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 133 [2018-11-12 17:11:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:44,008 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-12 17:11:44,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:11:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-12 17:11:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:11:44,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:44,016 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:44,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:44,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1001431126, now seen corresponding path program 1 times [2018-11-12 17:11:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:44,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:44,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:11:44,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:44,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:11:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:11:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:44,467 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-12 17:11:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:46,145 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-12 17:11:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:11:46,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-12 17:11:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:46,153 INFO L225 Difference]: With dead ends: 903 [2018-11-12 17:11:46,153 INFO L226 Difference]: Without dead ends: 381 [2018-11-12 17:11:46,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-12 17:11:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-12 17:11:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-12 17:11:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-12 17:11:46,185 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 142 [2018-11-12 17:11:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:46,186 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-12 17:11:46,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:11:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-12 17:11:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-12 17:11:46,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:46,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:46,191 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:46,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1638990538, now seen corresponding path program 1 times [2018-11-12 17:11:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:46,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:46,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:46,614 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-12 17:11:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:46,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:46,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:11:46,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:46,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:11:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:11:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:46,808 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-12 17:11:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:48,467 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-12 17:11:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:11:48,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-11-12 17:11:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:48,471 INFO L225 Difference]: With dead ends: 901 [2018-11-12 17:11:48,471 INFO L226 Difference]: Without dead ends: 380 [2018-11-12 17:11:48,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-12 17:11:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-12 17:11:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-12 17:11:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-12 17:11:48,492 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 148 [2018-11-12 17:11:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:48,493 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-12 17:11:48,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:11:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-12 17:11:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 17:11:48,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:48,497 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:48,497 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:48,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2027073139, now seen corresponding path program 1 times [2018-11-12 17:11:48,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:48,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:48,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:48,677 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:11:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:11:48,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:48,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:11:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:11:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:11:48,679 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-12 17:11:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:51,800 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-12 17:11:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:11:51,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-11-12 17:11:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:51,814 INFO L225 Difference]: With dead ends: 1193 [2018-11-12 17:11:51,815 INFO L226 Difference]: Without dead ends: 819 [2018-11-12 17:11:51,817 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:11:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-12 17:11:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-12 17:11:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-12 17:11:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-12 17:11:51,867 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 156 [2018-11-12 17:11:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:51,867 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-12 17:11:51,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:11:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-12 17:11:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 17:11:51,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:51,873 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:51,873 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:51,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1763589615, now seen corresponding path program 1 times [2018-11-12 17:11:51,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:51,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:52,338 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 17:11:52,576 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-12 17:11:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:52,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:52,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:11:52,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:52,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:11:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:11:52,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:52,645 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-12 17:11:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:53,756 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-12 17:11:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:11:53,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-11-12 17:11:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:53,773 INFO L225 Difference]: With dead ends: 1753 [2018-11-12 17:11:53,773 INFO L226 Difference]: Without dead ends: 804 [2018-11-12 17:11:53,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-12 17:11:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-12 17:11:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-12 17:11:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-12 17:11:53,802 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 158 [2018-11-12 17:11:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:53,802 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-12 17:11:53,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:11:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-12 17:11:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-12 17:11:53,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:53,807 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:53,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:53,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1311761045, now seen corresponding path program 1 times [2018-11-12 17:11:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:53,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:54,193 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 17:11:54,442 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:11:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:54,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:11:54,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:54,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:11:54,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:11:54,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:54,541 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-12 17:11:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:55,541 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-12 17:11:55,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:11:55,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-12 17:11:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:55,546 INFO L225 Difference]: With dead ends: 1747 [2018-11-12 17:11:55,547 INFO L226 Difference]: Without dead ends: 801 [2018-11-12 17:11:55,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-12 17:11:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-12 17:11:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-12 17:11:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-12 17:11:55,573 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 160 [2018-11-12 17:11:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:55,574 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-12 17:11:55,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:11:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-12 17:11:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 17:11:55,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:55,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:55,578 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:55,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash -269929571, now seen corresponding path program 1 times [2018-11-12 17:11:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:55,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:11:55,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:55,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:11:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:11:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:11:55,774 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-12 17:11:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:57,702 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-12 17:11:57,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:11:57,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-12 17:11:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:57,713 INFO L225 Difference]: With dead ends: 2381 [2018-11-12 17:11:57,713 INFO L226 Difference]: Without dead ends: 1586 [2018-11-12 17:11:57,718 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:11:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-12 17:11:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-12 17:11:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-12 17:11:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-12 17:11:57,767 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 164 [2018-11-12 17:11:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:57,767 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-12 17:11:57,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:11:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-12 17:11:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-12 17:11:57,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:57,776 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:57,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:57,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1973584945, now seen corresponding path program 1 times [2018-11-12 17:11:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:57,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:57,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:57,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:57,977 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-12 17:11:57,979 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:11:58,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:58,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:59,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:59,469 INFO L272 AbstractInterpreter]: Visited 137 different actions 270 times. Merged at 5 different actions 7 times. Never widened. Performed 3857 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3857 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:11:59,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:59,504 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:00,459 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 81.33% of their original sizes. [2018-11-12 17:12:00,459 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:02,355 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-12 17:12:02,355 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:02,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:02,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:12:02,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:02,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:12:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:12:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:12:02,358 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-11-12 17:12:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:19,992 INFO L93 Difference]: Finished difference Result 3716 states and 5313 transitions. [2018-11-12 17:12:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:12:19,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 199 [2018-11-12 17:12:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:20,003 INFO L225 Difference]: With dead ends: 3716 [2018-11-12 17:12:20,003 INFO L226 Difference]: Without dead ends: 2164 [2018-11-12 17:12:20,009 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:12:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2018-11-12 17:12:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2018-11-12 17:12:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-11-12 17:12:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2889 transitions. [2018-11-12 17:12:20,068 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2889 transitions. Word has length 199 [2018-11-12 17:12:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:20,068 INFO L480 AbstractCegarLoop]: Abstraction has 2152 states and 2889 transitions. [2018-11-12 17:12:20,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:12:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2889 transitions. [2018-11-12 17:12:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-12 17:12:20,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:20,078 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:20,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:20,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 366903565, now seen corresponding path program 1 times [2018-11-12 17:12:20,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:20,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:20,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:20,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:20,349 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-12 17:12:20,350 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:20,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:20,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:20,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:20,739 INFO L272 AbstractInterpreter]: Visited 137 different actions 270 times. Merged at 5 different actions 7 times. Never widened. Performed 3839 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3839 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:12:20,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:20,746 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:21,244 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 81.32% of their original sizes. [2018-11-12 17:12:21,244 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:21,978 INFO L415 sIntCurrentIteration]: We unified 201 AI predicates to 201 [2018-11-12 17:12:21,978 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:21,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:12:21,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:21,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:12:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:12:21,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:12:21,983 INFO L87 Difference]: Start difference. First operand 2152 states and 2889 transitions. Second operand 18 states. [2018-11-12 17:12:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:33,201 INFO L93 Difference]: Finished difference Result 5055 states and 6869 transitions. [2018-11-12 17:12:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:12:33,201 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 202 [2018-11-12 17:12:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:33,215 INFO L225 Difference]: With dead ends: 5055 [2018-11-12 17:12:33,216 INFO L226 Difference]: Without dead ends: 2909 [2018-11-12 17:12:33,223 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:12:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2018-11-12 17:12:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2899. [2018-11-12 17:12:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2899 states. [2018-11-12 17:12:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3786 transitions. [2018-11-12 17:12:33,298 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3786 transitions. Word has length 202 [2018-11-12 17:12:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:33,298 INFO L480 AbstractCegarLoop]: Abstraction has 2899 states and 3786 transitions. [2018-11-12 17:12:33,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:12:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3786 transitions. [2018-11-12 17:12:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-12 17:12:33,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:33,310 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:33,310 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:33,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 929493308, now seen corresponding path program 1 times [2018-11-12 17:12:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:33,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:33,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:33,522 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:12:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:33,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:33,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:33,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-12 17:12:33,589 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:33,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:33,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:34,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:12:34,493 INFO L272 AbstractInterpreter]: Visited 139 different actions 413 times. Merged at 7 different actions 20 times. Never widened. Performed 5978 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:12:34,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:34,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:12:34,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:34,501 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:12:34,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:34,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:12:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:34,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:12:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:12:34,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:12:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:12:35,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:12:35,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-12 17:12:35,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:12:35,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:12:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:12:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:12:35,155 INFO L87 Difference]: Start difference. First operand 2899 states and 3786 transitions. Second operand 14 states. [2018-11-12 17:12:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:39,934 INFO L93 Difference]: Finished difference Result 8787 states and 12017 transitions. [2018-11-12 17:12:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:12:39,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-11-12 17:12:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:39,961 INFO L225 Difference]: With dead ends: 8787 [2018-11-12 17:12:39,961 INFO L226 Difference]: Without dead ends: 4058 [2018-11-12 17:12:39,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 17:12:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2018-11-12 17:12:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4031. [2018-11-12 17:12:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2018-11-12 17:12:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 4704 transitions. [2018-11-12 17:12:40,079 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 4704 transitions. Word has length 204 [2018-11-12 17:12:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:40,079 INFO L480 AbstractCegarLoop]: Abstraction has 4031 states and 4704 transitions. [2018-11-12 17:12:40,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:12:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 4704 transitions. [2018-11-12 17:12:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-12 17:12:40,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:40,091 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,091 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:40,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash -217545217, now seen corresponding path program 1 times [2018-11-12 17:12:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:40,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 97 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:41,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:41,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:41,058 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-11-12 17:12:41,059 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [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], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:41,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:41,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:41,658 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:41,658 INFO L272 AbstractInterpreter]: Visited 137 different actions 409 times. Merged at 7 different actions 20 times. Never widened. Performed 5921 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5921 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:12:41,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:41,664 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:42,056 INFO L227 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 80.98% of their original sizes. [2018-11-12 17:12:42,056 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:42,212 INFO L415 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2018-11-12 17:12:42,212 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:42,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:42,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 17:12:42,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:42,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:12:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:12:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:12:42,214 INFO L87 Difference]: Start difference. First operand 4031 states and 4704 transitions. Second operand 11 states. [2018-11-12 17:12:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:50,616 INFO L93 Difference]: Finished difference Result 8411 states and 10114 transitions. [2018-11-12 17:12:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:12:50,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 241 [2018-11-12 17:12:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:50,638 INFO L225 Difference]: With dead ends: 8411 [2018-11-12 17:12:50,638 INFO L226 Difference]: Without dead ends: 5490 [2018-11-12 17:12:50,646 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:12:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5490 states. [2018-11-12 17:12:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5490 to 5404. [2018-11-12 17:12:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-11-12 17:12:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 6230 transitions. [2018-11-12 17:12:50,772 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 6230 transitions. Word has length 241 [2018-11-12 17:12:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:50,773 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 6230 transitions. [2018-11-12 17:12:50,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:12:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 6230 transitions. [2018-11-12 17:12:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-12 17:12:50,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:50,790 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,790 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:50,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1647758192, now seen corresponding path program 1 times [2018-11-12 17:12:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:50,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:50,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 198 proven. 24 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-12 17:12:50,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:50,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:50,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-12 17:12:50,998 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:51,001 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:51,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:51,770 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:51,770 INFO L272 AbstractInterpreter]: Visited 139 different actions 556 times. Merged at 8 different actions 33 times. Never widened. Performed 7558 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:12:51,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:51,777 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:52,148 INFO L227 lantSequenceWeakener]: Weakened 294 states. On average, predicates are now at 80.96% of their original sizes. [2018-11-12 17:12:52,148 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:52,247 INFO L415 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2018-11-12 17:12:52,247 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:52,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:12:52,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:52,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:12:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:12:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:12:52,249 INFO L87 Difference]: Start difference. First operand 5404 states and 6230 transitions. Second operand 11 states. [2018-11-12 17:12:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:58,976 INFO L93 Difference]: Finished difference Result 11612 states and 13632 transitions. [2018-11-12 17:12:58,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:12:58,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 297 [2018-11-12 17:12:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:59,003 INFO L225 Difference]: With dead ends: 11612 [2018-11-12 17:12:59,003 INFO L226 Difference]: Without dead ends: 7102 [2018-11-12 17:12:59,015 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:12:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7102 states. [2018-11-12 17:12:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7102 to 7073. [2018-11-12 17:12:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7073 states. [2018-11-12 17:12:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7073 states to 7073 states and 8010 transitions. [2018-11-12 17:12:59,185 INFO L78 Accepts]: Start accepts. Automaton has 7073 states and 8010 transitions. Word has length 297 [2018-11-12 17:12:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:59,186 INFO L480 AbstractCegarLoop]: Abstraction has 7073 states and 8010 transitions. [2018-11-12 17:12:59,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:12:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7073 states and 8010 transitions. [2018-11-12 17:12:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-12 17:12:59,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:59,206 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:12:59,207 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:59,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2068173172, now seen corresponding path program 1 times [2018-11-12 17:12:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:59,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 265 proven. 114 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-12 17:12:59,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:59,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:59,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-11-12 17:12:59,756 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:59,759 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:59,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:00,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:00,994 INFO L272 AbstractInterpreter]: Visited 143 different actions 718 times. Merged at 10 different actions 54 times. Widened at 1 different actions 1 times. Performed 9370 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 16 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:13:01,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:01,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:01,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:01,028 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:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:01,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:01,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 341 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-12 17:13:01,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 273 proven. 30 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-12 17:13:01,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:13:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:13:01,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:13:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:13:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:13:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:13:01,958 INFO L87 Difference]: Start difference. First operand 7073 states and 8010 transitions. Second operand 9 states. [2018-11-12 17:13:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:05,284 INFO L93 Difference]: Finished difference Result 13206 states and 15138 transitions. [2018-11-12 17:13:05,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 17:13:05,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 315 [2018-11-12 17:13:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:05,304 INFO L225 Difference]: With dead ends: 13206 [2018-11-12 17:13:05,304 INFO L226 Difference]: Without dead ends: 5556 [2018-11-12 17:13:05,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 651 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 17:13:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2018-11-12 17:13:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 5039. [2018-11-12 17:13:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5039 states. [2018-11-12 17:13:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 5587 transitions. [2018-11-12 17:13:05,433 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 5587 transitions. Word has length 315 [2018-11-12 17:13:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:05,433 INFO L480 AbstractCegarLoop]: Abstraction has 5039 states and 5587 transitions. [2018-11-12 17:13:05,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:13:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 5587 transitions. [2018-11-12 17:13:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-12 17:13:05,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:05,450 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,450 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:05,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1076086226, now seen corresponding path program 1 times [2018-11-12 17:13:05,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:05,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:05,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-12 17:13:05,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:05,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:05,987 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-11-12 17:13:05,987 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [248], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:05,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:05,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:07,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:07,312 INFO L272 AbstractInterpreter]: Visited 140 different actions 843 times. Merged at 9 different actions 61 times. Widened at 1 different actions 2 times. Performed 11564 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:07,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:07,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:07,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:07,322 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:13:07,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:07,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:07,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-12 17:13:07,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-12 17:13:07,797 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:07,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-12 17:13:07,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:07,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:13:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:13:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:13:07,799 INFO L87 Difference]: Start difference. First operand 5039 states and 5587 transitions. Second operand 3 states. [2018-11-12 17:13:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:08,370 INFO L93 Difference]: Finished difference Result 8023 states and 8999 transitions. [2018-11-12 17:13:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:13:08,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2018-11-12 17:13:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:08,372 INFO L225 Difference]: With dead ends: 8023 [2018-11-12 17:13:08,372 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:13:08,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:13:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:13:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:13:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:13:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:13:08,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 320 [2018-11-12 17:13:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:08,393 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:13:08,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:13:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:13:08,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:13:08,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:13:08,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,875 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2018-11-12 17:13:08,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:08,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:09,140 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 129 [2018-11-12 17:13:09,577 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-11-12 17:13:10,338 WARN L179 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2018-11-12 17:13:17,365 WARN L179 SmtUtils]: Spent 7.01 s on a formula simplification. DAG size of input: 273 DAG size of output: 144 [2018-11-12 17:13:18,034 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 85 [2018-11-12 17:13:19,176 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 144 DAG size of output: 74 [2018-11-12 17:13:19,180 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:19,180 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:13:19,180 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:19,180 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:13:19,181 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,182 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:13:19,183 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,184 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:13:19,185 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:13:19,186 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,187 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:13:19,188 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,189 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:13:19,190 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:13:19,191 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:13:19,192 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:13:19,193 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:13:19,194 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:13:19,194 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,194 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,194 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= 1 |old(~a19~0)|)) (.cse25 (= 9 |old(~a28~0)|)) (.cse4 (= 1 |old(~a25~0)|))) (let ((.cse20 (= |old(~a25~0)| ~a25~0)) (.cse23 (< 1 |old(~a19~0)|)) (.cse6 (not .cse4)) (.cse38 (not .cse25)) (.cse14 (not (= 8 |old(~a17~0)|))) (.cse46 (<= ~a19~0 1)) (.cse33 (<= 0 ~a11~0)) (.cse34 (<= ~a11~0 1)) (.cse45 (<= 0 ~a19~0)) (.cse31 (< |old(~a11~0)| 0)) (.cse24 (< 1 |old(~a11~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse22 (not .cse12)) (.cse32 (< 1 |old(~a25~0)|)) (.cse47 (not (= 0 |old(~a11~0)|))) (.cse26 (< |old(~a25~0)| 0)) (.cse27 (< |old(~a28~0)| 7)) (.cse40 (= |old(~a17~0)| ~a17~0)) (.cse37 (not (= ~a11~0 1))) (.cse36 (= ~a28~0 |old(~a28~0)|)) (.cse41 (= ~a25~0 |old(~a25~0)|)) (.cse7 (= 1 |old(~a11~0)|))) (let ((.cse17 (= 8 ~a17~0)) (.cse21 (not (= 10 |old(~a28~0)|))) (.cse13 (not (= 7 |old(~a28~0)|))) (.cse19 (not .cse7)) (.cse15 (= 7 ~a28~0)) (.cse16 (= 1 ~a11~0)) (.cse18 (= 1 ~a19~0)) (.cse39 (and .cse40 .cse37 .cse36 .cse41)) (.cse35 (= ~a17~0 8)) (.cse9 (let ((.cse48 (< 11 |old(~a28~0)|))) (and (or .cse0 .cse31 .cse22 .cse32 (< |old(~a28~0)| 9) .cse24 .cse48 .cse26) (or .cse0 .cse22 .cse32 .cse47 .cse48 .cse26 .cse27)))) (.cse28 (and .cse46 .cse33 .cse34 .cse45)) (.cse43 (< |old(~a28~0)| 8)) (.cse8 (= ~a19~0 1)) (.cse30 (< 9 |old(~a28~0)|)) (.cse10 (not (= |old(~a17~0)| 8))) (.cse5 (< 6 |calculate_output_#in~input|)) (.cse42 (and (or .cse23 .cse0 .cse6 .cse24 .cse38) (or .cse0 .cse22 .cse47 .cse14 .cse26))) (.cse29 (< |old(~a19~0)| 0)) (.cse11 (< |calculate_output_#in~input| 1)) (.cse44 (< |old(~a17~0)| 7)) (.cse1 (= 8 |old(~a28~0)|)) (.cse3 (< 7 |old(~a17~0)|)) (.cse2 (and .cse40 .cse20 .cse36))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 (and (= ~a11~0 0) .cse8) .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse14 (and .cse15 (not (= ~a25~0 1)) .cse16 .cse17 (not .cse18)) .cse19 .cse4) (or (and .cse16 .cse17 .cse18 .cse20 (= 10 ~a28~0)) .cse0 .cse21 .cse6 .cse22 .cse14 .cse19) (or .cse23 .cse5 .cse0 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse4 .cse7 .cse30 .cse31 .cse32 .cse10 .cse11) (or .cse5 .cse21 .cse9 (and .cse20 .cse33 .cse34 .cse35 .cse8 .cse36) .cse10 .cse11) (or .cse0 .cse7 .cse1 .cse37 .cse3) (or .cse0 .cse6 .cse22 .cse14 (and .cse16 (= 1 ~a25~0) (= 9 ~a28~0) .cse17 .cse18) .cse38 .cse19) (or .cse0 .cse39 .cse7 .cse21 .cse10) (or .cse0 .cse13 .cse6 .cse22 .cse19 (and .cse15 .cse16 (= 7 ~a17~0) .cse18 .cse20) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse39 .cse7 .cse30 .cse10) (or (and .cse40 .cse36 .cse37 .cse41) (or .cse0 .cse7 .cse6 .cse10)) (or .cse11 .cse5 (and .cse8 .cse41 .cse33 (= |old(~a28~0)| ~a28~0) .cse34 .cse35) .cse30 .cse9 .cse1 .cse10) (or .cse5 .cse6 .cse42 .cse29 .cse7 .cse43 .cse30 .cse31 .cse28 (< 8 |old(~a17~0)|) .cse11 .cse44) (or .cse0 .cse43 .cse30 .cse1 (and .cse40 (<= ~a28~0 9) (<= |old(~a28~0)| ~a28~0) .cse41) .cse3) (or .cse0 .cse30 .cse6 .cse1 .cse25 .cse10 (and .cse40 .cse36 .cse41)) (or .cse5 .cse0 .cse6 .cse24 .cse27 (and .cse8 .cse33 .cse34) .cse30 .cse31 .cse22 .cse1 .cse10 .cse11) (or .cse5 .cse42 .cse29 .cse3 .cse31 .cse11 .cse44 (and .cse33 .cse34 .cse45 .cse46)) (or .cse0 .cse7 .cse1 .cse3 .cse2))))) [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:13:19,195 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:13:19,196 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:13:19,197 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:13:19,198 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:13:19,199 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:19,200 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-12 17:13:19,201 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:13:19,201 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:19,201 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-12 17:13:19,202 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:13:19,202 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 7 ~a28~0)) (.cse7 (<= ~a17~0 7)) (.cse5 (not (= ~a28~0 8))) (.cse11 (<= ~a25~0 1)) (.cse9 (<= 0 ~a25~0)) (.cse10 (= ~a19~0 1)) (.cse3 (= |old(~a17~0)| ~a17~0)) (.cse8 (not (= ~a11~0 1))) (.cse6 (<= ~a28~0 9)) (.cse4 (= 1 ~a25~0)) (.cse1 (= 8 ~a17~0)) (.cse2 (= 1 ~a19~0)) (.cse12 (= 10 ~a28~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 (not .cse2)) (and .cse3 .cse4 .cse5 .cse6 (not (= ~a28~0 9))) (and .cse0 (= 7 ~a17~0) .cse2) (and .cse7 .cse5 .cse8) (and .cse3 .cse4 .cse8) (not (= 0 |old(~a25~0)|)) (and (<= 1 main_~input~0) (<= main_~input~0 6) (and .cse9 .cse10 .cse11) .cse12 (= ~a17~0 8)) (and .cse7 .cse5 .cse6 (<= 8 ~a28~0)) (and .cse3 .cse8 .cse12) (and .cse7 (not (= ~a25~0 1)) .cse5) (and (and .cse11 .cse9 (and .cse10 (<= 9 ~a28~0)) (<= ~a17~0 8)) .cse6) (and .cse3 .cse8 .cse6) (not (= 1 |old(~a19~0)|)) (and .cse4 .cse1 .cse2 .cse12) (not (= 8 |old(~a17~0)|)))) [2018-11-12 17:13:19,202 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:19,202 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:19,202 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (= 7 ~a28~0)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse2 (not (= ~a11~0 1))) (.cse8 (<= ~a17~0 7)) (.cse7 (not (= ~a28~0 8))) (.cse6 (= 1 ~a25~0)) (.cse4 (= 8 ~a17~0)) (.cse5 (= 1 ~a19~0)) (.cse12 (= 10 ~a28~0)) (.cse9 (<= 1 main_~input~0)) (.cse10 (<= main_~input~0 6)) (.cse11 (let ((.cse14 (<= 0 (+ main_~input~0 2147483648))) (.cse15 (<= ~a28~0 11)) (.cse16 (<= 0 ~a25~0)) (.cse17 (= ~a19~0 1)) (.cse18 (= ~a21~0 1)) (.cse19 (<= ~a25~0 1)) (.cse20 (<= main_~input~0 2147483647))) (or (and .cse14 .cse15 .cse16 .cse17 (<= 9 ~a28~0) .cse18 .cse19 .cse20) (and .cse14 .cse15 .cse16 (= ~a11~0 0) .cse17 .cse18 (<= 7 ~a28~0) .cse19 .cse20)))) (.cse13 (= ~a17~0 8)) (.cse1 (<= ~a28~0 9))) (or (and .cse0 .cse1 .cse2) (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse3 .cse4 (not .cse5)) (and .cse0 .cse6 .cse7 .cse1 (not (= ~a28~0 9))) (and .cse8 .cse7 .cse2) (and .cse3 (= 7 ~a17~0) .cse5) (and .cse6 (= 9 ~a28~0) .cse4 .cse5) (and .cse0 .cse6 .cse2) (not (= 0 |old(~a25~0)|)) (and .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse7 .cse1 (<= 8 ~a28~0)) (and .cse0 .cse2 .cse12) (and .cse8 (not (= ~a25~0 1)) .cse7) (not (= 1 |old(~a19~0)|)) (and .cse6 .cse4 .cse5 .cse12) (not (= 8 |old(~a17~0)|)) (and .cse9 .cse10 .cse11 .cse13 .cse1))) [2018-11-12 17:13:19,203 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:13:19,203 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:13:19,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:13:19 BoogieIcfgContainer [2018-11-12 17:13:19,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:13:19,217 INFO L168 Benchmark]: Toolchain (without parser) took 102124.65 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:19,218 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:13:19,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.67 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:19,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:19,220 INFO L168 Benchmark]: Boogie Preprocessor took 108.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:13:19,220 INFO L168 Benchmark]: RCFGBuilder took 3305.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:19,221 INFO L168 Benchmark]: TraceAbstraction took 97832.80 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:19,226 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.67 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 138.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3305.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97832.80 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: ((((((((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || ((7 == a28 && 8 == a17) && !(1 == a19))) || ((((\old(a17) == a17 && 1 == a25) && !(a28 == 8)) && a28 <= 9) && !(a28 == 9))) || ((7 == a28 && 7 == a17) && 1 == a19)) || ((a17 <= 7 && !(a28 == 8)) && !(a11 == 1))) || ((\old(a17) == a17 && 1 == a25) && !(a11 == 1))) || !(0 == \old(a25))) || ((((1 <= input && input <= 6) && (0 <= a25 && a19 == 1) && a25 <= 1) && 10 == a28) && a17 == 8)) || (((a17 <= 7 && !(a28 == 8)) && a28 <= 9) && 8 <= a28)) || ((\old(a17) == a17 && !(a11 == 1)) && 10 == a28)) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 8))) || ((((a25 <= 1 && 0 <= a25) && a19 == 1 && 9 <= a28) && a17 <= 8) && a28 <= 9)) || ((\old(a17) == a17 && !(a11 == 1)) && a28 <= 9)) || !(1 == \old(a19))) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 97.7s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 64.9s AutomataDifference, 0.0s DeadEndRemovalTime, 10.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1668 SDtfs, 12566 SDslu, 2882 SDs, 0 SdLazy, 16938 SolverSat, 2843 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2827 GetRequests, 2616 SyntacticMatches, 12 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7073occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.8s AbstIntTime, 7 AbstIntIterations, 4 AbstIntStrong, 0.9975915249271643 AbsIntWeakeningRatio, 0.16363636363636364 AbsIntAvgWeakeningVarsNumRemoved, 29.462032085561496 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 721 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 220 PreInvPairs, 319 NumberOfFragments, 1550 HoareAnnotationTreeSize, 220 FomulaSimplifications, 15458 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10192 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 3678 NumberOfCodeBlocks, 3678 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4497 ConstructedInterpolants, 0 QuantifiedInterpolants, 2927160 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1885 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 3373/3621 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...