/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-267fbe0 [2020-07-17 22:26:56,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:56,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:56,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:56,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:56,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:56,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:57,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:57,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:57,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:57,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:57,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:57,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:57,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:57,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:57,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:57,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:57,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:57,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:57,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:57,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:57,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:57,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:57,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:57,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:57,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:57,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:57,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:57,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:57,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:57,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:57,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:57,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:57,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:57,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:57,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:57,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:57,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:57,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:57,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:57,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:57,064 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-17 22:26:57,099 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:57,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:57,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:57,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:57,104 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:57,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:57,106 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:57,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:57,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:57,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:57,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:57,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:57,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:57,108 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:57,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:57,108 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:57,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:57,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:57,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:57,109 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:57,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:57,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:57,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:57,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:57,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:57,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:57,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:57,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:57,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:57,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:57,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:57,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:57,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:57,429 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:57,430 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:57,431 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-17 22:26:57,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfd19118/d73ee612242b413ea7966b254d5d11fb/FLAG48fd212ca [2020-07-17 22:26:58,061 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:58,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2020-07-17 22:26:58,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfd19118/d73ee612242b413ea7966b254d5d11fb/FLAG48fd212ca [2020-07-17 22:26:58,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfd19118/d73ee612242b413ea7966b254d5d11fb [2020-07-17 22:26:58,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:58,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:58,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:58,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:58,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:58,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:58" (1/1) ... [2020-07-17 22:26:58,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eedc7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:58, skipping insertion in model container [2020-07-17 22:26:58,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:58" (1/1) ... [2020-07-17 22:26:58,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:58,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:58,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:58,944 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:59,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:59,088 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:59,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59 WrapperNode [2020-07-17 22:26:59,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:59,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:59,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:59,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:59,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (1/1) ... [2020-07-17 22:26:59,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:59,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:59,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:59,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:59,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (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-17 22:26:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:59,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2020-07-17 22:26:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:26:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:26:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:26:59,297 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:26:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:26:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:26:59,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:26:59,301 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:26:59,302 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:26:59,303 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:26:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:26:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:26:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:26:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:26:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:26:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-17 22:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:26:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:27:00,307 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:27:00,307 INFO L295 CfgBuilder]: Removed 33 assume(true) statements. [2020-07-17 22:27:00,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:00 BoogieIcfgContainer [2020-07-17 22:27:00,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:27:00,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:27:00,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:27:00,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:27:00,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:58" (1/3) ... [2020-07-17 22:27:00,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e39e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:00, skipping insertion in model container [2020-07-17 22:27:00,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:59" (2/3) ... [2020-07-17 22:27:00,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e39e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:27:00, skipping insertion in model container [2020-07-17 22:27:00,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:27:00" (3/3) ... [2020-07-17 22:27:00,321 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2020-07-17 22:27:00,331 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:27:00,339 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:27:00,354 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:27:00,378 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:27:00,378 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:27:00,378 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:27:00,379 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:27:00,379 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:27:00,379 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:27:00,379 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:27:00,379 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:27:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2020-07-17 22:27:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:27:00,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:00,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:00,410 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1873878464, now seen corresponding path program 1 times [2020-07-17 22:27:00,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:00,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364733125] [2020-07-17 22:27:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:00,618 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-17 22:27:00,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:27:00,619 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #433#return; {118#true} is VALID [2020-07-17 22:27:00,625 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-17 22:27:00,625 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-17 22:27:00,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:27:00,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #433#return; {118#true} is VALID [2020-07-17 22:27:00,626 INFO L263 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret44 := main(); {118#true} is VALID [2020-07-17 22:27:00,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {118#true} ~data~0.base, ~data~0.offset := 0, 0; {118#true} is VALID [2020-07-17 22:27:00,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#true} assume !true; {119#false} is VALID [2020-07-17 22:27:00,628 INFO L280 TraceCheckUtils]: 7: Hoare triple {119#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {119#false} is VALID [2020-07-17 22:27:00,628 INFO L263 TraceCheckUtils]: 8: Hoare triple {119#false} call inspect_before(~data~0.base, ~data~0.offset); {119#false} is VALID [2020-07-17 22:27:00,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {119#false} is VALID [2020-07-17 22:27:00,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {119#false} assume ~shape.base == 0 && ~shape.offset == 0; {119#false} is VALID [2020-07-17 22:27:00,629 INFO L263 TraceCheckUtils]: 11: Hoare triple {119#false} call fail(); {119#false} is VALID [2020-07-17 22:27:00,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-17 22:27:00,631 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-17 22:27:00,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364733125] [2020-07-17 22:27:00,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:00,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:00,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601451324] [2020-07-17 22:27:00,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:27:00,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:00,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:00,670 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-17 22:27:00,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:00,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:00,683 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2020-07-17 22:27:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:01,363 INFO L93 Difference]: Finished difference Result 240 states and 408 transitions. [2020-07-17 22:27:01,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:01,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:27:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2020-07-17 22:27:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2020-07-17 22:27:01,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 408 transitions. [2020-07-17 22:27:01,962 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-17 22:27:01,995 INFO L225 Difference]: With dead ends: 240 [2020-07-17 22:27:01,996 INFO L226 Difference]: Without dead ends: 118 [2020-07-17 22:27:02,008 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-17 22:27:02,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-17 22:27:02,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2020-07-17 22:27:02,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:02,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 103 states. [2020-07-17 22:27:02,107 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 103 states. [2020-07-17 22:27:02,107 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 103 states. [2020-07-17 22:27:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:02,119 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-07-17 22:27:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2020-07-17 22:27:02,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:02,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:02,123 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 118 states. [2020-07-17 22:27:02,123 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 118 states. [2020-07-17 22:27:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:02,133 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-07-17 22:27:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2020-07-17 22:27:02,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:02,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:02,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:02,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-17 22:27:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2020-07-17 22:27:02,165 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2020-07-17 22:27:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:02,165 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2020-07-17 22:27:02,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2020-07-17 22:27:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:27:02,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:02,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:02,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:27:02,170 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:02,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1323314826, now seen corresponding path program 1 times [2020-07-17 22:27:02,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:02,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181848962] [2020-07-17 22:27:02,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:02,270 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-17 22:27:02,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-17 22:27:02,271 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #433#return; {821#true} is VALID [2020-07-17 22:27:02,272 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-17 22:27:02,273 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-17 22:27:02,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-17 22:27:02,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #433#return; {821#true} is VALID [2020-07-17 22:27:02,274 INFO L263 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret44 := main(); {821#true} is VALID [2020-07-17 22:27:02,274 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-17 22:27:02,275 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-17 22:27:02,276 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-17 22:27:02,277 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-17 22:27:02,277 INFO L263 TraceCheckUtils]: 9: Hoare triple {822#false} call inspect_before(~data~0.base, ~data~0.offset); {822#false} is VALID [2020-07-17 22:27:02,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {822#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {822#false} is VALID [2020-07-17 22:27:02,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {822#false} assume ~shape.base == 0 && ~shape.offset == 0; {822#false} is VALID [2020-07-17 22:27:02,278 INFO L263 TraceCheckUtils]: 12: Hoare triple {822#false} call fail(); {822#false} is VALID [2020-07-17 22:27:02,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-17 22:27:02,279 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-17 22:27:02,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181848962] [2020-07-17 22:27:02,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:02,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:27:02,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199188926] [2020-07-17 22:27:02,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:27:02,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:02,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:27:02,295 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-17 22:27:02,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:27:02,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:27:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:27:02,297 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 4 states. [2020-07-17 22:27:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:03,014 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2020-07-17 22:27:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:27:03,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:27:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:27:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2020-07-17 22:27:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:27:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2020-07-17 22:27:03,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 255 transitions. [2020-07-17 22:27:03,369 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-17 22:27:03,375 INFO L225 Difference]: With dead ends: 206 [2020-07-17 22:27:03,376 INFO L226 Difference]: Without dead ends: 115 [2020-07-17 22:27:03,378 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-17 22:27:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-17 22:27:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2020-07-17 22:27:03,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:03,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 105 states. [2020-07-17 22:27:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 105 states. [2020-07-17 22:27:03,428 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 105 states. [2020-07-17 22:27:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:03,434 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2020-07-17 22:27:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2020-07-17 22:27:03,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:03,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:03,437 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 115 states. [2020-07-17 22:27:03,437 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 115 states. [2020-07-17 22:27:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:03,443 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2020-07-17 22:27:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2020-07-17 22:27:03,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:03,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:03,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:03,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 22:27:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2020-07-17 22:27:03,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2020-07-17 22:27:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:03,451 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2020-07-17 22:27:03,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:27:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2020-07-17 22:27:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:27:03,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:03,452 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-17 22:27:03,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:27:03,453 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1684995551, now seen corresponding path program 1 times [2020-07-17 22:27:03,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:03,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429975356] [2020-07-17 22:27:03,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:03,627 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-17 22:27:03,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-17 22:27:03,627 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1483#true} {1483#true} #433#return; {1483#true} is VALID [2020-07-17 22:27:03,629 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-17 22:27:03,629 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-17 22:27:03,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2020-07-17 22:27:03,630 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #433#return; {1483#true} is VALID [2020-07-17 22:27:03,630 INFO L263 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret44 := main(); {1483#true} is VALID [2020-07-17 22:27:03,630 INFO L280 TraceCheckUtils]: 5: Hoare triple {1483#true} ~data~0.base, ~data~0.offset := 0, 0; {1483#true} is VALID [2020-07-17 22:27:03,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {1483#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1483#true} is VALID [2020-07-17 22:27:03,631 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-17 22:27:03,631 INFO L280 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1483#true} is VALID [2020-07-17 22:27:03,633 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-17 22:27:03,634 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-17 22:27:03,636 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-17 22:27:03,637 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-17 22:27:03,637 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-17 22:27:03,638 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-17 22:27:03,639 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-17 22:27:03,640 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-17 22:27:03,641 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-17 22:27:03,641 INFO L263 TraceCheckUtils]: 18: Hoare triple {1484#false} call fail(); {1484#false} is VALID [2020-07-17 22:27:03,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2020-07-17 22:27:03,643 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-17 22:27:03,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429975356] [2020-07-17 22:27:03,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:03,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:27:03,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915509647] [2020-07-17 22:27:03,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:27:03,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:03,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:27:03,667 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-17 22:27:03,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:27:03,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:27:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:27:03,668 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 7 states. [2020-07-17 22:27:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:05,236 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2020-07-17 22:27:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:27:05,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:27:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:27:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2020-07-17 22:27:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:27:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2020-07-17 22:27:05,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 194 transitions. [2020-07-17 22:27:05,542 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-17 22:27:05,547 INFO L225 Difference]: With dead ends: 157 [2020-07-17 22:27:05,547 INFO L226 Difference]: Without dead ends: 152 [2020-07-17 22:27:05,548 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-17 22:27:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-17 22:27:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2020-07-17 22:27:05,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:05,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 108 states. [2020-07-17 22:27:05,636 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 108 states. [2020-07-17 22:27:05,636 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 108 states. [2020-07-17 22:27:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:05,646 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2020-07-17 22:27:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2020-07-17 22:27:05,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:05,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:05,650 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 152 states. [2020-07-17 22:27:05,650 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 152 states. [2020-07-17 22:27:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:05,667 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2020-07-17 22:27:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2020-07-17 22:27:05,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:05,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:05,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:05,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-17 22:27:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2020-07-17 22:27:05,677 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2020-07-17 22:27:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:05,678 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2020-07-17 22:27:05,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:27:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2020-07-17 22:27:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:27:05,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:05,679 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-17 22:27:05,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:27:05,679 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:05,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1145945773, now seen corresponding path program 1 times [2020-07-17 22:27:05,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:05,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000091491] [2020-07-17 22:27:05,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:05,830 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-17 22:27:05,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {2162#true} assume true; {2162#true} is VALID [2020-07-17 22:27:05,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2162#true} {2162#true} #433#return; {2162#true} is VALID [2020-07-17 22:27:05,832 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-17 22:27:05,832 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-17 22:27:05,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {2162#true} assume true; {2162#true} is VALID [2020-07-17 22:27:05,833 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2162#true} {2162#true} #433#return; {2162#true} is VALID [2020-07-17 22:27:05,833 INFO L263 TraceCheckUtils]: 4: Hoare triple {2162#true} call #t~ret44 := main(); {2162#true} is VALID [2020-07-17 22:27:05,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {2162#true} ~data~0.base, ~data~0.offset := 0, 0; {2162#true} is VALID [2020-07-17 22:27:05,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {2162#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2162#true} is VALID [2020-07-17 22:27:05,834 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-17 22:27:05,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {2162#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2162#true} is VALID [2020-07-17 22:27:05,834 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-17 22:27:05,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {2162#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2162#true} is VALID [2020-07-17 22:27:05,835 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-17 22:27:05,835 INFO L280 TraceCheckUtils]: 12: Hoare triple {2162#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2162#true} is VALID [2020-07-17 22:27:05,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {2162#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2162#true} is VALID [2020-07-17 22:27:05,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {2162#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2162#true} is VALID [2020-07-17 22:27:05,836 INFO L263 TraceCheckUtils]: 15: Hoare triple {2162#true} call inspect_before(~data~0.base, ~data~0.offset); {2162#true} is VALID [2020-07-17 22:27:05,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {2162#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2162#true} is VALID [2020-07-17 22:27:05,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {2162#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2162#true} is VALID [2020-07-17 22:27:05,837 INFO L280 TraceCheckUtils]: 18: Hoare triple {2162#true} goto; {2162#true} is VALID [2020-07-17 22:27:05,838 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-17 22:27:05,839 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-17 22:27:05,840 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-17 22:27:05,841 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-17 22:27:05,842 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-17 22:27:05,843 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-17 22:27:05,843 INFO L263 TraceCheckUtils]: 25: Hoare triple {2163#false} call fail(); {2163#false} is VALID [2020-07-17 22:27:05,843 INFO L280 TraceCheckUtils]: 26: Hoare triple {2163#false} assume !false; {2163#false} is VALID [2020-07-17 22:27:05,845 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-17 22:27:05,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000091491] [2020-07-17 22:27:05,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:05,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:27:05,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981632437] [2020-07-17 22:27:05,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:27:05,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:05,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:27:05,875 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-17 22:27:05,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:27:05,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:27:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:27:05,876 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2020-07-17 22:27:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:07,145 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2020-07-17 22:27:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:27:07,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:27:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-17 22:27:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-17 22:27:07,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 136 transitions. [2020-07-17 22:27:07,352 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-17 22:27:07,355 INFO L225 Difference]: With dead ends: 116 [2020-07-17 22:27:07,355 INFO L226 Difference]: Without dead ends: 113 [2020-07-17 22:27:07,356 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-17 22:27:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-17 22:27:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2020-07-17 22:27:07,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:07,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 107 states. [2020-07-17 22:27:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 107 states. [2020-07-17 22:27:07,428 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 107 states. [2020-07-17 22:27:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:07,434 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2020-07-17 22:27:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2020-07-17 22:27:07,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:07,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:07,435 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 113 states. [2020-07-17 22:27:07,435 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 113 states. [2020-07-17 22:27:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:07,440 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2020-07-17 22:27:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2020-07-17 22:27:07,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:07,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:07,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:07,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-17 22:27:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2020-07-17 22:27:07,446 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2020-07-17 22:27:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:07,446 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2020-07-17 22:27:07,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:27:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2020-07-17 22:27:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:27:07,447 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:07,447 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-17 22:27:07,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:27:07,448 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1471361763, now seen corresponding path program 1 times [2020-07-17 22:27:07,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:07,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521866986] [2020-07-17 22:27:07,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:07,556 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-17 22:27:07,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {2706#true} assume true; {2706#true} is VALID [2020-07-17 22:27:07,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2706#true} {2706#true} #433#return; {2706#true} is VALID [2020-07-17 22:27:07,558 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-17 22:27:07,558 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-17 22:27:07,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {2706#true} assume true; {2706#true} is VALID [2020-07-17 22:27:07,559 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2706#true} {2706#true} #433#return; {2706#true} is VALID [2020-07-17 22:27:07,559 INFO L263 TraceCheckUtils]: 4: Hoare triple {2706#true} call #t~ret44 := main(); {2706#true} is VALID [2020-07-17 22:27:07,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {2706#true} ~data~0.base, ~data~0.offset := 0, 0; {2706#true} is VALID [2020-07-17 22:27:07,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {2706#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2706#true} is VALID [2020-07-17 22:27:07,560 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-17 22:27:07,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {2706#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2706#true} is VALID [2020-07-17 22:27:07,561 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-17 22:27:07,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {2706#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2706#true} is VALID [2020-07-17 22:27:07,561 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-17 22:27:07,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {2706#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2706#true} is VALID [2020-07-17 22:27:07,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {2706#true} assume !(0 != #t~nondet36);havoc #t~nondet36; {2706#true} is VALID [2020-07-17 22:27:07,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {2706#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2706#true} is VALID [2020-07-17 22:27:07,562 INFO L263 TraceCheckUtils]: 15: Hoare triple {2706#true} call inspect_before(~data~0.base, ~data~0.offset); {2706#true} is VALID [2020-07-17 22:27:07,562 INFO L280 TraceCheckUtils]: 16: Hoare triple {2706#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2706#true} is VALID [2020-07-17 22:27:07,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {2706#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2706#true} is VALID [2020-07-17 22:27:07,563 INFO L280 TraceCheckUtils]: 18: Hoare triple {2706#true} goto; {2706#true} is VALID [2020-07-17 22:27:07,564 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-17 22:27:07,565 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-17 22:27:07,567 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-17 22:27:07,567 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-17 22:27:07,568 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-17 22:27:07,568 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-17 22:27:07,569 INFO L263 TraceCheckUtils]: 25: Hoare triple {2707#false} call fail(); {2707#false} is VALID [2020-07-17 22:27:07,569 INFO L280 TraceCheckUtils]: 26: Hoare triple {2707#false} assume !false; {2707#false} is VALID [2020-07-17 22:27:07,571 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-17 22:27:07,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521866986] [2020-07-17 22:27:07,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:07,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:27:07,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491039260] [2020-07-17 22:27:07,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:27:07,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:07,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:27:07,605 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-17 22:27:07,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:27:07,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:27:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:27:07,607 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2020-07-17 22:27:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:08,843 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2020-07-17 22:27:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:27:08,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:27:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2020-07-17 22:27:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:27:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2020-07-17 22:27:08,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 134 transitions. [2020-07-17 22:27:09,026 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-17 22:27:09,030 INFO L225 Difference]: With dead ends: 115 [2020-07-17 22:27:09,030 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 22:27:09,031 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-17 22:27:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 22:27:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-17 22:27:09,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:09,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 106 states. [2020-07-17 22:27:09,097 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 106 states. [2020-07-17 22:27:09,097 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 106 states. [2020-07-17 22:27:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:09,101 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2020-07-17 22:27:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-07-17 22:27:09,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:09,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:09,102 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 112 states. [2020-07-17 22:27:09,103 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 112 states. [2020-07-17 22:27:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:09,107 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2020-07-17 22:27:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2020-07-17 22:27:09,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:09,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:09,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:09,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 22:27:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2020-07-17 22:27:09,113 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2020-07-17 22:27:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:09,114 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2020-07-17 22:27:09,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:27:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2020-07-17 22:27:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:27:09,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:09,115 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-17 22:27:09,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:27:09,115 INFO L427 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1648323131, now seen corresponding path program 1 times [2020-07-17 22:27:09,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:09,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120446953] [2020-07-17 22:27:09,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:09,258 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-17 22:27:09,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {3244#true} assume true; {3244#true} is VALID [2020-07-17 22:27:09,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3244#true} {3244#true} #433#return; {3244#true} is VALID [2020-07-17 22:27:09,260 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-17 22:27:09,261 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-17 22:27:09,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2020-07-17 22:27:09,261 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #433#return; {3244#true} is VALID [2020-07-17 22:27:09,262 INFO L263 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret44 := main(); {3244#true} is VALID [2020-07-17 22:27:09,262 INFO L280 TraceCheckUtils]: 5: Hoare triple {3244#true} ~data~0.base, ~data~0.offset := 0, 0; {3244#true} is VALID [2020-07-17 22:27:09,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {3244#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3244#true} is VALID [2020-07-17 22:27:09,272 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-17 22:27:09,272 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-17 22:27:09,273 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-17 22:27:09,274 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-17 22:27:09,277 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-17 22:27:09,282 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-17 22:27:09,283 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-17 22:27:09,283 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-17 22:27:09,284 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-17 22:27:09,284 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-17 22:27:09,285 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-17 22:27:09,285 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-17 22:27:09,286 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-17 22:27:09,286 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-17 22:27:09,287 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-17 22:27:09,287 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-17 22:27:09,290 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-17 22:27:09,291 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-17 22:27:09,293 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-17 22:27:09,295 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-17 22:27:09,296 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-17 22:27:09,296 INFO L263 TraceCheckUtils]: 28: Hoare triple {3245#false} call fail(); {3245#false} is VALID [2020-07-17 22:27:09,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2020-07-17 22:27:09,299 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-17 22:27:09,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120446953] [2020-07-17 22:27:09,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:09,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:27:09,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632019273] [2020-07-17 22:27:09,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-17 22:27:09,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:09,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:27:09,343 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-17 22:27:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:27:09,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:27:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:09,345 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 8 states. [2020-07-17 22:27:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:11,224 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2020-07-17 22:27:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:27:11,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-17 22:27:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:27:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2020-07-17 22:27:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:27:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2020-07-17 22:27:11,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 177 transitions. [2020-07-17 22:27:11,499 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-17 22:27:11,503 INFO L225 Difference]: With dead ends: 147 [2020-07-17 22:27:11,503 INFO L226 Difference]: Without dead ends: 144 [2020-07-17 22:27:11,504 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-17 22:27:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-17 22:27:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2020-07-17 22:27:11,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:11,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 112 states. [2020-07-17 22:27:11,579 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 112 states. [2020-07-17 22:27:11,580 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 112 states. [2020-07-17 22:27:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:11,585 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2020-07-17 22:27:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2020-07-17 22:27:11,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:11,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:11,586 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 144 states. [2020-07-17 22:27:11,586 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 144 states. [2020-07-17 22:27:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:11,592 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2020-07-17 22:27:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2020-07-17 22:27:11,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:11,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:11,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:11,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-17 22:27:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2020-07-17 22:27:11,597 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2020-07-17 22:27:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:11,598 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2020-07-17 22:27:11,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:27:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2020-07-17 22:27:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:27:11,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:11,599 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-17 22:27:11,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:27:11,599 INFO L427 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 861386650, now seen corresponding path program 1 times [2020-07-17 22:27:11,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:11,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070585960] [2020-07-17 22:27:11,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:11,715 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-17 22:27:11,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {3895#true} assume true; {3895#true} is VALID [2020-07-17 22:27:11,715 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3895#true} {3895#true} #433#return; {3895#true} is VALID [2020-07-17 22:27:11,717 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-17 22:27:11,717 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-17 22:27:11,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {3895#true} assume true; {3895#true} is VALID [2020-07-17 22:27:11,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3895#true} {3895#true} #433#return; {3895#true} is VALID [2020-07-17 22:27:11,718 INFO L263 TraceCheckUtils]: 4: Hoare triple {3895#true} call #t~ret44 := main(); {3895#true} is VALID [2020-07-17 22:27:11,718 INFO L280 TraceCheckUtils]: 5: Hoare triple {3895#true} ~data~0.base, ~data~0.offset := 0, 0; {3895#true} is VALID [2020-07-17 22:27:11,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {3895#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3895#true} is VALID [2020-07-17 22:27:11,720 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-17 22:27:11,723 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-17 22:27:11,724 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-17 22:27:11,725 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-17 22:27:11,726 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-17 22:27:11,727 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-17 22:27:11,727 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-17 22:27:11,728 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-17 22:27:11,729 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-17 22:27:11,730 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-17 22:27:11,730 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-17 22:27:11,731 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-17 22:27:11,732 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-17 22:27:11,732 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-17 22:27:11,733 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-17 22:27:11,733 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-17 22:27:11,734 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-17 22:27:11,736 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-17 22:27:11,736 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-17 22:27:11,737 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-17 22:27:11,738 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-17 22:27:11,738 INFO L263 TraceCheckUtils]: 28: Hoare triple {3896#false} call fail(); {3896#false} is VALID [2020-07-17 22:27:11,738 INFO L280 TraceCheckUtils]: 29: Hoare triple {3896#false} assume !false; {3896#false} is VALID [2020-07-17 22:27:11,740 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-17 22:27:11,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070585960] [2020-07-17 22:27:11,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:11,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-17 22:27:11,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551723290] [2020-07-17 22:27:11,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-17 22:27:11,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:11,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:27:11,772 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-17 22:27:11,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:27:11,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:27:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:27:11,774 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 8 states. [2020-07-17 22:27:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:13,621 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2020-07-17 22:27:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:27:13,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-07-17 22:27:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:27:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-17 22:27:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:27:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2020-07-17 22:27:13,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 175 transitions. [2020-07-17 22:27:13,874 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-17 22:27:13,879 INFO L225 Difference]: With dead ends: 146 [2020-07-17 22:27:13,879 INFO L226 Difference]: Without dead ends: 143 [2020-07-17 22:27:13,880 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-17 22:27:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-17 22:27:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2020-07-17 22:27:13,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:13,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 118 states. [2020-07-17 22:27:13,955 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 118 states. [2020-07-17 22:27:13,955 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 118 states. [2020-07-17 22:27:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:13,961 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2020-07-17 22:27:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2020-07-17 22:27:13,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:13,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:13,962 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 143 states. [2020-07-17 22:27:13,962 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 143 states. [2020-07-17 22:27:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:13,968 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2020-07-17 22:27:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2020-07-17 22:27:13,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:13,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:13,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:13,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-07-17 22:27:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2020-07-17 22:27:13,974 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2020-07-17 22:27:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:13,974 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2020-07-17 22:27:13,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:27:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2020-07-17 22:27:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:27:13,975 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:13,975 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-17 22:27:13,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:27:13,976 INFO L427 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 671486784, now seen corresponding path program 1 times [2020-07-17 22:27:13,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:13,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089134488] [2020-07-17 22:27:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:27:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:27:14,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:27:14,057 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:27:14,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: merge_pairENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: merge_single_nodeENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: seq_sort_coreENTRY has no Hoare annotation [2020-07-17 22:27:14,093 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: inspect_beforeENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: inspect_afterENTRY has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: failFINAL has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-17 22:27:14,094 WARN L170 areAnnotationChecker]: merge_single_nodeFINAL has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-17 22:27:14,095 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,096 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,097 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L577-5 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-17 22:27:14,098 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-17 22:27:14,099 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L619-4 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L619-4 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-17 22:27:14,100 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2020-07-17 22:27:14,101 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: merge_pairFINAL has no Hoare annotation [2020-07-17 22:27:14,102 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: seq_sort_coreFINAL has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-17 22:27:14,103 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L620-4 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L620-4 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2020-07-17 22:27:14,104 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L608-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L608-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L605-2 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L612-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L612-4 has no Hoare annotation [2020-07-17 22:27:14,105 WARN L170 areAnnotationChecker]: L613-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L613-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L623-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: L623-4 has no Hoare annotation [2020-07-17 22:27:14,106 WARN L170 areAnnotationChecker]: merge_pairEXIT has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: seq_sort_coreEXIT has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-17 22:27:14,107 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-17 22:27:14,108 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: inspect_beforeEXIT has no Hoare annotation [2020-07-17 22:27:14,109 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: inspect_afterEXIT has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2020-07-17 22:27:14,110 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-17 22:27:14,111 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-17 22:27:14,112 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-17 22:27:14,113 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-17 22:27:14,114 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2020-07-17 22:27:14,114 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-17 22:27:14,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:27:14 BoogieIcfgContainer [2020-07-17 22:27:14,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:27:14,120 INFO L168 Benchmark]: Toolchain (without parser) took 15758.17 ms. Allocated memory was 145.2 MB in the beginning and 396.4 MB in the end (delta: 251.1 MB). Free memory was 101.7 MB in the beginning and 121.2 MB in the end (delta: -19.5 MB). Peak memory consumption was 231.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,121 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.41 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 165.5 MB in the end (delta: -64.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,123 INFO L168 Benchmark]: Boogie Preprocessor took 136.33 ms. Allocated memory is still 202.9 MB. Free memory was 165.5 MB in the beginning and 160.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,124 INFO L168 Benchmark]: RCFGBuilder took 1080.01 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 160.8 MB in the beginning and 177.9 MB in the end (delta: -17.1 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,124 INFO L168 Benchmark]: TraceAbstraction took 13804.27 ms. Allocated memory was 235.9 MB in the beginning and 396.4 MB in the end (delta: 160.4 MB). Free memory was 177.9 MB in the beginning and 121.2 MB in the end (delta: 56.8 MB). Peak memory consumption was 217.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:27:14,128 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 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.41 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 165.5 MB in the end (delta: -64.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.33 ms. Allocated memory is still 202.9 MB. Free memory was 165.5 MB in the beginning and 160.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1080.01 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 160.8 MB in the beginning and 177.9 MB in the end (delta: -17.1 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13804.27 ms. Allocated memory was 235.9 MB in the beginning and 396.4 MB in the end (delta: 160.4 MB). Free memory was 177.9 MB in the beginning and 121.2 MB in the end (delta: 56.8 MB). Peak memory consumption was 217.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.6s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 11.4s, 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, 3.0s 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.8s 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...