/usr/bin/java -ea -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 -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:04:37,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:04:37,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:04:37,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:04:37,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:04:37,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:04:37,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:04:37,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:04:37,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:04:37,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:04:37,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:04:37,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:04:37,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:04:37,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:04:37,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:04:37,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:04:37,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:04:37,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:04:37,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:04:37,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:04:37,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:04:37,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:04:37,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:04:37,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:04:37,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:04:37,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:04:37,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:04:37,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:04:37,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:04:37,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:04:37,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:04:37,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:04:37,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:04:37,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:04:37,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:04:37,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:04:37,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:04:37,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:04:37,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:04:37,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:04:37,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:04:37,079 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 [2020-07-10 15:04:37,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:04:37,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:04:37,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:04:37,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:04:37,095 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:04:37,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:04:37,096 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:04:37,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:04:37,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:04:37,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:04:37,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:04:37,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:04:37,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:04:37,097 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:04:37,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:04:37,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:04:37,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:04:37,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:04:37,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:04:37,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:04:37,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:04:37,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:04:37,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:04:37,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:04:37,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:04:37,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:04:37,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:04:37,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:04:37,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:04:37,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:04:37,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:04:37,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:04:37,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:04:37,416 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:04:37,417 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:04:37,417 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2020-07-10 15:04:37,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b5a9fc4/c9b538d4107c412a9217307faf01b9e1/FLAGab73e934b [2020-07-10 15:04:38,014 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:04:38,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2020-07-10 15:04:38,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b5a9fc4/c9b538d4107c412a9217307faf01b9e1/FLAGab73e934b [2020-07-10 15:04:38,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63b5a9fc4/c9b538d4107c412a9217307faf01b9e1 [2020-07-10 15:04:38,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:04:38,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:04:38,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:38,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:04:38,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:04:38,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:38" (1/1) ... [2020-07-10 15:04:38,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a903c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:38, skipping insertion in model container [2020-07-10 15:04:38,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:04:38" (1/1) ... [2020-07-10 15:04:38,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:04:38,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:04:38,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:38,976 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:04:39,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:04:39,117 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:04:39,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39 WrapperNode [2020-07-10 15:04:39,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:04:39,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:04:39,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:04:39,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:04:39,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (1/1) ... [2020-07-10 15:04:39,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:04:39,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:04:39,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:04:39,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:04:39,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (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 [2020-07-10 15:04:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:04:39,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2020-07-10 15:04:39,308 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2020-07-10 15:04:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:04:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:04:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:04:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:04:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:04:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:04:39,311 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:04:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:04:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:04:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:04:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:04:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:04:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:04:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:04:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:04:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:04:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:04:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:04:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:04:39,324 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2020-07-10 15:04:39,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2020-07-10 15:04:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:04:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:04:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:04:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:04:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:04:40,259 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:04:40,260 INFO L295 CfgBuilder]: Removed 33 assume(true) statements. [2020-07-10 15:04:40,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:40 BoogieIcfgContainer [2020-07-10 15:04:40,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:04:40,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:04:40,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:04:40,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:04:40,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:04:38" (1/3) ... [2020-07-10 15:04:40,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5754227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:40, skipping insertion in model container [2020-07-10 15:04:40,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:04:39" (2/3) ... [2020-07-10 15:04:40,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5754227b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:04:40, skipping insertion in model container [2020-07-10 15:04:40,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:04:40" (3/3) ... [2020-07-10 15:04:40,273 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2020-07-10 15:04:40,284 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:04:40,292 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:04:40,307 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:04:40,331 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:04:40,331 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:04:40,331 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:04:40,332 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:04:40,332 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:04:40,332 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:04:40,332 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:04:40,333 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:04:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2020-07-10 15:04:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:04:40,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:40,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:40,362 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1873878464, now seen corresponding path program 1 times [2020-07-10 15:04:40,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:40,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037640311] [2020-07-10 15:04:40,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:40,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {118#true} is VALID [2020-07-10 15:04:40,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-10 15:04:40,563 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #433#return; {118#true} is VALID [2020-07-10 15:04:40,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:40,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {118#true} is VALID [2020-07-10 15:04:40,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-10 15:04:40,568 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #433#return; {118#true} is VALID [2020-07-10 15:04:40,568 INFO L263 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret44 := main(); {118#true} is VALID [2020-07-10 15:04:40,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {118#true} ~data~0.base, ~data~0.offset := 0, 0; {118#true} is VALID [2020-07-10 15:04:40,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#true} assume !true; {119#false} is VALID [2020-07-10 15:04:40,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {119#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {119#false} is VALID [2020-07-10 15:04:40,570 INFO L263 TraceCheckUtils]: 8: Hoare triple {119#false} call inspect_before(~data~0.base, ~data~0.offset); {119#false} is VALID [2020-07-10 15:04:40,570 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {119#false} is VALID [2020-07-10 15:04:40,571 INFO L280 TraceCheckUtils]: 10: Hoare triple {119#false} assume ~shape.base == 0 && ~shape.offset == 0; {119#false} is VALID [2020-07-10 15:04:40,571 INFO L263 TraceCheckUtils]: 11: Hoare triple {119#false} call fail(); {119#false} is VALID [2020-07-10 15:04:40,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-10 15:04:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:40,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037640311] [2020-07-10 15:04:40,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:40,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:40,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731159906] [2020-07-10 15:04:40,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:04:40,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:40,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:40,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:40,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:40,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:40,625 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2020-07-10 15:04:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:41,329 INFO L93 Difference]: Finished difference Result 240 states and 408 transitions. [2020-07-10 15:04:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:41,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:04:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2020-07-10 15:04:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2020-07-10 15:04:41,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 408 transitions. [2020-07-10 15:04:41,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:41,936 INFO L225 Difference]: With dead ends: 240 [2020-07-10 15:04:41,936 INFO L226 Difference]: Without dead ends: 118 [2020-07-10 15:04:41,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-10 15:04:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2020-07-10 15:04:42,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:42,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 103 states. [2020-07-10 15:04:42,040 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 103 states. [2020-07-10 15:04:42,041 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 103 states. [2020-07-10 15:04:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:42,054 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-07-10 15:04:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2020-07-10 15:04:42,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:42,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:42,078 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 118 states. [2020-07-10 15:04:42,078 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 118 states. [2020-07-10 15:04:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:42,088 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-07-10 15:04:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2020-07-10 15:04:42,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:42,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:42,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:42,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-10 15:04:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2020-07-10 15:04:42,101 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2020-07-10 15:04:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:42,101 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2020-07-10 15:04:42,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-10 15:04:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:04:42,102 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:42,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:42,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:04:42,103 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1323314826, now seen corresponding path program 1 times [2020-07-10 15:04:42,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:42,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858977197] [2020-07-10 15:04:42,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:42,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {827#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-10 15:04:42,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 15:04:42,212 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #433#return; {821#true} is VALID [2020-07-10 15:04:42,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {827#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:42,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-10 15:04:42,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-10 15:04:42,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #433#return; {821#true} is VALID [2020-07-10 15:04:42,214 INFO L263 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret44 := main(); {821#true} is VALID [2020-07-10 15:04:42,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} ~data~0.base, ~data~0.offset := 0, 0; {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:42,216 INFO L280 TraceCheckUtils]: 6: Hoare triple {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:42,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(0 != #t~nondet36);havoc #t~nondet36; {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:42,217 INFO L280 TraceCheckUtils]: 8: Hoare triple {826#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {822#false} is VALID [2020-07-10 15:04:42,217 INFO L263 TraceCheckUtils]: 9: Hoare triple {822#false} call inspect_before(~data~0.base, ~data~0.offset); {822#false} is VALID [2020-07-10 15:04:42,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {822#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {822#false} is VALID [2020-07-10 15:04:42,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {822#false} assume ~shape.base == 0 && ~shape.offset == 0; {822#false} is VALID [2020-07-10 15:04:42,218 INFO L263 TraceCheckUtils]: 12: Hoare triple {822#false} call fail(); {822#false} is VALID [2020-07-10 15:04:42,219 INFO L280 TraceCheckUtils]: 13: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-10 15:04:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:42,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858977197] [2020-07-10 15:04:42,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:42,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:04:42,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791657371] [2020-07-10 15:04:42,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:04:42,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:42,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:04:42,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:42,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:04:42,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:04:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:04:42,252 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 4 states. [2020-07-10 15:04:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:42,993 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2020-07-10 15:04:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:04:42,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:04:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:04:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2020-07-10 15:04:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:04:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2020-07-10 15:04:43,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 255 transitions. [2020-07-10 15:04:43,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:43,341 INFO L225 Difference]: With dead ends: 206 [2020-07-10 15:04:43,342 INFO L226 Difference]: Without dead ends: 115 [2020-07-10 15:04:43,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:04:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-10 15:04:43,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2020-07-10 15:04:43,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:43,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 105 states. [2020-07-10 15:04:43,415 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 105 states. [2020-07-10 15:04:43,415 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 105 states. [2020-07-10 15:04:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:43,424 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2020-07-10 15:04:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2020-07-10 15:04:43,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:43,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:43,432 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 115 states. [2020-07-10 15:04:43,432 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 115 states. [2020-07-10 15:04:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:43,438 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2020-07-10 15:04:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2020-07-10 15:04:43,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:43,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:43,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:43,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-10 15:04:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2020-07-10 15:04:43,444 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2020-07-10 15:04:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:43,444 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2020-07-10 15:04:43,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:04:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-10 15:04:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:43,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:43,445 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:43,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:04:43,446 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1684995551, now seen corresponding path program 1 times [2020-07-10 15:04:43,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:43,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802787150] [2020-07-10 15:04:43,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:43,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1492#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1483#true} is VALID [2020-07-10 15:04:43,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-10 15:04:43,587 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1483#true} {1483#true} #433#return; {1483#true} is VALID [2020-07-10 15:04:43,590 INFO L263 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1492#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:43,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {1492#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1483#true} is VALID [2020-07-10 15:04:43,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-10 15:04:43,591 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #433#return; {1483#true} is VALID [2020-07-10 15:04:43,591 INFO L263 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret44 := main(); {1483#true} is VALID [2020-07-10 15:04:43,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {1483#true} ~data~0.base, ~data~0.offset := 0, 0; {1483#true} is VALID [2020-07-10 15:04:43,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {1483#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1483#true} is VALID [2020-07-10 15:04:43,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {1483#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {1483#true} is VALID [2020-07-10 15:04:43,592 INFO L280 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1483#true} is VALID [2020-07-10 15:04:43,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {1483#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {1488#(not (= 0 main_~item~0.base))} is VALID [2020-07-10 15:04:43,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {1488#(not (= 0 main_~item~0.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {1488#(not (= 0 main_~item~0.base))} is VALID [2020-07-10 15:04:43,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {1488#(not (= 0 main_~item~0.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {1489#(not (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:43,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {1489#(not (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1489#(not (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:43,597 INFO L280 TraceCheckUtils]: 13: Hoare triple {1489#(not (= 0 main_~data~0.base))} assume !(0 != #t~nondet36);havoc #t~nondet36; {1489#(not (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:43,601 INFO L280 TraceCheckUtils]: 14: Hoare triple {1489#(not (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {1489#(not (= 0 main_~data~0.base))} is VALID [2020-07-10 15:04:43,602 INFO L263 TraceCheckUtils]: 15: Hoare triple {1489#(not (= 0 main_~data~0.base))} call inspect_before(~data~0.base, ~data~0.offset); {1490#(not (= 0 |inspect_before_#in~shape.base|))} is VALID [2020-07-10 15:04:43,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {1490#(not (= 0 |inspect_before_#in~shape.base|))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {1491#(not (= 0 inspect_before_~shape.base))} is VALID [2020-07-10 15:04:43,603 INFO L280 TraceCheckUtils]: 17: Hoare triple {1491#(not (= 0 inspect_before_~shape.base))} assume ~shape.base == 0 && ~shape.offset == 0; {1484#false} is VALID [2020-07-10 15:04:43,604 INFO L263 TraceCheckUtils]: 18: Hoare triple {1484#false} call fail(); {1484#false} is VALID [2020-07-10 15:04:43,604 INFO L280 TraceCheckUtils]: 19: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2020-07-10 15:04:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:43,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802787150] [2020-07-10 15:04:43,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:43,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:04:43,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156927157] [2020-07-10 15:04:43,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 15:04:43,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:43,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:04:43,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:43,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:04:43,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:04:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:04:43,633 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 7 states. [2020-07-10 15:04:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:45,144 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2020-07-10 15:04:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:04:45,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 15:04:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:04:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2020-07-10 15:04:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:04:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2020-07-10 15:04:45,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 194 transitions. [2020-07-10 15:04:45,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:45,452 INFO L225 Difference]: With dead ends: 157 [2020-07-10 15:04:45,452 INFO L226 Difference]: Without dead ends: 152 [2020-07-10 15:04:45,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:04:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-10 15:04:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2020-07-10 15:04:45,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:45,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 108 states. [2020-07-10 15:04:45,518 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 108 states. [2020-07-10 15:04:45,518 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 108 states. [2020-07-10 15:04:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:45,524 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2020-07-10 15:04:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2020-07-10 15:04:45,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:45,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:45,526 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 152 states. [2020-07-10 15:04:45,526 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 152 states. [2020-07-10 15:04:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:45,533 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2020-07-10 15:04:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2020-07-10 15:04:45,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:45,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:45,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:45,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-10 15:04:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2020-07-10 15:04:45,538 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2020-07-10 15:04:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:45,539 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2020-07-10 15:04:45,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:04:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2020-07-10 15:04:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:45,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:45,540 INFO L422 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] [2020-07-10 15:04:45,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:04:45,540 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1145945773, now seen corresponding path program 1 times [2020-07-10 15:04:45,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:45,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287752276] [2020-07-10 15:04:45,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:45,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {2170#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2162#true} is VALID [2020-07-10 15:04:45,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {2162#true} assume true; {2162#true} is VALID [2020-07-10 15:04:45,690 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2162#true} {2162#true} #433#return; {2162#true} is VALID [2020-07-10 15:04:45,691 INFO L263 TraceCheckUtils]: 0: Hoare triple {2162#true} call ULTIMATE.init(); {2170#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:45,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {2170#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2162#true} is VALID [2020-07-10 15:04:45,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2020-07-10 15:04:45,692 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #433#return; {2162#true} is VALID [2020-07-10 15:04:45,692 INFO L263 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret44 := main(); {2162#true} is VALID [2020-07-10 15:04:45,692 INFO L280 TraceCheckUtils]: 5: Hoare triple {2162#true} ~data~0.base, ~data~0.offset := 0, 0; {2162#true} is VALID [2020-07-10 15:04:45,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {2162#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2162#true} is VALID [2020-07-10 15:04:45,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {2162#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2162#true} is VALID [2020-07-10 15:04:45,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {2162#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2162#true} is VALID [2020-07-10 15:04:45,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {2162#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2162#true} is VALID [2020-07-10 15:04:45,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {2162#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2162#true} is VALID [2020-07-10 15:04:45,694 INFO L280 TraceCheckUtils]: 11: Hoare triple {2162#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2162#true} is VALID [2020-07-10 15:04:45,694 INFO L280 TraceCheckUtils]: 12: Hoare triple {2162#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2162#true} is VALID [2020-07-10 15:04:45,694 INFO L280 TraceCheckUtils]: 13: Hoare triple {2162#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2162#true} is VALID [2020-07-10 15:04:45,694 INFO L280 TraceCheckUtils]: 14: Hoare triple {2162#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2162#true} is VALID [2020-07-10 15:04:45,695 INFO L263 TraceCheckUtils]: 15: Hoare triple {2162#true} call inspect_before(~data~0.base, ~data~0.offset); {2162#true} is VALID [2020-07-10 15:04:45,695 INFO L280 TraceCheckUtils]: 16: Hoare triple {2162#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2162#true} is VALID [2020-07-10 15:04:45,695 INFO L280 TraceCheckUtils]: 17: Hoare triple {2162#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2162#true} is VALID [2020-07-10 15:04:45,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {2162#true} goto; {2162#true} is VALID [2020-07-10 15:04:45,696 INFO L280 TraceCheckUtils]: 19: Hoare triple {2162#true} call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2167#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-10 15:04:45,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {2167#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-10 15:04:45,698 INFO L280 TraceCheckUtils]: 21: Hoare triple {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-10 15:04:45,699 INFO L280 TraceCheckUtils]: 22: Hoare triple {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} goto; {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-10 15:04:45,700 INFO L280 TraceCheckUtils]: 23: Hoare triple {2168#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2169#(and (= 0 |inspect_before_#t~mem26.base|) (= 0 |inspect_before_#t~mem26.offset|))} is VALID [2020-07-10 15:04:45,701 INFO L280 TraceCheckUtils]: 24: Hoare triple {2169#(and (= 0 |inspect_before_#t~mem26.base|) (= 0 |inspect_before_#t~mem26.offset|))} assume !(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {2163#false} is VALID [2020-07-10 15:04:45,701 INFO L263 TraceCheckUtils]: 25: Hoare triple {2163#false} call fail(); {2163#false} is VALID [2020-07-10 15:04:45,701 INFO L280 TraceCheckUtils]: 26: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2020-07-10 15:04:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:04:45,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287752276] [2020-07-10 15:04:45,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:45,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:45,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066567125] [2020-07-10 15:04:45,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:04:45,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:45,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:45,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:45,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:45,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:45,735 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2020-07-10 15:04:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:46,979 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2020-07-10 15:04:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:04:46,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:04:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-10 15:04:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-10 15:04:46,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 136 transitions. [2020-07-10 15:04:47,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:47,176 INFO L225 Difference]: With dead ends: 116 [2020-07-10 15:04:47,176 INFO L226 Difference]: Without dead ends: 113 [2020-07-10 15:04:47,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:04:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-10 15:04:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2020-07-10 15:04:47,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:47,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 107 states. [2020-07-10 15:04:47,255 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 107 states. [2020-07-10 15:04:47,255 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 107 states. [2020-07-10 15:04:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:47,261 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2020-07-10 15:04:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2020-07-10 15:04:47,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:47,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:47,262 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 113 states. [2020-07-10 15:04:47,262 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 113 states. [2020-07-10 15:04:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:47,271 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2020-07-10 15:04:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2020-07-10 15:04:47,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:47,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:47,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:47,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-10 15:04:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2020-07-10 15:04:47,279 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2020-07-10 15:04:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:47,279 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2020-07-10 15:04:47,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:04:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2020-07-10 15:04:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:47,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:47,281 INFO L422 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] [2020-07-10 15:04:47,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:04:47,281 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1471361763, now seen corresponding path program 1 times [2020-07-10 15:04:47,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:47,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245646354] [2020-07-10 15:04:47,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:47,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {2714#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2706#true} is VALID [2020-07-10 15:04:47,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {2706#true} assume true; {2706#true} is VALID [2020-07-10 15:04:47,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2706#true} {2706#true} #433#return; {2706#true} is VALID [2020-07-10 15:04:47,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {2706#true} call ULTIMATE.init(); {2714#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:47,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {2714#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2706#true} is VALID [2020-07-10 15:04:47,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {2706#true} assume true; {2706#true} is VALID [2020-07-10 15:04:47,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2706#true} {2706#true} #433#return; {2706#true} is VALID [2020-07-10 15:04:47,402 INFO L263 TraceCheckUtils]: 4: Hoare triple {2706#true} call #t~ret44 := main(); {2706#true} is VALID [2020-07-10 15:04:47,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {2706#true} ~data~0.base, ~data~0.offset := 0, 0; {2706#true} is VALID [2020-07-10 15:04:47,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {2706#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2706#true} is VALID [2020-07-10 15:04:47,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {2706#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2706#true} is VALID [2020-07-10 15:04:47,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {2706#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2706#true} is VALID [2020-07-10 15:04:47,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {2706#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2706#true} is VALID [2020-07-10 15:04:47,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {2706#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2706#true} is VALID [2020-07-10 15:04:47,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {2706#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2706#true} is VALID [2020-07-10 15:04:47,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {2706#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2706#true} is VALID [2020-07-10 15:04:47,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {2706#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2706#true} is VALID [2020-07-10 15:04:47,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {2706#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2706#true} is VALID [2020-07-10 15:04:47,405 INFO L263 TraceCheckUtils]: 15: Hoare triple {2706#true} call inspect_before(~data~0.base, ~data~0.offset); {2706#true} is VALID [2020-07-10 15:04:47,405 INFO L280 TraceCheckUtils]: 16: Hoare triple {2706#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2706#true} is VALID [2020-07-10 15:04:47,406 INFO L280 TraceCheckUtils]: 17: Hoare triple {2706#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2706#true} is VALID [2020-07-10 15:04:47,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {2706#true} goto; {2706#true} is VALID [2020-07-10 15:04:47,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {2706#true} call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2711#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-10 15:04:47,409 INFO L280 TraceCheckUtils]: 20: Hoare triple {2711#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-10 15:04:47,412 INFO L280 TraceCheckUtils]: 21: Hoare triple {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-10 15:04:47,413 INFO L280 TraceCheckUtils]: 22: Hoare triple {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} goto; {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-10 15:04:47,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {2712#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {2713#(or (not (= 0 |inspect_before_#t~mem21.base|)) (not (= 0 |inspect_before_#t~mem21.offset|)))} is VALID [2020-07-10 15:04:47,415 INFO L280 TraceCheckUtils]: 24: Hoare triple {2713#(or (not (= 0 |inspect_before_#t~mem21.base|)) (not (= 0 |inspect_before_#t~mem21.offset|)))} assume #t~mem21.base == 0 && #t~mem21.offset == 0;havoc #t~mem21.base, #t~mem21.offset; {2707#false} is VALID [2020-07-10 15:04:47,415 INFO L263 TraceCheckUtils]: 25: Hoare triple {2707#false} call fail(); {2707#false} is VALID [2020-07-10 15:04:47,415 INFO L280 TraceCheckUtils]: 26: Hoare triple {2707#false} assume !false; {2707#false} is VALID [2020-07-10 15:04:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:04:47,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245646354] [2020-07-10 15:04:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:04:47,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191065706] [2020-07-10 15:04:47,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:04:47,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:47,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:04:47,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:47,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:04:47,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:04:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:04:47,449 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2020-07-10 15:04:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:48,679 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2020-07-10 15:04:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:04:48,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:04:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2020-07-10 15:04:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:04:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2020-07-10 15:04:48,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 134 transitions. [2020-07-10 15:04:48,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:48,874 INFO L225 Difference]: With dead ends: 115 [2020-07-10 15:04:48,874 INFO L226 Difference]: Without dead ends: 112 [2020-07-10 15:04:48,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:04:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-10 15:04:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-10 15:04:48,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:48,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 106 states. [2020-07-10 15:04:48,934 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 106 states. [2020-07-10 15:04:48,934 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 106 states. [2020-07-10 15:04:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:48,938 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2020-07-10 15:04:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-07-10 15:04:48,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:48,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:48,939 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 112 states. [2020-07-10 15:04:48,939 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 112 states. [2020-07-10 15:04:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:48,943 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2020-07-10 15:04:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-07-10 15:04:48,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:48,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:48,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:48,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-10 15:04:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2020-07-10 15:04:48,949 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2020-07-10 15:04:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:48,949 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2020-07-10 15:04:48,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:04:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2020-07-10 15:04:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:04:48,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:48,950 INFO L422 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] [2020-07-10 15:04:48,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:04:48,951 INFO L427 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1648323131, now seen corresponding path program 1 times [2020-07-10 15:04:48,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:48,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568394510] [2020-07-10 15:04:48,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:49,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {3254#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3244#true} is VALID [2020-07-10 15:04:49,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {3244#true} assume true; {3244#true} is VALID [2020-07-10 15:04:49,085 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3244#true} {3244#true} #433#return; {3244#true} is VALID [2020-07-10 15:04:49,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3254#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:49,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {3254#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3244#true} is VALID [2020-07-10 15:04:49,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2020-07-10 15:04:49,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #433#return; {3244#true} is VALID [2020-07-10 15:04:49,087 INFO L263 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret44 := main(); {3244#true} is VALID [2020-07-10 15:04:49,087 INFO L280 TraceCheckUtils]: 5: Hoare triple {3244#true} ~data~0.base, ~data~0.offset := 0, 0; {3244#true} is VALID [2020-07-10 15:04:49,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {3244#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3244#true} is VALID [2020-07-10 15:04:49,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {3244#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3249#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:49,098 INFO L280 TraceCheckUtils]: 8: Hoare triple {3249#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3249#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:49,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {3249#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3249#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:49,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {3249#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3249#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:49,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {3249#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:49,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:49,103 INFO L280 TraceCheckUtils]: 13: Hoare triple {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36);havoc #t~nondet36; {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:49,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:49,105 INFO L263 TraceCheckUtils]: 15: Hoare triple {3250#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3251#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2020-07-10 15:04:49,105 INFO L280 TraceCheckUtils]: 16: Hoare triple {3251#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,106 INFO L280 TraceCheckUtils]: 17: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,106 INFO L280 TraceCheckUtils]: 18: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,107 INFO L280 TraceCheckUtils]: 19: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,107 INFO L280 TraceCheckUtils]: 20: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:49,112 INFO L280 TraceCheckUtils]: 26: Hoare triple {3252#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); {3253#(not (= 0 |inspect_before_#t~mem27.base|))} is VALID [2020-07-10 15:04:49,114 INFO L280 TraceCheckUtils]: 27: Hoare triple {3253#(not (= 0 |inspect_before_#t~mem27.base|))} assume #t~mem27.base == 0 && #t~mem27.offset == 0;havoc #t~mem27.base, #t~mem27.offset; {3245#false} is VALID [2020-07-10 15:04:49,115 INFO L263 TraceCheckUtils]: 28: Hoare triple {3245#false} call fail(); {3245#false} is VALID [2020-07-10 15:04:49,115 INFO L280 TraceCheckUtils]: 29: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2020-07-10 15:04:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:49,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568394510] [2020-07-10 15:04:49,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:49,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:04:49,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982512489] [2020-07-10 15:04:49,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:04:49,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:49,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:04:49,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:49,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:04:49,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:04:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:04:49,171 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 8 states. [2020-07-10 15:04:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:51,025 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2020-07-10 15:04:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:04:51,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:04:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:04:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2020-07-10 15:04:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:04:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2020-07-10 15:04:51,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 177 transitions. [2020-07-10 15:04:51,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:51,299 INFO L225 Difference]: With dead ends: 147 [2020-07-10 15:04:51,299 INFO L226 Difference]: Without dead ends: 144 [2020-07-10 15:04:51,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:04:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-10 15:04:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2020-07-10 15:04:51,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:51,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 112 states. [2020-07-10 15:04:51,382 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 112 states. [2020-07-10 15:04:51,382 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 112 states. [2020-07-10 15:04:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:51,387 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2020-07-10 15:04:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2020-07-10 15:04:51,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:51,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:51,388 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 144 states. [2020-07-10 15:04:51,389 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 144 states. [2020-07-10 15:04:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:51,394 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2020-07-10 15:04:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2020-07-10 15:04:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:51,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:51,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-10 15:04:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-07-10 15:04:51,400 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2020-07-10 15:04:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:51,400 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-07-10 15:04:51,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:04:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2020-07-10 15:04:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:04:51,401 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:51,401 INFO L422 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] [2020-07-10 15:04:51,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:04:51,402 INFO L427 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 861386650, now seen corresponding path program 1 times [2020-07-10 15:04:51,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:51,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094429698] [2020-07-10 15:04:51,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:51,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {3905#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3895#true} is VALID [2020-07-10 15:04:51,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {3895#true} assume true; {3895#true} is VALID [2020-07-10 15:04:51,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3895#true} {3895#true} #433#return; {3895#true} is VALID [2020-07-10 15:04:51,531 INFO L263 TraceCheckUtils]: 0: Hoare triple {3895#true} call ULTIMATE.init(); {3905#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:04:51,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {3905#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3895#true} is VALID [2020-07-10 15:04:51,532 INFO L280 TraceCheckUtils]: 2: Hoare triple {3895#true} assume true; {3895#true} is VALID [2020-07-10 15:04:51,532 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3895#true} {3895#true} #433#return; {3895#true} is VALID [2020-07-10 15:04:51,532 INFO L263 TraceCheckUtils]: 4: Hoare triple {3895#true} call #t~ret44 := main(); {3895#true} is VALID [2020-07-10 15:04:51,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {3895#true} ~data~0.base, ~data~0.offset := 0, 0; {3895#true} is VALID [2020-07-10 15:04:51,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {3895#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3895#true} is VALID [2020-07-10 15:04:51,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {3895#true} assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3900#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:51,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {3900#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3900#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:51,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {3900#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3900#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:51,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {3900#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3900#(not (= 0 main_~node~1.base))} is VALID [2020-07-10 15:04:51,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {3900#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:51,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:51,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36);havoc #t~nondet36; {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:51,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-10 15:04:51,538 INFO L263 TraceCheckUtils]: 15: Hoare triple {3901#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3902#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2020-07-10 15:04:51,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {3902#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,540 INFO L280 TraceCheckUtils]: 19: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,541 INFO L280 TraceCheckUtils]: 22: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,542 INFO L280 TraceCheckUtils]: 23: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,543 INFO L280 TraceCheckUtils]: 24: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(#t~mem21.base == 0 && #t~mem21.offset == 0);havoc #t~mem21.base, #t~mem21.offset; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-10 15:04:51,546 INFO L280 TraceCheckUtils]: 26: Hoare triple {3903#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); {3904#(not (= 0 |inspect_before_#t~mem22.base|))} is VALID [2020-07-10 15:04:51,547 INFO L280 TraceCheckUtils]: 27: Hoare triple {3904#(not (= 0 |inspect_before_#t~mem22.base|))} assume #t~mem22.base == 0 && #t~mem22.offset == 0;havoc #t~mem22.base, #t~mem22.offset; {3896#false} is VALID [2020-07-10 15:04:51,547 INFO L263 TraceCheckUtils]: 28: Hoare triple {3896#false} call fail(); {3896#false} is VALID [2020-07-10 15:04:51,547 INFO L280 TraceCheckUtils]: 29: Hoare triple {3896#false} assume !false; {3896#false} is VALID [2020-07-10 15:04:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:51,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094429698] [2020-07-10 15:04:51,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:51,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:04:51,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101145867] [2020-07-10 15:04:51,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:04:51,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:51,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:04:51,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:51,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:04:51,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:04:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:04:51,586 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 8 states. [2020-07-10 15:04:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:53,400 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2020-07-10 15:04:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:04:53,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-10 15:04:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:04:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-10 15:04:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:04:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-10 15:04:53,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 175 transitions. [2020-07-10 15:04:53,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:53,663 INFO L225 Difference]: With dead ends: 146 [2020-07-10 15:04:53,663 INFO L226 Difference]: Without dead ends: 143 [2020-07-10 15:04:53,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:04:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-10 15:04:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2020-07-10 15:04:53,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:53,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 118 states. [2020-07-10 15:04:53,753 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 118 states. [2020-07-10 15:04:53,753 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 118 states. [2020-07-10 15:04:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:53,759 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2020-07-10 15:04:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2020-07-10 15:04:53,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:53,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:53,760 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 143 states. [2020-07-10 15:04:53,761 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 143 states. [2020-07-10 15:04:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:53,766 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2020-07-10 15:04:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2020-07-10 15:04:53,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:53,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:53,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:53,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-07-10 15:04:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2020-07-10 15:04:53,772 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2020-07-10 15:04:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:53,772 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2020-07-10 15:04:53,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:04:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-10 15:04:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:04:53,773 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:53,773 INFO L422 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] [2020-07-10 15:04:53,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:04:53,774 INFO L427 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash 671486784, now seen corresponding path program 1 times [2020-07-10 15:04:53,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:53,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260046658] [2020-07-10 15:04:53,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:04:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:04:53,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:04:53,850 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:04:53,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:04:53,884 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: merge_pairENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: merge_single_nodeENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: seq_sort_coreENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:04:53,885 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: inspect_beforeENTRY has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: inspect_afterENTRY has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: failFINAL has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: merge_single_nodeFINAL has no Hoare annotation [2020-07-10 15:04:53,886 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-10 15:04:53,887 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,888 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: L577-5 has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-10 15:04:53,889 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-10 15:04:53,890 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L619-4 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L619-4 has no Hoare annotation [2020-07-10 15:04:53,891 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2020-07-10 15:04:53,892 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2020-07-10 15:04:53,893 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: merge_pairFINAL has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: seq_sort_coreFINAL has no Hoare annotation [2020-07-10 15:04:53,894 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-10 15:04:53,895 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L620-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L620-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-10 15:04:53,896 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L608-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L608-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L605-2 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L612-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L612-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L613-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L613-4 has no Hoare annotation [2020-07-10 15:04:53,897 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L623-4 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L623-4 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: merge_pairEXIT has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:04:53,898 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: seq_sort_coreEXIT has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-10 15:04:53,899 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:04:53,900 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: inspect_beforeEXIT has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-10 15:04:53,901 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: inspect_afterEXIT has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-10 15:04:53,902 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-10 15:04:53,903 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-10 15:04:53,904 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-10 15:04:53,905 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2020-07-10 15:04:53,906 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2020-07-10 15:04:53,906 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-10 15:04:53,906 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-10 15:04:53,906 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-10 15:04:53,906 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2020-07-10 15:04:53,906 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:04:53,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:04:53 BoogieIcfgContainer [2020-07-10 15:04:53,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:04:53,913 INFO L168 Benchmark]: Toolchain (without parser) took 15577.94 ms. Allocated memory was 144.7 MB in the beginning and 387.4 MB in the end (delta: 242.7 MB). Free memory was 100.1 MB in the beginning and 95.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 247.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,913 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.76 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 164.1 MB in the end (delta: -64.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,915 INFO L168 Benchmark]: Boogie Preprocessor took 117.23 ms. Allocated memory is still 202.9 MB. Free memory was 164.1 MB in the beginning and 159.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,916 INFO L168 Benchmark]: RCFGBuilder took 1028.73 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 159.4 MB in the beginning and 175.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,916 INFO L168 Benchmark]: TraceAbstraction took 13643.50 ms. Allocated memory was 234.9 MB in the beginning and 387.4 MB in the end (delta: 152.6 MB). Free memory was 175.8 MB in the beginning and 95.1 MB in the end (delta: 80.6 MB). Peak memory consumption was 233.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:53,919 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.76 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.9 MB in the beginning and 164.1 MB in the end (delta: -64.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.23 ms. Allocated memory is still 202.9 MB. Free memory was 164.1 MB in the beginning and 159.4 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1028.73 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 159.4 MB in the beginning and 175.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13643.50 ms. Allocated memory was 234.9 MB in the beginning and 387.4 MB in the end (delta: 152.6 MB). Free memory was 175.8 MB in the beginning and 95.1 MB in the end (delta: 80.6 MB). Peak memory consumption was 233.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 793 SDtfs, 921 SDslu, 888 SDs, 0 SdLazy, 1951 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 138 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 17008 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...