/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/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:33:11,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:33:11,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:33:11,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:33:11,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:33:11,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:33:11,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:33:11,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:33:11,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:33:11,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:33:11,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:33:11,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:33:11,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:33:11,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:33:11,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:33:11,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:33:11,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:33:11,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:33:11,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:33:11,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:33:11,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:33:11,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:33:11,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:33:11,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:33:11,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:33:11,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:33:11,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:33:11,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:33:11,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:33:11,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:33:11,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:33:11,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:33:11,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:33:11,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:33:11,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:33:11,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:33:11,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:33:11,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:33:11,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:33:11,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:33:11,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:33:11,136 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:33:11,156 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:33:11,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:33:11,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:33:11,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:33:11,158 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:33:11,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:33:11,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:33:11,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:33:11,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:33:11,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:33:11,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:33:11,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:33:11,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:33:11,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:33:11,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:33:11,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:33:11,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:33:11,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:33:11,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:33:11,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:33:11,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:33:11,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:33:11,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:33:11,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:33:11,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:33:11,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:33:11,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:33:11,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:33:11,475 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:33:11,475 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:33:11,476 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-07-17 22:33:11,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28715d971/b14d76f0829c4017a9935e16f6d15b63/FLAG05ef8ce97 [2020-07-17 22:33:12,044 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:33:12,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-07-17 22:33:12,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28715d971/b14d76f0829c4017a9935e16f6d15b63/FLAG05ef8ce97 [2020-07-17 22:33:12,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28715d971/b14d76f0829c4017a9935e16f6d15b63 [2020-07-17 22:33:12,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:33:12,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:33:12,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:33:12,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:33:12,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:33:12,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:12,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f4ae1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12, skipping insertion in model container [2020-07-17 22:33:12,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:12,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:33:12,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:33:12,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:33:12,841 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:33:12,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:33:12,967 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:33:12,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12 WrapperNode [2020-07-17 22:33:12,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:33:12,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:33:12,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:33:12,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:33:12,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:12,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (1/1) ... [2020-07-17 22:33:13,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:33:13,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:33:13,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:33:13,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:33:13,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (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:33:13,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-17 22:33:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:33:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:33:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:33:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:33:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:33:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:33:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:33:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:33:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:33:13,132 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:33:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:33:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:33:13,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:33:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:33:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:33:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:33:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:33:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:33:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:33:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:33:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:33:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:33:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:33:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:33:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:33:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:33:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:33:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:33:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:33:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:33:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:33:13,138 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:33:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:33:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:33:13,141 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:33:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:33:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:33:13,142 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:33:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:33:13,143 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:33:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:33:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:33:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:33:13,144 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:33:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:33:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:33:13,145 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:33:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:33:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:33:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:33:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:33:13,146 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:33:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:33:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:33:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:33:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:33:13,147 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:33:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:33:13,148 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:33:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:33:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:33:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:33:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:33:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:33:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:33:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:33:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:33:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 22:33:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-17 22:33:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:33:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:33:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:33:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:33:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:33:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:33:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:33:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:33:13,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:33:13,472 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 22:33:13,785 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:33:13,785 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:33:13,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:33:13 BoogieIcfgContainer [2020-07-17 22:33:13,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:33:13,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:33:13,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:33:13,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:33:13,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:33:12" (1/3) ... [2020-07-17 22:33:13,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c83783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:33:13, skipping insertion in model container [2020-07-17 22:33:13,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:33:12" (2/3) ... [2020-07-17 22:33:13,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c83783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:33:13, skipping insertion in model container [2020-07-17 22:33:13,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:33:13" (3/3) ... [2020-07-17 22:33:13,799 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-07-17 22:33:13,811 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:33:13,820 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:33:13,835 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:33:13,861 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:33:13,861 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:33:13,861 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:33:13,862 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:33:13,863 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:33:13,863 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:33:13,863 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:33:13,863 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:33:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-17 22:33:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:33:13,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:13,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:13,896 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 248267832, now seen corresponding path program 1 times [2020-07-17 22:33:13,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:13,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100334023] [2020-07-17 22:33:13,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:14,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#(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; {43#true} is VALID [2020-07-17 22:33:14,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:33:14,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #123#return; {43#true} is VALID [2020-07-17 22:33:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:14,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {56#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:14,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {57#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {57#(<= |dll_create_#in~len| 0)} assume true; {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,264 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {57#(<= |dll_create_#in~len| 0)} {48#(<= 5 main_~len~0)} #119#return; {44#false} is VALID [2020-07-17 22:33:14,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {54#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:14,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#(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; {43#true} is VALID [2020-07-17 22:33:14,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:33:14,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #123#return; {43#true} is VALID [2020-07-17 22:33:14,267 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret20 := main(); {43#true} is VALID [2020-07-17 22:33:14,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} ~len~0 := 5; {48#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:14,270 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {55#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:14,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {56#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:14,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {57#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {57#(<= |dll_create_#in~len| 0)} assume true; {57#(<= |dll_create_#in~len| 0)} is VALID [2020-07-17 22:33:14,276 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {57#(<= |dll_create_#in~len| 0)} {48#(<= 5 main_~len~0)} #119#return; {44#false} is VALID [2020-07-17 22:33:14,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {44#false} is VALID [2020-07-17 22:33:14,277 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {44#false} is VALID [2020-07-17 22:33:14,277 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {44#false} is VALID [2020-07-17 22:33:14,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume #t~short9; {44#false} is VALID [2020-07-17 22:33:14,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} #t~short11 := #t~short9; {44#false} is VALID [2020-07-17 22:33:14,278 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; {44#false} is VALID [2020-07-17 22:33:14,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {44#false} is VALID [2020-07-17 22:33:14,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-17 22:33:14,282 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:33:14,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100334023] [2020-07-17 22:33:14,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:33:14,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690743068] [2020-07-17 22:33:14,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:33:14,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:14,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:33:14,333 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:33:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:33:14,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:33:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:33:14,347 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 7 states. [2020-07-17 22:33:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:15,039 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2020-07-17 22:33:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:33:15,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:33:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:33:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2020-07-17 22:33:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:33:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2020-07-17 22:33:15,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2020-07-17 22:33:15,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:15,239 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:33:15,239 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:33:15,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:33:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-07-17 22:33:15,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:15,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2020-07-17 22:33:15,304 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2020-07-17 22:33:15,304 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2020-07-17 22:33:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:15,310 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-17 22:33:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-17 22:33:15,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:15,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:15,312 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2020-07-17 22:33:15,312 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2020-07-17 22:33:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:15,318 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-17 22:33:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-17 22:33:15,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:15,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:15,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:15,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:33:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-07-17 22:33:15,325 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2020-07-17 22:33:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:15,326 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-17 22:33:15,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:33:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-17 22:33:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:33:15,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:15,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:15,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:33:15,328 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 215856973, now seen corresponding path program 1 times [2020-07-17 22:33:15,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:15,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675541469] [2020-07-17 22:33:15,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {297#(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; {279#true} is VALID [2020-07-17 22:33:15,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:33:15,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #123#return; {279#true} is VALID [2020-07-17 22:33:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:15,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,511 INFO L280 TraceCheckUtils]: 3: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,512 INFO L280 TraceCheckUtils]: 4: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume #t~nondet3 == ~len;#t~ite4 := 1; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,514 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {280#false} is VALID [2020-07-17 22:33:15,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {280#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {280#false} is VALID [2020-07-17 22:33:15,515 INFO L280 TraceCheckUtils]: 8: Hoare triple {280#false} assume !(~len > 0); {280#false} is VALID [2020-07-17 22:33:15,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {280#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {280#false} is VALID [2020-07-17 22:33:15,516 INFO L280 TraceCheckUtils]: 10: Hoare triple {280#false} assume true; {280#false} is VALID [2020-07-17 22:33:15,516 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {280#false} {284#(<= 5 main_~len~0)} #119#return; {280#false} is VALID [2020-07-17 22:33:15,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {297#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:15,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {297#(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; {279#true} is VALID [2020-07-17 22:33:15,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:33:15,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #123#return; {279#true} is VALID [2020-07-17 22:33:15,519 INFO L263 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret20 := main(); {279#true} is VALID [2020-07-17 22:33:15,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#true} ~len~0 := 5; {284#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:15,522 INFO L263 TraceCheckUtils]: 6: Hoare triple {284#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {298#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:15,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {298#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume #t~nondet3 == ~len;#t~ite4 := 1; {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-17 22:33:15,530 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {280#false} is VALID [2020-07-17 22:33:15,531 INFO L280 TraceCheckUtils]: 14: Hoare triple {280#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {280#false} is VALID [2020-07-17 22:33:15,531 INFO L280 TraceCheckUtils]: 15: Hoare triple {280#false} assume !(~len > 0); {280#false} is VALID [2020-07-17 22:33:15,531 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {280#false} is VALID [2020-07-17 22:33:15,532 INFO L280 TraceCheckUtils]: 17: Hoare triple {280#false} assume true; {280#false} is VALID [2020-07-17 22:33:15,532 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {280#false} {284#(<= 5 main_~len~0)} #119#return; {280#false} is VALID [2020-07-17 22:33:15,532 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {280#false} is VALID [2020-07-17 22:33:15,533 INFO L280 TraceCheckUtils]: 20: Hoare triple {280#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {280#false} is VALID [2020-07-17 22:33:15,533 INFO L280 TraceCheckUtils]: 21: Hoare triple {280#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {280#false} is VALID [2020-07-17 22:33:15,533 INFO L280 TraceCheckUtils]: 22: Hoare triple {280#false} assume #t~short9; {280#false} is VALID [2020-07-17 22:33:15,534 INFO L280 TraceCheckUtils]: 23: Hoare triple {280#false} #t~short11 := #t~short9; {280#false} is VALID [2020-07-17 22:33:15,534 INFO L280 TraceCheckUtils]: 24: Hoare triple {280#false} assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; {280#false} is VALID [2020-07-17 22:33:15,534 INFO L280 TraceCheckUtils]: 25: Hoare triple {280#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {280#false} is VALID [2020-07-17 22:33:15,535 INFO L280 TraceCheckUtils]: 26: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:33:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:15,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675541469] [2020-07-17 22:33:15,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:15,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:33:15,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505090694] [2020-07-17 22:33:15,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:33:15,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:15,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:33:15,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:15,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:33:15,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:15,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:33:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:33:15,579 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 6 states. [2020-07-17 22:33:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,035 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2020-07-17 22:33:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:33:16,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-17 22:33:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:33:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-17 22:33:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:33:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-17 22:33:16,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2020-07-17 22:33:16,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:16,154 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:33:16,154 INFO L226 Difference]: Without dead ends: 39 [2020-07-17 22:33:16,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:33:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-17 22:33:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-17 22:33:16,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:16,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-17 22:33:16,191 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-17 22:33:16,191 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-17 22:33:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,194 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-17 22:33:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-17 22:33:16,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,195 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-17 22:33:16,195 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-17 22:33:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,198 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-17 22:33:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-17 22:33:16,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:16,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:33:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2020-07-17 22:33:16,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 27 [2020-07-17 22:33:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:16,202 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-07-17 22:33:16,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:33:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2020-07-17 22:33:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:33:16,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:16,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:16,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:33:16,204 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:16,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -795260277, now seen corresponding path program 1 times [2020-07-17 22:33:16,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:16,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574102785] [2020-07-17 22:33:16,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {529#(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; {511#true} is VALID [2020-07-17 22:33:16,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#true} assume true; {511#true} is VALID [2020-07-17 22:33:16,274 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {511#true} {511#true} #123#return; {511#true} is VALID [2020-07-17 22:33:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {530#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,352 INFO L280 TraceCheckUtils]: 3: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,354 INFO L280 TraceCheckUtils]: 5: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {532#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:16,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {532#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {533#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {533#(<= |dll_create_#in~len| 1)} assume true; {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,358 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {533#(<= |dll_create_#in~len| 1)} {516#(<= 5 main_~len~0)} #119#return; {512#false} is VALID [2020-07-17 22:33:16,360 INFO L263 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {529#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:16,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {529#(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; {511#true} is VALID [2020-07-17 22:33:16,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#true} assume true; {511#true} is VALID [2020-07-17 22:33:16,361 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {511#true} {511#true} #123#return; {511#true} is VALID [2020-07-17 22:33:16,361 INFO L263 TraceCheckUtils]: 4: Hoare triple {511#true} call #t~ret20 := main(); {511#true} is VALID [2020-07-17 22:33:16,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {511#true} ~len~0 := 5; {516#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:16,366 INFO L263 TraceCheckUtils]: 6: Hoare triple {516#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {530#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:16,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {530#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,370 INFO L280 TraceCheckUtils]: 9: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,371 INFO L280 TraceCheckUtils]: 10: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,371 INFO L280 TraceCheckUtils]: 11: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,372 INFO L280 TraceCheckUtils]: 12: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {531#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:16,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {531#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {532#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:16,375 INFO L280 TraceCheckUtils]: 15: Hoare triple {532#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,375 INFO L280 TraceCheckUtils]: 16: Hoare triple {533#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,376 INFO L280 TraceCheckUtils]: 17: Hoare triple {533#(<= |dll_create_#in~len| 1)} assume true; {533#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:16,377 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {533#(<= |dll_create_#in~len| 1)} {516#(<= 5 main_~len~0)} #119#return; {512#false} is VALID [2020-07-17 22:33:16,378 INFO L280 TraceCheckUtils]: 19: Hoare triple {512#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {512#false} is VALID [2020-07-17 22:33:16,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {512#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {512#false} is VALID [2020-07-17 22:33:16,378 INFO L280 TraceCheckUtils]: 21: Hoare triple {512#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {512#false} is VALID [2020-07-17 22:33:16,379 INFO L280 TraceCheckUtils]: 22: Hoare triple {512#false} assume #t~short9; {512#false} is VALID [2020-07-17 22:33:16,379 INFO L280 TraceCheckUtils]: 23: Hoare triple {512#false} #t~short11 := #t~short9; {512#false} is VALID [2020-07-17 22:33:16,379 INFO L280 TraceCheckUtils]: 24: Hoare triple {512#false} assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; {512#false} is VALID [2020-07-17 22:33:16,379 INFO L280 TraceCheckUtils]: 25: Hoare triple {512#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {512#false} is VALID [2020-07-17 22:33:16,380 INFO L280 TraceCheckUtils]: 26: Hoare triple {512#false} assume !false; {512#false} is VALID [2020-07-17 22:33:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:16,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574102785] [2020-07-17 22:33:16,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386184111] [2020-07-17 22:33:16,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:33:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:16,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:16,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:33:16,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {511#true} is VALID [2020-07-17 22:33:16,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {511#true} is VALID [2020-07-17 22:33:16,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#true} assume true; {511#true} is VALID [2020-07-17 22:33:16,597 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {511#true} {511#true} #123#return; {511#true} is VALID [2020-07-17 22:33:16,597 INFO L263 TraceCheckUtils]: 4: Hoare triple {511#true} call #t~ret20 := main(); {511#true} is VALID [2020-07-17 22:33:16,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {511#true} ~len~0 := 5; {511#true} is VALID [2020-07-17 22:33:16,598 INFO L263 TraceCheckUtils]: 6: Hoare triple {511#true} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {511#true} is VALID [2020-07-17 22:33:16,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {511#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {511#true} is VALID [2020-07-17 22:33:16,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {511#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {511#true} is VALID [2020-07-17 22:33:16,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {511#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {511#true} is VALID [2020-07-17 22:33:16,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {511#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {511#true} is VALID [2020-07-17 22:33:16,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {511#true} assume #t~nondet3 == ~len;#t~ite4 := 1; {511#true} is VALID [2020-07-17 22:33:16,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {511#true} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {511#true} is VALID [2020-07-17 22:33:16,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {511#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {511#true} is VALID [2020-07-17 22:33:16,600 INFO L280 TraceCheckUtils]: 14: Hoare triple {511#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {511#true} is VALID [2020-07-17 22:33:16,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#true} assume !(~len > 0); {511#true} is VALID [2020-07-17 22:33:16,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {511#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {511#true} is VALID [2020-07-17 22:33:16,600 INFO L280 TraceCheckUtils]: 17: Hoare triple {511#true} assume true; {511#true} is VALID [2020-07-17 22:33:16,601 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {511#true} {511#true} #119#return; {511#true} is VALID [2020-07-17 22:33:16,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {511#true} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {511#true} is VALID [2020-07-17 22:33:16,601 INFO L280 TraceCheckUtils]: 20: Hoare triple {511#true} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {511#true} is VALID [2020-07-17 22:33:16,601 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#true} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {511#true} is VALID [2020-07-17 22:33:16,602 INFO L280 TraceCheckUtils]: 22: Hoare triple {511#true} assume #t~short9; {603#|main_#t~short9|} is VALID [2020-07-17 22:33:16,604 INFO L280 TraceCheckUtils]: 23: Hoare triple {603#|main_#t~short9|} #t~short11 := #t~short9; {607#|main_#t~short11|} is VALID [2020-07-17 22:33:16,605 INFO L280 TraceCheckUtils]: 24: Hoare triple {607#|main_#t~short11|} assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; {512#false} is VALID [2020-07-17 22:33:16,605 INFO L280 TraceCheckUtils]: 25: Hoare triple {512#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {512#false} is VALID [2020-07-17 22:33:16,606 INFO L280 TraceCheckUtils]: 26: Hoare triple {512#false} assume !false; {512#false} is VALID [2020-07-17 22:33:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:33:16,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:33:16,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-17 22:33:16,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088116342] [2020-07-17 22:33:16,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:33:16,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:16,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:33:16,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:33:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:33:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:33:16,647 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 4 states. [2020-07-17 22:33:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,810 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2020-07-17 22:33:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:33:16,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:33:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:33:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-17 22:33:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:33:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2020-07-17 22:33:16,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2020-07-17 22:33:16,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:16,894 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:33:16,894 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:33:16,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:33:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-17 22:33:16,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:16,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-17 22:33:16,919 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-17 22:33:16,919 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-17 22:33:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,922 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-17 22:33:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-17 22:33:16,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,923 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-17 22:33:16,923 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-17 22:33:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:16,926 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-17 22:33:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-17 22:33:16,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:16,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:16,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:16,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:33:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2020-07-17 22:33:16,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 27 [2020-07-17 22:33:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:16,930 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-07-17 22:33:16,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:33:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2020-07-17 22:33:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:33:16,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:16,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:17,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:33:17,133 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -795262199, now seen corresponding path program 1 times [2020-07-17 22:33:17,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:17,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276805313] [2020-07-17 22:33:17,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {838#(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; {820#true} is VALID [2020-07-17 22:33:17,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-17 22:33:17,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #123#return; {820#true} is VALID [2020-07-17 22:33:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,299 INFO L280 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,301 INFO L280 TraceCheckUtils]: 3: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:17,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {842#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {842#(<= |dll_create_#in~len| 1)} assume true; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,307 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {842#(<= |dll_create_#in~len| 1)} {825#(<= 5 main_~len~0)} #119#return; {821#false} is VALID [2020-07-17 22:33:17,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {838#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:17,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {838#(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; {820#true} is VALID [2020-07-17 22:33:17,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-17 22:33:17,309 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #123#return; {820#true} is VALID [2020-07-17 22:33:17,310 INFO L263 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret20 := main(); {820#true} is VALID [2020-07-17 22:33:17,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#true} ~len~0 := 5; {825#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:17,312 INFO L263 TraceCheckUtils]: 6: Hoare triple {825#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {839#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:17,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {839#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,313 INFO L280 TraceCheckUtils]: 8: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {840#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:17,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {840#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:17,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {842#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {842#(<= |dll_create_#in~len| 1)} assume true; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,327 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {842#(<= |dll_create_#in~len| 1)} {825#(<= 5 main_~len~0)} #119#return; {821#false} is VALID [2020-07-17 22:33:17,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {821#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {821#false} is VALID [2020-07-17 22:33:17,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {821#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {821#false} is VALID [2020-07-17 22:33:17,328 INFO L280 TraceCheckUtils]: 21: Hoare triple {821#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {821#false} is VALID [2020-07-17 22:33:17,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {821#false} assume #t~short9; {821#false} is VALID [2020-07-17 22:33:17,328 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#false} #t~short11 := #t~short9; {821#false} is VALID [2020-07-17 22:33:17,329 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#false} assume #t~short11; {821#false} is VALID [2020-07-17 22:33:17,329 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {821#false} is VALID [2020-07-17 22:33:17,329 INFO L280 TraceCheckUtils]: 26: Hoare triple {821#false} assume !false; {821#false} is VALID [2020-07-17 22:33:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:17,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276805313] [2020-07-17 22:33:17,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223706212] [2020-07-17 22:33:17,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:33:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:17,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:17,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2020-07-17 22:33:17,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {820#true} is VALID [2020-07-17 22:33:17,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-17 22:33:17,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {820#true} {820#true} #123#return; {820#true} is VALID [2020-07-17 22:33:17,520 INFO L263 TraceCheckUtils]: 4: Hoare triple {820#true} call #t~ret20 := main(); {820#true} is VALID [2020-07-17 22:33:17,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#true} ~len~0 := 5; {825#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:17,521 INFO L263 TraceCheckUtils]: 6: Hoare triple {825#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {820#true} is VALID [2020-07-17 22:33:17,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} assume #t~nondet3 == ~len;#t~ite4 := 1; {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {867#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:17,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {867#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:17,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {841#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(~len > 0); {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,528 INFO L280 TraceCheckUtils]: 16: Hoare triple {842#(<= |dll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {842#(<= |dll_create_#in~len| 1)} assume true; {842#(<= |dll_create_#in~len| 1)} is VALID [2020-07-17 22:33:17,530 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {842#(<= |dll_create_#in~len| 1)} {825#(<= 5 main_~len~0)} #119#return; {821#false} is VALID [2020-07-17 22:33:17,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {821#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {821#false} is VALID [2020-07-17 22:33:17,530 INFO L280 TraceCheckUtils]: 20: Hoare triple {821#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {821#false} is VALID [2020-07-17 22:33:17,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {821#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {821#false} is VALID [2020-07-17 22:33:17,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {821#false} assume #t~short9; {821#false} is VALID [2020-07-17 22:33:17,531 INFO L280 TraceCheckUtils]: 23: Hoare triple {821#false} #t~short11 := #t~short9; {821#false} is VALID [2020-07-17 22:33:17,531 INFO L280 TraceCheckUtils]: 24: Hoare triple {821#false} assume #t~short11; {821#false} is VALID [2020-07-17 22:33:17,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {821#false} is VALID [2020-07-17 22:33:17,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {821#false} assume !false; {821#false} is VALID [2020-07-17 22:33:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:17,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:17,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-17 22:33:17,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953403348] [2020-07-17 22:33:17,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-17 22:33:17,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:17,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:33:17,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:17,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:33:17,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:33:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:33:17,593 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 9 states. [2020-07-17 22:33:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,153 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2020-07-17 22:33:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:33:18,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-17 22:33:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2020-07-17 22:33:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:33:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2020-07-17 22:33:18,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2020-07-17 22:33:18,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:18,263 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:33:18,263 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:33:18,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:33:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:33:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-17 22:33:18,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:18,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 43 states. [2020-07-17 22:33:18,286 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 43 states. [2020-07-17 22:33:18,286 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 43 states. [2020-07-17 22:33:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,289 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2020-07-17 22:33:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2020-07-17 22:33:18,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:18,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:18,290 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 49 states. [2020-07-17 22:33:18,291 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 49 states. [2020-07-17 22:33:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:18,293 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2020-07-17 22:33:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2020-07-17 22:33:18,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:18,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:18,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:18,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:33:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-07-17 22:33:18,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2020-07-17 22:33:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:18,297 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-07-17 22:33:18,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:33:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-07-17 22:33:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:33:18,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:18,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:18,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:18,512 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash 260011544, now seen corresponding path program 1 times [2020-07-17 22:33:18,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:18,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536485334] [2020-07-17 22:33:18,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {1191#(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; {1166#true} is VALID [2020-07-17 22:33:18,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#true} assume true; {1166#true} is VALID [2020-07-17 22:33:18,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1166#true} {1166#true} #123#return; {1166#true} is VALID [2020-07-17 22:33:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {1192#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,758 INFO L280 TraceCheckUtils]: 3: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,759 INFO L280 TraceCheckUtils]: 4: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,761 INFO L280 TraceCheckUtils]: 6: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,764 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,765 INFO L280 TraceCheckUtils]: 11: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,766 INFO L280 TraceCheckUtils]: 12: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,766 INFO L280 TraceCheckUtils]: 13: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:18,768 INFO L280 TraceCheckUtils]: 15: Hoare triple {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(~len > 0); {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,769 INFO L280 TraceCheckUtils]: 16: Hoare triple {1196#(<= |dll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,770 INFO L280 TraceCheckUtils]: 17: Hoare triple {1196#(<= |dll_create_#in~len| 2)} assume true; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,771 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1196#(<= |dll_create_#in~len| 2)} {1171#(<= 5 main_~len~0)} #119#return; {1167#false} is VALID [2020-07-17 22:33:18,773 INFO L263 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1191#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:18,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {1191#(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; {1166#true} is VALID [2020-07-17 22:33:18,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2020-07-17 22:33:18,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #123#return; {1166#true} is VALID [2020-07-17 22:33:18,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret20 := main(); {1166#true} is VALID [2020-07-17 22:33:18,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {1166#true} ~len~0 := 5; {1171#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:18,777 INFO L263 TraceCheckUtils]: 6: Hoare triple {1171#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {1192#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:18,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {1192#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,779 INFO L280 TraceCheckUtils]: 9: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,781 INFO L280 TraceCheckUtils]: 11: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1193#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:18,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {1193#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,786 INFO L280 TraceCheckUtils]: 19: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,788 INFO L280 TraceCheckUtils]: 21: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:18,789 INFO L280 TraceCheckUtils]: 22: Hoare triple {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(~len > 0); {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {1196#(<= |dll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {1196#(<= |dll_create_#in~len| 2)} assume true; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:18,792 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1196#(<= |dll_create_#in~len| 2)} {1171#(<= 5 main_~len~0)} #119#return; {1167#false} is VALID [2020-07-17 22:33:18,792 INFO L280 TraceCheckUtils]: 26: Hoare triple {1167#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1167#false} is VALID [2020-07-17 22:33:18,793 INFO L280 TraceCheckUtils]: 27: Hoare triple {1167#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {1167#false} is VALID [2020-07-17 22:33:18,793 INFO L280 TraceCheckUtils]: 28: Hoare triple {1167#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {1167#false} is VALID [2020-07-17 22:33:18,793 INFO L280 TraceCheckUtils]: 29: Hoare triple {1167#false} assume #t~short9; {1167#false} is VALID [2020-07-17 22:33:18,793 INFO L280 TraceCheckUtils]: 30: Hoare triple {1167#false} #t~short11 := #t~short9; {1167#false} is VALID [2020-07-17 22:33:18,794 INFO L280 TraceCheckUtils]: 31: Hoare triple {1167#false} assume #t~short11; {1167#false} is VALID [2020-07-17 22:33:18,794 INFO L280 TraceCheckUtils]: 32: Hoare triple {1167#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {1167#false} is VALID [2020-07-17 22:33:18,794 INFO L280 TraceCheckUtils]: 33: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2020-07-17 22:33:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:18,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536485334] [2020-07-17 22:33:18,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715783877] [2020-07-17 22:33:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:33:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:18,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:18,986 INFO L263 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2020-07-17 22:33:18,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1166#true} is VALID [2020-07-17 22:33:18,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2020-07-17 22:33:18,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #123#return; {1166#true} is VALID [2020-07-17 22:33:18,988 INFO L263 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret20 := main(); {1166#true} is VALID [2020-07-17 22:33:18,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {1166#true} ~len~0 := 5; {1171#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:18,989 INFO L263 TraceCheckUtils]: 6: Hoare triple {1171#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {1166#true} is VALID [2020-07-17 22:33:18,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {1166#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,992 INFO L280 TraceCheckUtils]: 12: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1221#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:18,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {1221#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,994 INFO L280 TraceCheckUtils]: 15: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,995 INFO L280 TraceCheckUtils]: 16: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,996 INFO L280 TraceCheckUtils]: 17: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,996 INFO L280 TraceCheckUtils]: 18: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:18,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {1194#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:19,000 INFO L280 TraceCheckUtils]: 22: Hoare triple {1195#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(~len > 0); {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,000 INFO L280 TraceCheckUtils]: 23: Hoare triple {1196#(<= |dll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,001 INFO L280 TraceCheckUtils]: 24: Hoare triple {1196#(<= |dll_create_#in~len| 2)} assume true; {1196#(<= |dll_create_#in~len| 2)} is VALID [2020-07-17 22:33:19,002 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1196#(<= |dll_create_#in~len| 2)} {1171#(<= 5 main_~len~0)} #119#return; {1167#false} is VALID [2020-07-17 22:33:19,003 INFO L280 TraceCheckUtils]: 26: Hoare triple {1167#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1167#false} is VALID [2020-07-17 22:33:19,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {1167#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {1167#false} is VALID [2020-07-17 22:33:19,003 INFO L280 TraceCheckUtils]: 28: Hoare triple {1167#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {1167#false} is VALID [2020-07-17 22:33:19,003 INFO L280 TraceCheckUtils]: 29: Hoare triple {1167#false} assume #t~short9; {1167#false} is VALID [2020-07-17 22:33:19,003 INFO L280 TraceCheckUtils]: 30: Hoare triple {1167#false} #t~short11 := #t~short9; {1167#false} is VALID [2020-07-17 22:33:19,004 INFO L280 TraceCheckUtils]: 31: Hoare triple {1167#false} assume #t~short11; {1167#false} is VALID [2020-07-17 22:33:19,004 INFO L280 TraceCheckUtils]: 32: Hoare triple {1167#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {1167#false} is VALID [2020-07-17 22:33:19,004 INFO L280 TraceCheckUtils]: 33: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2020-07-17 22:33:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:19,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:19,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2020-07-17 22:33:19,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044781722] [2020-07-17 22:33:19,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-17 22:33:19,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:19,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:33:19,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:19,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:33:19,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:33:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:33:19,087 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 10 states. [2020-07-17 22:33:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:19,643 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2020-07-17 22:33:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:33:19,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-17 22:33:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:33:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2020-07-17 22:33:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:33:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2020-07-17 22:33:19,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2020-07-17 22:33:19,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:19,763 INFO L225 Difference]: With dead ends: 76 [2020-07-17 22:33:19,763 INFO L226 Difference]: Without dead ends: 56 [2020-07-17 22:33:19,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:33:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-17 22:33:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2020-07-17 22:33:19,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:19,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 50 states. [2020-07-17 22:33:19,788 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 50 states. [2020-07-17 22:33:19,789 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 50 states. [2020-07-17 22:33:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:19,791 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-17 22:33:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2020-07-17 22:33:19,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:19,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:19,792 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 56 states. [2020-07-17 22:33:19,793 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 56 states. [2020-07-17 22:33:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:19,795 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-17 22:33:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2020-07-17 22:33:19,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:19,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:19,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:19,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 22:33:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2020-07-17 22:33:19,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 34 [2020-07-17 22:33:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:19,799 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2020-07-17 22:33:19,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:33:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2020-07-17 22:33:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 22:33:19,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:19,800 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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:33:20,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:20,015 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1408992297, now seen corresponding path program 2 times [2020-07-17 22:33:20,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:20,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813215250] [2020-07-17 22:33:20,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {1603#(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; {1571#true} is VALID [2020-07-17 22:33:20,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#true} assume true; {1571#true} is VALID [2020-07-17 22:33:20,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1571#true} {1571#true} #123#return; {1571#true} is VALID [2020-07-17 22:33:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {1604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,191 INFO L280 TraceCheckUtils]: 5: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,193 INFO L280 TraceCheckUtils]: 9: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,197 INFO L280 TraceCheckUtils]: 16: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,198 INFO L280 TraceCheckUtils]: 17: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,204 INFO L280 TraceCheckUtils]: 18: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:20,206 INFO L280 TraceCheckUtils]: 22: Hoare triple {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(~len > 0); {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,206 INFO L280 TraceCheckUtils]: 23: Hoare triple {1609#(<= |dll_create_#in~len| 3)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,207 INFO L280 TraceCheckUtils]: 24: Hoare triple {1609#(<= |dll_create_#in~len| 3)} assume true; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,209 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1609#(<= |dll_create_#in~len| 3)} {1576#(<= 5 main_~len~0)} #119#return; {1572#false} is VALID [2020-07-17 22:33:20,215 INFO L263 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1603#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:20,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {1603#(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; {1571#true} is VALID [2020-07-17 22:33:20,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#true} assume true; {1571#true} is VALID [2020-07-17 22:33:20,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1571#true} {1571#true} #123#return; {1571#true} is VALID [2020-07-17 22:33:20,217 INFO L263 TraceCheckUtils]: 4: Hoare triple {1571#true} call #t~ret20 := main(); {1571#true} is VALID [2020-07-17 22:33:20,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {1571#true} ~len~0 := 5; {1576#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:20,219 INFO L263 TraceCheckUtils]: 6: Hoare triple {1576#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {1604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:20,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {1604#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1605#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:20,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {1605#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,226 INFO L280 TraceCheckUtils]: 16: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,226 INFO L280 TraceCheckUtils]: 17: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,227 INFO L280 TraceCheckUtils]: 18: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,228 INFO L280 TraceCheckUtils]: 21: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,229 INFO L280 TraceCheckUtils]: 22: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,229 INFO L280 TraceCheckUtils]: 23: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,230 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,230 INFO L280 TraceCheckUtils]: 25: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,231 INFO L280 TraceCheckUtils]: 26: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,231 INFO L280 TraceCheckUtils]: 27: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,232 INFO L280 TraceCheckUtils]: 28: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:20,232 INFO L280 TraceCheckUtils]: 29: Hoare triple {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(~len > 0); {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,233 INFO L280 TraceCheckUtils]: 30: Hoare triple {1609#(<= |dll_create_#in~len| 3)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,233 INFO L280 TraceCheckUtils]: 31: Hoare triple {1609#(<= |dll_create_#in~len| 3)} assume true; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,235 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= |dll_create_#in~len| 3)} {1576#(<= 5 main_~len~0)} #119#return; {1572#false} is VALID [2020-07-17 22:33:20,236 INFO L280 TraceCheckUtils]: 33: Hoare triple {1572#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1572#false} is VALID [2020-07-17 22:33:20,236 INFO L280 TraceCheckUtils]: 34: Hoare triple {1572#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {1572#false} is VALID [2020-07-17 22:33:20,236 INFO L280 TraceCheckUtils]: 35: Hoare triple {1572#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {1572#false} is VALID [2020-07-17 22:33:20,236 INFO L280 TraceCheckUtils]: 36: Hoare triple {1572#false} assume #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,236 INFO L280 TraceCheckUtils]: 37: Hoare triple {1572#false} #t~short11 := #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,237 INFO L280 TraceCheckUtils]: 38: Hoare triple {1572#false} assume #t~short11; {1572#false} is VALID [2020-07-17 22:33:20,237 INFO L280 TraceCheckUtils]: 39: Hoare triple {1572#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,237 INFO L280 TraceCheckUtils]: 40: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2020-07-17 22:33:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:20,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813215250] [2020-07-17 22:33:20,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420582611] [2020-07-17 22:33:20,241 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:20,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:33:20,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:33:20,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:33:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:20,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:20,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2020-07-17 22:33:20,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1571#true} is VALID [2020-07-17 22:33:20,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#true} assume true; {1571#true} is VALID [2020-07-17 22:33:20,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1571#true} {1571#true} #123#return; {1571#true} is VALID [2020-07-17 22:33:20,515 INFO L263 TraceCheckUtils]: 4: Hoare triple {1571#true} call #t~ret20 := main(); {1571#true} is VALID [2020-07-17 22:33:20,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {1571#true} ~len~0 := 5; {1576#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:20,516 INFO L263 TraceCheckUtils]: 6: Hoare triple {1576#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {1571#true} is VALID [2020-07-17 22:33:20,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {1571#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,519 INFO L280 TraceCheckUtils]: 11: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} assume #t~nondet3 == ~len;#t~ite4 := 1; {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1634#(<= |dll_create_#in~len| dll_create_~len)} is VALID [2020-07-17 22:33:20,522 INFO L280 TraceCheckUtils]: 14: Hoare triple {1634#(<= |dll_create_#in~len| dll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,523 INFO L280 TraceCheckUtils]: 15: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,527 INFO L280 TraceCheckUtils]: 17: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,528 INFO L280 TraceCheckUtils]: 18: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:20,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {1606#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,533 INFO L280 TraceCheckUtils]: 24: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,534 INFO L280 TraceCheckUtils]: 25: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume #t~nondet3 == ~len;#t~ite4 := 1; {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,534 INFO L280 TraceCheckUtils]: 26: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,535 INFO L280 TraceCheckUtils]: 27: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:20,536 INFO L280 TraceCheckUtils]: 28: Hoare triple {1607#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:20,536 INFO L280 TraceCheckUtils]: 29: Hoare triple {1608#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(~len > 0); {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,537 INFO L280 TraceCheckUtils]: 30: Hoare triple {1609#(<= |dll_create_#in~len| 3)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,537 INFO L280 TraceCheckUtils]: 31: Hoare triple {1609#(<= |dll_create_#in~len| 3)} assume true; {1609#(<= |dll_create_#in~len| 3)} is VALID [2020-07-17 22:33:20,538 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= |dll_create_#in~len| 3)} {1576#(<= 5 main_~len~0)} #119#return; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 33: Hoare triple {1572#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 34: Hoare triple {1572#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 35: Hoare triple {1572#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 36: Hoare triple {1572#false} assume #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 37: Hoare triple {1572#false} #t~short11 := #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 38: Hoare triple {1572#false} assume #t~short11; {1572#false} is VALID [2020-07-17 22:33:20,539 INFO L280 TraceCheckUtils]: 39: Hoare triple {1572#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {1572#false} is VALID [2020-07-17 22:33:20,540 INFO L280 TraceCheckUtils]: 40: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2020-07-17 22:33:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:20,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:20,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-07-17 22:33:20,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479561000] [2020-07-17 22:33:20,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-17 22:33:20,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:20,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:33:20,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:20,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:33:20,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:33:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:33:20,616 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 11 states. [2020-07-17 22:33:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,224 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2020-07-17 22:33:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:33:21,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-17 22:33:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2020-07-17 22:33:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:33:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2020-07-17 22:33:21,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2020-07-17 22:33:21,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:21,363 INFO L225 Difference]: With dead ends: 83 [2020-07-17 22:33:21,363 INFO L226 Difference]: Without dead ends: 63 [2020-07-17 22:33:21,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:33:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-17 22:33:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2020-07-17 22:33:21,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:21,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 57 states. [2020-07-17 22:33:21,407 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 57 states. [2020-07-17 22:33:21,407 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 57 states. [2020-07-17 22:33:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,411 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2020-07-17 22:33:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2020-07-17 22:33:21,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:21,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:21,412 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 63 states. [2020-07-17 22:33:21,412 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 63 states. [2020-07-17 22:33:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:21,414 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2020-07-17 22:33:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2020-07-17 22:33:21,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:21,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:21,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:21,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-17 22:33:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2020-07-17 22:33:21,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 41 [2020-07-17 22:33:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:21,418 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2020-07-17 22:33:21,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:33:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2020-07-17 22:33:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-17 22:33:21,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:21,419 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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:33:21,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:21,634 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2107133704, now seen corresponding path program 3 times [2020-07-17 22:33:21,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:21,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57480215] [2020-07-17 22:33:21,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {2074#(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; {2035#true} is VALID [2020-07-17 22:33:21,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:33:21,743 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2020-07-17 22:33:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:21,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {2075#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,891 INFO L280 TraceCheckUtils]: 3: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,894 INFO L280 TraceCheckUtils]: 7: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,901 INFO L280 TraceCheckUtils]: 14: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,902 INFO L280 TraceCheckUtils]: 15: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,902 INFO L280 TraceCheckUtils]: 16: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,904 INFO L280 TraceCheckUtils]: 18: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,905 INFO L280 TraceCheckUtils]: 19: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,908 INFO L280 TraceCheckUtils]: 22: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,909 INFO L280 TraceCheckUtils]: 23: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,910 INFO L280 TraceCheckUtils]: 24: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,911 INFO L280 TraceCheckUtils]: 26: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,911 INFO L280 TraceCheckUtils]: 27: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,912 INFO L280 TraceCheckUtils]: 28: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2080#(<= |dll_create_#in~len| (+ dll_create_~len 4))} is VALID [2020-07-17 22:33:21,913 INFO L280 TraceCheckUtils]: 29: Hoare triple {2080#(<= |dll_create_#in~len| (+ dll_create_~len 4))} assume !(~len > 0); {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,914 INFO L280 TraceCheckUtils]: 30: Hoare triple {2081#(<= |dll_create_#in~len| 4)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,914 INFO L280 TraceCheckUtils]: 31: Hoare triple {2081#(<= |dll_create_#in~len| 4)} assume true; {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,915 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2081#(<= |dll_create_#in~len| 4)} {2040#(<= 5 main_~len~0)} #119#return; {2036#false} is VALID [2020-07-17 22:33:21,919 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:33:21,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {2074#(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; {2035#true} is VALID [2020-07-17 22:33:21,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:33:21,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2020-07-17 22:33:21,920 INFO L263 TraceCheckUtils]: 4: Hoare triple {2035#true} call #t~ret20 := main(); {2035#true} is VALID [2020-07-17 22:33:21,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} ~len~0 := 5; {2040#(<= 5 main_~len~0)} is VALID [2020-07-17 22:33:21,922 INFO L263 TraceCheckUtils]: 6: Hoare triple {2040#(<= 5 main_~len~0)} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {2075#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-17 22:33:21,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {2075#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,926 INFO L280 TraceCheckUtils]: 11: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume #t~nondet3 == ~len;#t~ite4 := 1; {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2076#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-17 22:33:21,929 INFO L280 TraceCheckUtils]: 14: Hoare triple {2076#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,930 INFO L280 TraceCheckUtils]: 15: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} is VALID [2020-07-17 22:33:21,935 INFO L280 TraceCheckUtils]: 21: Hoare triple {2077#(<= |dll_create_#in~len| (+ dll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,940 INFO L280 TraceCheckUtils]: 27: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} is VALID [2020-07-17 22:33:21,941 INFO L280 TraceCheckUtils]: 28: Hoare triple {2078#(<= |dll_create_#in~len| (+ dll_create_~len 2))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,942 INFO L280 TraceCheckUtils]: 29: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,943 INFO L280 TraceCheckUtils]: 30: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,944 INFO L280 TraceCheckUtils]: 31: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,945 INFO L280 TraceCheckUtils]: 32: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,945 INFO L280 TraceCheckUtils]: 33: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,946 INFO L280 TraceCheckUtils]: 34: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} is VALID [2020-07-17 22:33:21,947 INFO L280 TraceCheckUtils]: 35: Hoare triple {2079#(<= |dll_create_#in~len| (+ dll_create_~len 3))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2080#(<= |dll_create_#in~len| (+ dll_create_~len 4))} is VALID [2020-07-17 22:33:21,948 INFO L280 TraceCheckUtils]: 36: Hoare triple {2080#(<= |dll_create_#in~len| (+ dll_create_~len 4))} assume !(~len > 0); {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,949 INFO L280 TraceCheckUtils]: 37: Hoare triple {2081#(<= |dll_create_#in~len| 4)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,949 INFO L280 TraceCheckUtils]: 38: Hoare triple {2081#(<= |dll_create_#in~len| 4)} assume true; {2081#(<= |dll_create_#in~len| 4)} is VALID [2020-07-17 22:33:21,950 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2081#(<= |dll_create_#in~len| 4)} {2040#(<= 5 main_~len~0)} #119#return; {2036#false} is VALID [2020-07-17 22:33:21,951 INFO L280 TraceCheckUtils]: 40: Hoare triple {2036#false} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {2036#false} is VALID [2020-07-17 22:33:21,951 INFO L280 TraceCheckUtils]: 41: Hoare triple {2036#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {2036#false} is VALID [2020-07-17 22:33:21,951 INFO L280 TraceCheckUtils]: 42: Hoare triple {2036#false} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {2036#false} is VALID [2020-07-17 22:33:21,951 INFO L280 TraceCheckUtils]: 43: Hoare triple {2036#false} assume #t~short9; {2036#false} is VALID [2020-07-17 22:33:21,951 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} #t~short11 := #t~short9; {2036#false} is VALID [2020-07-17 22:33:21,952 INFO L280 TraceCheckUtils]: 45: Hoare triple {2036#false} assume #t~short11; {2036#false} is VALID [2020-07-17 22:33:21,952 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {2036#false} is VALID [2020-07-17 22:33:21,952 INFO L280 TraceCheckUtils]: 47: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-17 22:33:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:21,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57480215] [2020-07-17 22:33:21,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305797984] [2020-07-17 22:33:21,956 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:33:22,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:33:22,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:33:22,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-17 22:33:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:22,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:33:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2020-07-17 22:33:22,849 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,860 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:22,861 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,861 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2020-07-17 22:33:22,914 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 10=[|v_#memory_int_23|]} [2020-07-17 22:33:22,920 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:33:22,936 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:22,967 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:22,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2020-07-17 22:33:22,970 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,982 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:22,983 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:33:22,983 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:23 [2020-07-17 22:33:22,991 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:33:22,991 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, |v_dll_create_#t~ite4_5|, |v_#memory_int_21|]. (let ((.cse0 (select |v_#memory_int_23| dll_create_~new_head~0.base)) (.cse2 (select |v_#memory_int_21| dll_create_~new_head~0.base))) (and (= (store |v_#memory_int_23| dll_create_~new_head~0.base (let ((.cse1 (+ dll_create_~new_head~0.offset 4))) (store (store .cse0 (+ dll_create_~new_head~0.offset 16) |v_dll_create_#t~ite4_5|) .cse1 (select .cse2 .cse1)))) |v_#memory_int_21|) (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select .cse0 (+ dll_create_~new_head~0.offset 8))) (= 0 (select .cse0 dll_create_~new_head~0.offset)) (= |#memory_int| (store |v_#memory_int_21| dll_create_~new_head~0.base (let ((.cse3 (+ dll_create_~new_head~0.offset 12))) (store .cse2 .cse3 (select (select |#memory_int| dll_create_~new_head~0.base) .cse3))))))) [2020-07-17 22:33:22,991 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| dll_create_~new_head~0.base))) (and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select .cse0 (+ dll_create_~new_head~0.offset 8))) (= 0 (select .cse0 dll_create_~new_head~0.offset)))) [2020-07-17 22:33:23,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:23,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:23,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:33:23,024 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:23,024 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2020-07-17 22:33:23,027 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:33:23,035 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:33:23,037 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:33:23,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-17 22:33:23,046 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:33:23,046 WARN L407 uantifierElimination]: Input elimination task: ∃ [dll_create_~head~0.base, dll_create_~head~0.offset, |v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| dll_create_~new_head~0.base))) (and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select .cse0 (+ dll_create_~new_head~0.offset 8))) (= 0 (select .cse0 dll_create_~new_head~0.offset)) (= (store |v_#memory_int_24| dll_create_~head~0.base (let ((.cse1 (+ dll_create_~head~0.offset 12))) (store (select |v_#memory_int_24| dll_create_~head~0.base) .cse1 (select (select |#memory_int| dll_create_~head~0.base) .cse1)))) |#memory_int|))) [2020-07-17 22:33:23,046 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| dll_create_~new_head~0.base))) (and (<= dll_create_~new_head~0.offset 0) (= 0 (select .cse0 (+ dll_create_~new_head~0.offset 8))) (= 0 (select .cse0 dll_create_~new_head~0.offset)))) [2020-07-17 22:33:23,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:33:23,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2020-07-17 22:33:23,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {2035#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2035#true} is VALID [2020-07-17 22:33:23,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2020-07-17 22:33:23,291 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2020-07-17 22:33:23,291 INFO L263 TraceCheckUtils]: 4: Hoare triple {2035#true} call #t~ret20 := main(); {2035#true} is VALID [2020-07-17 22:33:23,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {2035#true} ~len~0 := 5; {2035#true} is VALID [2020-07-17 22:33:23,292 INFO L263 TraceCheckUtils]: 6: Hoare triple {2035#true} call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); {2035#true} is VALID [2020-07-17 22:33:23,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {2035#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2035#true} is VALID [2020-07-17 22:33:23,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {2035#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2035#true} is VALID [2020-07-17 22:33:23,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {2035#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {2035#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {2035#true} assume #t~nondet3 == ~len;#t~ite4 := 1; {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {2035#true} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2035#true} is VALID [2020-07-17 22:33:23,293 INFO L280 TraceCheckUtils]: 15: Hoare triple {2035#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2035#true} is VALID [2020-07-17 22:33:23,294 INFO L280 TraceCheckUtils]: 16: Hoare triple {2035#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2035#true} is VALID [2020-07-17 22:33:23,294 INFO L280 TraceCheckUtils]: 17: Hoare triple {2035#true} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2035#true} is VALID [2020-07-17 22:33:23,294 INFO L280 TraceCheckUtils]: 18: Hoare triple {2035#true} assume #t~nondet3 == ~len;#t~ite4 := 1; {2035#true} is VALID [2020-07-17 22:33:23,294 INFO L280 TraceCheckUtils]: 19: Hoare triple {2035#true} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2035#true} is VALID [2020-07-17 22:33:23,295 INFO L280 TraceCheckUtils]: 20: Hoare triple {2035#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2035#true} is VALID [2020-07-17 22:33:23,295 INFO L280 TraceCheckUtils]: 21: Hoare triple {2035#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2035#true} is VALID [2020-07-17 22:33:23,301 INFO L280 TraceCheckUtils]: 22: Hoare triple {2035#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,302 INFO L280 TraceCheckUtils]: 23: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,303 INFO L280 TraceCheckUtils]: 24: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,303 INFO L280 TraceCheckUtils]: 25: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} assume #t~nondet3 == ~len;#t~ite4 := 1; {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,304 INFO L280 TraceCheckUtils]: 26: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,304 INFO L280 TraceCheckUtils]: 27: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2151#(<= 0 dll_create_~new_head~0.offset)} is VALID [2020-07-17 22:33:23,305 INFO L280 TraceCheckUtils]: 28: Hoare triple {2151#(<= 0 dll_create_~new_head~0.offset)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2170#(<= 0 dll_create_~head~0.offset)} is VALID [2020-07-17 22:33:23,314 INFO L280 TraceCheckUtils]: 29: Hoare triple {2170#(<= 0 dll_create_~head~0.offset)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2174#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0))} is VALID [2020-07-17 22:33:23,321 INFO L280 TraceCheckUtils]: 30: Hoare triple {2174#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2174#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0))} is VALID [2020-07-17 22:33:23,323 INFO L280 TraceCheckUtils]: 31: Hoare triple {2174#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0))} call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2020-07-17 22:33:23,323 INFO L280 TraceCheckUtils]: 32: Hoare triple {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} assume #t~nondet3 == ~len;#t~ite4 := 1; {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2020-07-17 22:33:23,326 INFO L280 TraceCheckUtils]: 33: Hoare triple {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~ite4;havoc #t~nondet3;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2020-07-17 22:33:23,327 INFO L280 TraceCheckUtils]: 34: Hoare triple {2181#(and (<= 0 dll_create_~head~0.offset) (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); {2191#(and (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} is VALID [2020-07-17 22:33:23,328 INFO L280 TraceCheckUtils]: 35: Hoare triple {2191#(and (<= dll_create_~new_head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {2195#(and (<= dll_create_~head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:23,329 INFO L280 TraceCheckUtils]: 36: Hoare triple {2195#(and (<= dll_create_~head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)))} assume !(~len > 0); {2195#(and (<= dll_create_~head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)))} is VALID [2020-07-17 22:33:23,330 INFO L280 TraceCheckUtils]: 37: Hoare triple {2195#(and (<= dll_create_~head~0.offset 0) (= 0 (select (select |#memory_int| dll_create_~head~0.base) (+ dll_create_~head~0.offset 8))) (= 0 (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2202#(and (<= |dll_create_#res.offset| 0) (= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|)) (= 0 (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))))} is VALID [2020-07-17 22:33:23,331 INFO L280 TraceCheckUtils]: 38: Hoare triple {2202#(and (<= |dll_create_#res.offset| 0) (= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|)) (= 0 (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))))} assume true; {2202#(and (<= |dll_create_#res.offset| 0) (= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|)) (= 0 (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))))} is VALID [2020-07-17 22:33:23,333 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2202#(and (<= |dll_create_#res.offset| 0) (= 0 (select (select |#memory_int| |dll_create_#res.base|) |dll_create_#res.offset|)) (= 0 (select (select |#memory_int| |dll_create_#res.base|) (+ |dll_create_#res.offset| 8))))} {2035#true} #119#return; {2209#(and (= 0 (select (select |#memory_int| |main_#t~ret6.base|) (+ |main_#t~ret6.offset| 8))) (<= |main_#t~ret6.offset| 0) (= 0 (select (select |#memory_int| |main_#t~ret6.base|) |main_#t~ret6.offset|)))} is VALID [2020-07-17 22:33:23,334 INFO L280 TraceCheckUtils]: 40: Hoare triple {2209#(and (= 0 (select (select |#memory_int| |main_#t~ret6.base|) (+ |main_#t~ret6.offset| 8))) (<= |main_#t~ret6.offset| 0) (= 0 (select (select |#memory_int| |main_#t~ret6.base|) |main_#t~ret6.offset|)))} ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; {2213#(and (= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset)) (<= main_~head~1.offset 0) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))))} is VALID [2020-07-17 22:33:23,334 INFO L280 TraceCheckUtils]: 41: Hoare triple {2213#(and (= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset)) (<= main_~head~1.offset 0) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); {2213#(and (= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset)) (<= main_~head~1.offset 0) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))))} is VALID [2020-07-17 22:33:23,335 INFO L280 TraceCheckUtils]: 42: Hoare triple {2213#(and (= 0 (select (select |#memory_int| main_~head~1.base) main_~head~1.offset)) (<= main_~head~1.offset 0) (= 0 (select (select |#memory_int| main_~head~1.base) (+ main_~head~1.offset 8))))} assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; {2220#(not |main_#t~short9|)} is VALID [2020-07-17 22:33:23,336 INFO L280 TraceCheckUtils]: 43: Hoare triple {2220#(not |main_#t~short9|)} assume #t~short9; {2036#false} is VALID [2020-07-17 22:33:23,336 INFO L280 TraceCheckUtils]: 44: Hoare triple {2036#false} #t~short11 := #t~short9; {2036#false} is VALID [2020-07-17 22:33:23,336 INFO L280 TraceCheckUtils]: 45: Hoare triple {2036#false} assume #t~short11; {2036#false} is VALID [2020-07-17 22:33:23,337 INFO L280 TraceCheckUtils]: 46: Hoare triple {2036#false} assume #t~short11;havoc #t~mem7;havoc #t~mem10;havoc #t~short11;havoc #t~mem8;havoc #t~short9; {2036#false} is VALID [2020-07-17 22:33:23,337 INFO L280 TraceCheckUtils]: 47: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2020-07-17 22:33:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:33:23,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:33:23,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2020-07-17 22:33:23,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988865820] [2020-07-17 22:33:23,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2020-07-17 22:33:23,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:23,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:33:23,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:23,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:33:23,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:23,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:33:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:33:23,475 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 21 states. [2020-07-17 22:33:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:26,603 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2020-07-17 22:33:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 22:33:26,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2020-07-17 22:33:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:33:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:33:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 128 transitions. [2020-07-17 22:33:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:33:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 128 transitions. [2020-07-17 22:33:26,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 128 transitions. [2020-07-17 22:33:26,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:26,875 INFO L225 Difference]: With dead ends: 104 [2020-07-17 22:33:26,875 INFO L226 Difference]: Without dead ends: 84 [2020-07-17 22:33:26,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=1444, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 22:33:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-17 22:33:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2020-07-17 22:33:26,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:33:26,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 67 states. [2020-07-17 22:33:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 67 states. [2020-07-17 22:33:26,936 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 67 states. [2020-07-17 22:33:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:26,939 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2020-07-17 22:33:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2020-07-17 22:33:26,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:26,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:26,940 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 84 states. [2020-07-17 22:33:26,940 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 84 states. [2020-07-17 22:33:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:33:26,944 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2020-07-17 22:33:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2020-07-17 22:33:26,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:33:26,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:33:26,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:33:26,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:33:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-17 22:33:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2020-07-17 22:33:26,947 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 48 [2020-07-17 22:33:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:26,947 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2020-07-17 22:33:26,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:33:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2020-07-17 22:33:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 22:33:26,948 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:26,948 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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:33:27,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:33:27,162 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 895583181, now seen corresponding path program 1 times [2020-07-17 22:33:27,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:27,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41661438] [2020-07-17 22:33:27,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:33:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:33:27,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:33:27,410 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:33:27,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:33:27,531 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:33:27,531 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: dll_createENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:33:27,532 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: L565 has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: L569-2 has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: L569-2 has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: L569-2 has no Hoare annotation [2020-07-17 22:33:27,533 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-17 22:33:27,534 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:33:27,535 WARN L170 areAnnotationChecker]: L569-3 has no Hoare annotation [2020-07-17 22:33:27,535 WARN L170 areAnnotationChecker]: L571 has no Hoare annotation [2020-07-17 22:33:27,535 WARN L170 areAnnotationChecker]: L571 has no Hoare annotation [2020-07-17 22:33:27,535 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:33:27,535 WARN L170 areAnnotationChecker]: L589-1 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-17 22:33:27,536 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L596-1 has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L596-1 has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L596-1 has no Hoare annotation [2020-07-17 22:33:27,537 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-17 22:33:27,538 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-17 22:33:27,538 WARN L170 areAnnotationChecker]: L576-2 has no Hoare annotation [2020-07-17 22:33:27,538 WARN L170 areAnnotationChecker]: L596-2 has no Hoare annotation [2020-07-17 22:33:27,538 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-17 22:33:27,538 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-17 22:33:27,539 WARN L170 areAnnotationChecker]: L591 has no Hoare annotation [2020-07-17 22:33:27,540 WARN L170 areAnnotationChecker]: L591 has no Hoare annotation [2020-07-17 22:33:27,540 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-17 22:33:27,540 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-17 22:33:27,540 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:33:27,540 WARN L170 areAnnotationChecker]: L598-2 has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: L591-2 has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: L579-2 has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2020-07-17 22:33:27,541 WARN L170 areAnnotationChecker]: L591-3 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L591-3 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L598-5 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L598-5 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L591-5 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L591-5 has no Hoare annotation [2020-07-17 22:33:27,542 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2020-07-17 22:33:27,543 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2020-07-17 22:33:27,543 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:33:27,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:33:27 BoogieIcfgContainer [2020-07-17 22:33:27,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:33:27,551 INFO L168 Benchmark]: Toolchain (without parser) took 15209.69 ms. Allocated memory was 146.8 MB in the beginning and 365.4 MB in the end (delta: 218.6 MB). Free memory was 101.8 MB in the beginning and 276.0 MB in the end (delta: -174.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:27,551 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 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:33:27,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.85 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 168.8 MB in the end (delta: -67.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:27,559 INFO L168 Benchmark]: Boogie Preprocessor took 91.08 ms. Allocated memory is still 203.9 MB. Free memory was 168.8 MB in the beginning and 165.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:27,559 INFO L168 Benchmark]: RCFGBuilder took 729.69 ms. Allocated memory is still 203.9 MB. Free memory was 165.0 MB in the beginning and 108.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:33:27,560 INFO L168 Benchmark]: TraceAbstraction took 13755.80 ms. Allocated memory was 203.9 MB in the beginning and 365.4 MB in the end (delta: 161.5 MB). Free memory was 108.1 MB in the beginning and 276.0 MB in the end (delta: -167.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:33:27,568 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 625.85 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 168.8 MB in the end (delta: -67.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.08 ms. Allocated memory is still 203.9 MB. Free memory was 168.8 MB in the beginning and 165.0 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.69 ms. Allocated memory is still 203.9 MB. Free memory was 165.0 MB in the beginning and 108.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13755.80 ms. Allocated memory was 203.9 MB in the beginning and 365.4 MB in the end (delta: 161.5 MB). Free memory was 108.1 MB in the beginning and 276.0 MB in the end (delta: -167.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={-5:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 242 SDtfs, 402 SDslu, 916 SDs, 0 SdLazy, 925 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 48760 SizeOfPredicates, 20 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 41/163 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...