java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:30,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:30,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:30,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:30,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:30,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:30,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:30,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:30,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:30,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:30,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:30,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:30,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:30,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:30,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:30,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:30,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:30,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:30,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:30,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:30,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:30,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:30,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:30,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:30,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:30,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:30,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:30,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:30,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:30,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:30,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:30,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:30,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:30,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:30,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:30,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:30,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:30,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:30,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:30,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:30,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:30,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:30,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:30,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:30,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:30,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:30,475 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:30,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:30,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:30,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:30,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:30,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:30,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:30,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:30,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:30,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:30,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:30,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:30,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:30,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:30,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:30,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:30,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:30,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:30,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:30,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:30,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:30,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:30,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:30,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:30,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:30,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:30,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:30,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:30,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:30,774 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:30,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-13 20:12:30,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b0f47df/74cbbfa983284c27b4447ad6814548ec/FLAG65bac9a4f [2019-10-13 20:12:31,394 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:31,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-13 20:12:31,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b0f47df/74cbbfa983284c27b4447ad6814548ec/FLAG65bac9a4f [2019-10-13 20:12:31,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b0f47df/74cbbfa983284c27b4447ad6814548ec [2019-10-13 20:12:31,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:31,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:31,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:31,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:31,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:31,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:31" (1/1) ... [2019-10-13 20:12:31,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ba606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:31, skipping insertion in model container [2019-10-13 20:12:31,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:31" (1/1) ... [2019-10-13 20:12:31,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:31,761 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:32,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:32,264 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:32,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:32,377 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:32,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32 WrapperNode [2019-10-13 20:12:32,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:32,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:32,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:32,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:32,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (1/1) ... [2019-10-13 20:12:32,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:32,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:32,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:32,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:32,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (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 [2019-10-13 20:12:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-13 20:12:32,532 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-13 20:12:32,533 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-13 20:12:32,533 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-13 20:12:32,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 20:12:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 20:12:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:32,536 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-13 20:12:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:33,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:33,412 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-13 20:12:33,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:33 BoogieIcfgContainer [2019-10-13 20:12:33,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:33,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:33,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:33,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:33,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:31" (1/3) ... [2019-10-13 20:12:33,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8a8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:33, skipping insertion in model container [2019-10-13 20:12:33,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:32" (2/3) ... [2019-10-13 20:12:33,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8a8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:33, skipping insertion in model container [2019-10-13 20:12:33,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:33" (3/3) ... [2019-10-13 20:12:33,423 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-13 20:12:33,434 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:33,444 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:12:33,456 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:12:33,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:33,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:33,482 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:33,482 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:33,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:33,499 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:33,499 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:33,499 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-13 20:12:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 20:12:33,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:33,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:33,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1873878464, now seen corresponding path program 1 times [2019-10-13 20:12:33,547 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:33,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109891641] [2019-10-13 20:12:33,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:33,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:33,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:33,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109891641] [2019-10-13 20:12:33,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:33,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:33,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355857524] [2019-10-13 20:12:33,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:33,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:33,704 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-10-13 20:12:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:33,744 INFO L93 Difference]: Finished difference Result 222 states and 373 transitions. [2019-10-13 20:12:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:33,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 20:12:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:33,759 INFO L225 Difference]: With dead ends: 222 [2019-10-13 20:12:33,759 INFO L226 Difference]: Without dead ends: 103 [2019-10-13 20:12:33,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-13 20:12:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-13 20:12:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-13 20:12:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-10-13 20:12:33,819 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2019-10-13 20:12:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:33,820 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-10-13 20:12:33,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-10-13 20:12:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 20:12:33,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:33,821 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:33,821 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1323314826, now seen corresponding path program 1 times [2019-10-13 20:12:33,822 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:33,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037798121] [2019-10-13 20:12:33,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:33,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:33,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:33,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037798121] [2019-10-13 20:12:33,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:33,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:33,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76891011] [2019-10-13 20:12:33,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:33,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:33,905 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 3 states. [2019-10-13 20:12:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:33,969 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2019-10-13 20:12:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:33,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 20:12:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:33,973 INFO L225 Difference]: With dead ends: 200 [2019-10-13 20:12:33,976 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 20:12:33,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 20:12:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-10-13 20:12:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-13 20:12:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-10-13 20:12:34,009 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2019-10-13 20:12:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:34,009 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-10-13 20:12:34,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-10-13 20:12:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:34,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:34,013 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:34,014 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1684995551, now seen corresponding path program 1 times [2019-10-13 20:12:34,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:34,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505546996] [2019-10-13 20:12:34,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:34,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505546996] [2019-10-13 20:12:34,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:34,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:34,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53218581] [2019-10-13 20:12:34,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:34,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:34,202 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 6 states. [2019-10-13 20:12:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:34,440 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2019-10-13 20:12:34,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:34,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:34,444 INFO L225 Difference]: With dead ends: 151 [2019-10-13 20:12:34,446 INFO L226 Difference]: Without dead ends: 146 [2019-10-13 20:12:34,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-13 20:12:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2019-10-13 20:12:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 20:12:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2019-10-13 20:12:34,479 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2019-10-13 20:12:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:34,479 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2019-10-13 20:12:34,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2019-10-13 20:12:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 20:12:34,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:34,485 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:34,485 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1145945773, now seen corresponding path program 1 times [2019-10-13 20:12:34,486 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:34,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912182679] [2019-10-13 20:12:34,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 20:12:34,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912182679] [2019-10-13 20:12:34,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:34,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:34,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673405276] [2019-10-13 20:12:34,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:34,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:34,620 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 5 states. [2019-10-13 20:12:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:34,809 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2019-10-13 20:12:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:34,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-13 20:12:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:34,811 INFO L225 Difference]: With dead ends: 110 [2019-10-13 20:12:34,812 INFO L226 Difference]: Without dead ends: 107 [2019-10-13 20:12:34,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-13 20:12:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-13 20:12:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 20:12:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2019-10-13 20:12:34,823 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2019-10-13 20:12:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:34,824 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2019-10-13 20:12:34,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2019-10-13 20:12:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 20:12:34,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:34,826 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:34,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1471361763, now seen corresponding path program 1 times [2019-10-13 20:12:34,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:34,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021439712] [2019-10-13 20:12:34,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:34,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 20:12:34,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021439712] [2019-10-13 20:12:34,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:34,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:34,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21445554] [2019-10-13 20:12:34,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:34,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:34,923 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 5 states. [2019-10-13 20:12:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:35,111 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2019-10-13 20:12:35,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:35,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-13 20:12:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:35,113 INFO L225 Difference]: With dead ends: 109 [2019-10-13 20:12:35,114 INFO L226 Difference]: Without dead ends: 106 [2019-10-13 20:12:35,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-13 20:12:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-13 20:12:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 20:12:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-10-13 20:12:35,126 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2019-10-13 20:12:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:35,127 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-10-13 20:12:35,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-10-13 20:12:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 20:12:35,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:35,128 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:35,129 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1648323131, now seen corresponding path program 1 times [2019-10-13 20:12:35,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:35,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756159082] [2019-10-13 20:12:35,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:35,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756159082] [2019-10-13 20:12:35,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:35,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:35,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492286614] [2019-10-13 20:12:35,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:35,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:35,258 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 7 states. [2019-10-13 20:12:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:35,554 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2019-10-13 20:12:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:12:35,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-13 20:12:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:35,556 INFO L225 Difference]: With dead ends: 141 [2019-10-13 20:12:35,557 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 20:12:35,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:12:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 20:12:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-10-13 20:12:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 20:12:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2019-10-13 20:12:35,568 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2019-10-13 20:12:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:35,569 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-10-13 20:12:35,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2019-10-13 20:12:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 20:12:35,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:35,570 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:35,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash 861386650, now seen corresponding path program 1 times [2019-10-13 20:12:35,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:35,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314986258] [2019-10-13 20:12:35,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:35,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314986258] [2019-10-13 20:12:35,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:35,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:35,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12927053] [2019-10-13 20:12:35,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:35,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:35,639 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 7 states. [2019-10-13 20:12:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:35,930 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2019-10-13 20:12:35,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:12:35,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-13 20:12:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:35,933 INFO L225 Difference]: With dead ends: 140 [2019-10-13 20:12:35,933 INFO L226 Difference]: Without dead ends: 137 [2019-10-13 20:12:35,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:12:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-13 20:12:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2019-10-13 20:12:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-13 20:12:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-13 20:12:35,943 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2019-10-13 20:12:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-13 20:12:35,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-13 20:12:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 20:12:35,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:35,945 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:35,946 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash 671486784, now seen corresponding path program 1 times [2019-10-13 20:12:35,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:35,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156932419] [2019-10-13 20:12:35,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:35,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:36,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156932419] [2019-10-13 20:12:36,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:36,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 20:12:36,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362048280] [2019-10-13 20:12:36,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 20:12:36,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 20:12:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:36,059 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 8 states. [2019-10-13 20:12:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:36,568 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2019-10-13 20:12:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 20:12:36,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-10-13 20:12:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:36,571 INFO L225 Difference]: With dead ends: 139 [2019-10-13 20:12:36,571 INFO L226 Difference]: Without dead ends: 136 [2019-10-13 20:12:36,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 20:12:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-13 20:12:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2019-10-13 20:12:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 20:12:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-10-13 20:12:36,581 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 33 [2019-10-13 20:12:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:36,582 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-10-13 20:12:36,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 20:12:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2019-10-13 20:12:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 20:12:36,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:36,583 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:36,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1082082582, now seen corresponding path program 1 times [2019-10-13 20:12:36,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:36,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044134480] [2019-10-13 20:12:36,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:36,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:36,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044134480] [2019-10-13 20:12:36,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:36,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 20:12:36,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605987093] [2019-10-13 20:12:36,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 20:12:36,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 20:12:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:36,703 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 8 states. [2019-10-13 20:12:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:37,156 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2019-10-13 20:12:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 20:12:37,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-10-13 20:12:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:37,159 INFO L225 Difference]: With dead ends: 138 [2019-10-13 20:12:37,159 INFO L226 Difference]: Without dead ends: 135 [2019-10-13 20:12:37,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 20:12:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-13 20:12:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-10-13 20:12:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 20:12:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2019-10-13 20:12:37,169 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 33 [2019-10-13 20:12:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:37,169 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2019-10-13 20:12:37,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 20:12:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2019-10-13 20:12:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 20:12:37,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:37,171 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:37,171 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1572887273, now seen corresponding path program 1 times [2019-10-13 20:12:37,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:37,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937415038] [2019-10-13 20:12:37,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 20:12:37,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937415038] [2019-10-13 20:12:37,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:37,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:37,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838802783] [2019-10-13 20:12:37,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:37,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:37,270 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand 5 states. [2019-10-13 20:12:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:37,413 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2019-10-13 20:12:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:37,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 20:12:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:37,416 INFO L225 Difference]: With dead ends: 126 [2019-10-13 20:12:37,416 INFO L226 Difference]: Without dead ends: 122 [2019-10-13 20:12:37,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-13 20:12:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-10-13 20:12:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 20:12:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-10-13 20:12:37,448 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 38 [2019-10-13 20:12:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:37,448 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-10-13 20:12:37,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-10-13 20:12:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 20:12:37,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:37,450 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:37,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash 235623500, now seen corresponding path program 1 times [2019-10-13 20:12:37,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:37,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101287592] [2019-10-13 20:12:37,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:37,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101287592] [2019-10-13 20:12:37,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:37,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:37,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810177754] [2019-10-13 20:12:37,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:37,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:37,536 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 7 states. [2019-10-13 20:12:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:37,634 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2019-10-13 20:12:37,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:37,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-13 20:12:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:37,636 INFO L225 Difference]: With dead ends: 152 [2019-10-13 20:12:37,636 INFO L226 Difference]: Without dead ends: 149 [2019-10-13 20:12:37,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 20:12:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-13 20:12:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 127. [2019-10-13 20:12:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-13 20:12:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2019-10-13 20:12:37,646 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 41 [2019-10-13 20:12:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:37,647 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2019-10-13 20:12:37,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2019-10-13 20:12:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 20:12:37,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:37,650 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 20:12:37,650 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1351973035, now seen corresponding path program 1 times [2019-10-13 20:12:37,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:37,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441347407] [2019-10-13 20:12:37,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:37,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441347407] [2019-10-13 20:12:37,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825828240] [2019-10-13 20:12:37,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:38,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 20:12:38,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:38,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2019-10-13 20:12:38,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:38,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2019-10-13 20:12:38,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:38,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2019-10-13 20:12:38,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 20:12:38,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:38,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 20:12:38,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:38,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:38,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 20:12:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:38,288 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:38,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1837247942] [2019-10-13 20:12:38,375 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-10-13 20:12:38,416 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:38,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:38,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:38,510 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 25 root evaluator evaluations with a maximum evaluation depth of 5. Performed 25 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 30 variables. [2019-10-13 20:12:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:38,515 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:38,603 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 79.37% of their original sizes. [2019-10-13 20:12:38,603 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:38,617 INFO L553 sIntCurrentIteration]: We unified 43 AI predicates to 43 [2019-10-13 20:12:38,617 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:38,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:38,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 9, 7] total 16 [2019-10-13 20:12:38,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073219256] [2019-10-13 20:12:38,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:38,621 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:38,621 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:38,621 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand 4 states. [2019-10-13 20:12:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:38,627 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-10-13 20:12:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:12:38,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 20:12:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:38,628 INFO L225 Difference]: With dead ends: 127 [2019-10-13 20:12:38,628 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:38,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:38,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-10-13 20:12:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:38,630 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:38,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:38,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:38,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:38,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:38,977 INFO L443 ceAbstractionStarter]: For program point failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2019-10-13 20:12:38,977 INFO L446 ceAbstractionStarter]: At program point failENTRY(lines 553 555) the Hoare annotation is: true [2019-10-13 20:12:38,977 INFO L443 ceAbstractionStarter]: For program point failEXIT(lines 553 555) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point failFINAL(lines 553 555) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point L578-2(line 578) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point L578-4(line 578) no Hoare annotation was computed. [2019-10-13 20:12:38,978 INFO L443 ceAbstractionStarter]: For program point L578-5(lines 578 581) no Hoare annotation was computed. [2019-10-13 20:12:38,979 INFO L443 ceAbstractionStarter]: For program point merge_pairFINAL(lines 573 583) no Hoare annotation was computed. [2019-10-13 20:12:38,979 INFO L446 ceAbstractionStarter]: At program point merge_pairENTRY(lines 573 583) the Hoare annotation is: true [2019-10-13 20:12:38,979 INFO L446 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: true [2019-10-13 20:12:38,979 INFO L446 ceAbstractionStarter]: At program point L581-1(lines 577 582) the Hoare annotation is: true [2019-10-13 20:12:38,979 INFO L446 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2019-10-13 20:12:38,979 INFO L443 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2019-10-13 20:12:38,979 INFO L443 ceAbstractionStarter]: For program point L577-3(lines 577 582) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point L577-5(lines 577 582) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point merge_pairEXIT(lines 573 583) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L446 ceAbstractionStarter]: At program point merge_single_nodeENTRY(lines 564 572) the Hoare annotation is: true [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point merge_single_nodeFINAL(lines 564 572) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point merge_single_nodeEXIT(lines 564 572) no Hoare annotation was computed. [2019-10-13 20:12:38,980 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2019-10-13 20:12:38,981 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2019-10-13 20:12:38,981 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2019-10-13 20:12:38,981 INFO L446 ceAbstractionStarter]: At program point seq_sort_coreENTRY(lines 584 601) the Hoare annotation is: true [2019-10-13 20:12:38,981 INFO L443 ceAbstractionStarter]: For program point seq_sort_coreFINAL(lines 584 601) no Hoare annotation was computed. [2019-10-13 20:12:38,981 INFO L446 ceAbstractionStarter]: At program point L594(line 594) the Hoare annotation is: true [2019-10-13 20:12:38,981 INFO L443 ceAbstractionStarter]: For program point L594-1(line 594) no Hoare annotation was computed. [2019-10-13 20:12:38,981 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L446 ceAbstractionStarter]: At program point L587-2(lines 587 599) the Hoare annotation is: true [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point L587-3(lines 587 599) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point seq_sort_coreEXIT(lines 584 601) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point L613-4(lines 603 615) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point L605(lines 605 610) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point L605-2(lines 605 610) no Hoare annotation was computed. [2019-10-13 20:12:38,982 INFO L443 ceAbstractionStarter]: For program point L605-3(lines 603 615) no Hoare annotation was computed. [2019-10-13 20:12:38,983 INFO L446 ceAbstractionStarter]: At program point inspect_beforeENTRY(lines 602 615) the Hoare annotation is: true [2019-10-13 20:12:38,983 INFO L443 ceAbstractionStarter]: For program point L614(line 614) no Hoare annotation was computed. [2019-10-13 20:12:38,983 INFO L446 ceAbstractionStarter]: At program point L614-1(line 614) the Hoare annotation is: true [2019-10-13 20:12:38,983 INFO L443 ceAbstractionStarter]: For program point L614-3(line 614) no Hoare annotation was computed. [2019-10-13 20:12:38,983 INFO L443 ceAbstractionStarter]: For program point L614-4(lines 603 615) no Hoare annotation was computed. [2019-10-13 20:12:38,983 INFO L443 ceAbstractionStarter]: For program point L614-5(lines 602 615) no Hoare annotation was computed. [2019-10-13 20:12:38,983 INFO L446 ceAbstractionStarter]: At program point L606-1(line 606) the Hoare annotation is: true [2019-10-13 20:12:38,984 INFO L443 ceAbstractionStarter]: For program point L606-3(line 606) no Hoare annotation was computed. [2019-10-13 20:12:38,984 INFO L446 ceAbstractionStarter]: At program point L606-4(line 606) the Hoare annotation is: true [2019-10-13 20:12:38,984 INFO L443 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2019-10-13 20:12:38,984 INFO L446 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: true [2019-10-13 20:12:38,984 INFO L443 ceAbstractionStarter]: For program point L607-3(line 607) no Hoare annotation was computed. [2019-10-13 20:12:38,984 INFO L443 ceAbstractionStarter]: For program point L607-4(lines 605 610) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L446 ceAbstractionStarter]: At program point L608-1(line 608) the Hoare annotation is: true [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L608-3(line 608) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L608-4(lines 605 610) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L446 ceAbstractionStarter]: At program point L609-1(line 609) the Hoare annotation is: true [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L609-3(line 609) no Hoare annotation was computed. [2019-10-13 20:12:38,985 INFO L443 ceAbstractionStarter]: For program point L609-4(lines 605 610) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point inspect_beforeEXIT(lines 602 615) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L446 ceAbstractionStarter]: At program point L611(line 611) the Hoare annotation is: true [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point L611-2(line 611) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point L611-3(lines 603 615) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L446 ceAbstractionStarter]: At program point L612-1(line 612) the Hoare annotation is: true [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point L612-3(line 612) no Hoare annotation was computed. [2019-10-13 20:12:38,986 INFO L443 ceAbstractionStarter]: For program point L612-4(lines 603 615) no Hoare annotation was computed. [2019-10-13 20:12:38,987 INFO L446 ceAbstractionStarter]: At program point L604-1(line 604) the Hoare annotation is: true [2019-10-13 20:12:38,987 INFO L443 ceAbstractionStarter]: For program point L604-3(line 604) no Hoare annotation was computed. [2019-10-13 20:12:38,987 INFO L446 ceAbstractionStarter]: At program point L604-4(line 604) the Hoare annotation is: true [2019-10-13 20:12:38,987 INFO L443 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2019-10-13 20:12:38,987 INFO L446 ceAbstractionStarter]: At program point L613-1(line 613) the Hoare annotation is: true [2019-10-13 20:12:38,987 INFO L443 ceAbstractionStarter]: For program point L613-3(line 613) no Hoare annotation was computed. [2019-10-13 20:12:38,987 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2019-10-13 20:12:38,988 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2019-10-13 20:12:38,988 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2019-10-13 20:12:38,988 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:38,988 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:38,988 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:38,988 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:38,988 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 625 655) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 631) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L443 ceAbstractionStarter]: For program point L630-2(lines 630 631) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L439 ceAbstractionStarter]: At program point L643(line 643) the Hoare annotation is: false [2019-10-13 20:12:38,989 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 636) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L443 ceAbstractionStarter]: For program point L635-2(lines 635 636) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 645) no Hoare annotation was computed. [2019-10-13 20:12:38,989 INFO L439 ceAbstractionStarter]: At program point L644-2(lines 643 645) the Hoare annotation is: false [2019-10-13 20:12:38,989 INFO L439 ceAbstractionStarter]: At program point L644-3(lines 644 645) the Hoare annotation is: false [2019-10-13 20:12:38,990 INFO L443 ceAbstractionStarter]: For program point L628-1(lines 628 640) no Hoare annotation was computed. [2019-10-13 20:12:38,990 INFO L439 ceAbstractionStarter]: At program point L628-3(lines 628 640) the Hoare annotation is: (and (= main_~data~0.base 0) (= 0 main_~data~0.offset)) [2019-10-13 20:12:38,990 INFO L443 ceAbstractionStarter]: For program point L628-4(lines 626 655) no Hoare annotation was computed. [2019-10-13 20:12:38,990 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 625 655) no Hoare annotation was computed. [2019-10-13 20:12:38,990 INFO L446 ceAbstractionStarter]: At program point L649-2(lines 649 653) the Hoare annotation is: true [2019-10-13 20:12:38,990 INFO L443 ceAbstractionStarter]: For program point L649-3(lines 649 653) no Hoare annotation was computed. [2019-10-13 20:12:38,991 INFO L439 ceAbstractionStarter]: At program point L645(line 645) the Hoare annotation is: false [2019-10-13 20:12:38,991 INFO L443 ceAbstractionStarter]: For program point L645-1(line 645) no Hoare annotation was computed. [2019-10-13 20:12:38,991 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 625 655) the Hoare annotation is: true [2019-10-13 20:12:38,991 INFO L443 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2019-10-13 20:12:38,991 INFO L443 ceAbstractionStarter]: For program point inspect_afterEXIT(lines 616 624) no Hoare annotation was computed. [2019-10-13 20:12:38,991 INFO L446 ceAbstractionStarter]: At program point inspect_afterENTRY(lines 616 624) the Hoare annotation is: true [2019-10-13 20:12:38,991 INFO L443 ceAbstractionStarter]: For program point L622-1(line 622) no Hoare annotation was computed. [2019-10-13 20:12:38,991 INFO L443 ceAbstractionStarter]: For program point L622-3(line 622) no Hoare annotation was computed. [2019-10-13 20:12:38,992 INFO L446 ceAbstractionStarter]: At program point L622-4(line 622) the Hoare annotation is: true [2019-10-13 20:12:38,992 INFO L446 ceAbstractionStarter]: At program point L618-1(line 618) the Hoare annotation is: true [2019-10-13 20:12:38,992 INFO L443 ceAbstractionStarter]: For program point L618-3(line 618) no Hoare annotation was computed. [2019-10-13 20:12:38,992 INFO L446 ceAbstractionStarter]: At program point L618-4(line 618) the Hoare annotation is: true [2019-10-13 20:12:38,992 INFO L443 ceAbstractionStarter]: For program point L623(line 623) no Hoare annotation was computed. [2019-10-13 20:12:38,992 INFO L446 ceAbstractionStarter]: At program point L623-1(line 623) the Hoare annotation is: true [2019-10-13 20:12:38,992 INFO L443 ceAbstractionStarter]: For program point L623-3(line 623) no Hoare annotation was computed. [2019-10-13 20:12:38,992 INFO L443 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2019-10-13 20:12:38,992 INFO L443 ceAbstractionStarter]: For program point L623-4(lines 617 624) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L446 ceAbstractionStarter]: At program point L619-1(line 619) the Hoare annotation is: true [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L623-5(lines 616 624) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L619-3(line 619) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L619-4(lines 617 624) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L446 ceAbstractionStarter]: At program point L620-1(line 620) the Hoare annotation is: true [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L620-3(line 620) no Hoare annotation was computed. [2019-10-13 20:12:38,993 INFO L443 ceAbstractionStarter]: For program point L620-4(lines 617 624) no Hoare annotation was computed. [2019-10-13 20:12:38,994 INFO L443 ceAbstractionStarter]: For program point L620-5(line 620) no Hoare annotation was computed. [2019-10-13 20:12:39,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:39 BoogieIcfgContainer [2019-10-13 20:12:39,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:39,011 INFO L168 Benchmark]: Toolchain (without parser) took 7313.12 ms. Allocated memory was 138.9 MB in the beginning and 284.7 MB in the end (delta: 145.8 MB). Free memory was 102.0 MB in the beginning and 242.6 MB in the end (delta: -140.6 MB). Peak memory consumption was 159.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,012 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.11 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 167.3 MB in the end (delta: -65.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,015 INFO L168 Benchmark]: Boogie Preprocessor took 97.92 ms. Allocated memory is still 203.4 MB. Free memory was 167.3 MB in the beginning and 164.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,015 INFO L168 Benchmark]: RCFGBuilder took 937.92 ms. Allocated memory is still 203.4 MB. Free memory was 163.4 MB in the beginning and 95.6 MB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,016 INFO L168 Benchmark]: TraceAbstraction took 5593.59 ms. Allocated memory was 203.4 MB in the beginning and 284.7 MB in the end (delta: 81.3 MB). Free memory was 95.6 MB in the beginning and 242.6 MB in the end (delta: -147.0 MB). Peak memory consumption was 88.9 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:39,022 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 679.11 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 167.3 MB in the end (delta: -65.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.92 ms. Allocated memory is still 203.4 MB. Free memory was 167.3 MB in the beginning and 164.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 937.92 ms. Allocated memory is still 203.4 MB. Free memory was 163.4 MB in the beginning and 95.6 MB in the end (delta: 67.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5593.59 ms. Allocated memory was 203.4 MB in the beginning and 284.7 MB in the end (delta: 81.3 MB). Free memory was 95.6 MB in the beginning and 242.6 MB in the end (delta: -147.0 MB). Peak memory consumption was 88.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: 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: 618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: data == 0 && 0 == data - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 121 locations, 1 error locations. Result: SAFE, OverallTime: 5.5s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1236 SDtfs, 640 SDslu, 3547 SDs, 0 SdLazy, 1232 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 135 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 147 PreInvPairs, 149 NumberOfFragments, 44 HoareAnnotationTreeSize, 147 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 424 ConstructedInterpolants, 18 QuantifiedInterpolants, 116388 SizeOfPredicates, 16 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 20/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 140, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9750830564784053, AVG_VARS_REMOVED_DURING_WEAKENING: 0.8372093023255814, AVG_WEAKENED_CONJUNCTS: 0.6046511627906976, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...