java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:33:32,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:33:32,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:33:32,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:33:32,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:33:32,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:33:32,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:33:32,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:33:32,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:33:32,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:33:32,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:33:32,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:33:32,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:33:32,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:33:32,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:33:32,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:33:32,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:33:32,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:33:32,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:33:32,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:33:32,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:33:32,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:33:32,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:33:32,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:33:32,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:33:32,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:33:32,122 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:33:32,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:33:32,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:33:32,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:33:32,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:33:32,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:33:32,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:33:32,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:33:32,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:33:32,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:33:32,130 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:33:32,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:33:32,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:33:32,168 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:33:32,168 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:33:32,169 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:33:32,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:33:32,169 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:33:32,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:33:32,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:33:32,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:33:32,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:33:32,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:33:32,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:33:32,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:33:32,172 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:33:32,172 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:33:32,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:33:32,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:33:32,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:33:32,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:33:32,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:33:32,175 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:33:32,175 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:33:32,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:33:32,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:33:32,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:33:32,176 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:33:32,176 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:33:32,176 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:33:32,176 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:33:32,177 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:33:32,177 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:33:32,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:33:32,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:33:32,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:33:32,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:33:32,264 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:33:32,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:33:32,327 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06ec805e/fc9f46f4ca314a9facb7d4e0a2fe5a83/FLAG3225a8d5a [2018-11-14 16:33:32,910 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:33:32,911 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:33:32,936 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06ec805e/fc9f46f4ca314a9facb7d4e0a2fe5a83/FLAG3225a8d5a [2018-11-14 16:33:32,952 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06ec805e/fc9f46f4ca314a9facb7d4e0a2fe5a83 [2018-11-14 16:33:32,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:33:32,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:33:32,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:33:32,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:33:32,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:33:32,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:33:32" (1/1) ... [2018-11-14 16:33:32,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248f1acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:32, skipping insertion in model container [2018-11-14 16:33:32,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:33:32" (1/1) ... [2018-11-14 16:33:32,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:33:33,046 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:33:33,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:33:33,522 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:33:33,593 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:33:33,751 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:33:33,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33 WrapperNode [2018-11-14 16:33:33,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:33:33,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:33:33,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:33:33,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:33:33,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... [2018-11-14 16:33:33,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:33:33,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:33:33,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:33:33,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:33:33,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:33:33,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:33:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:33:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:33:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:33:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:33:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 16:33:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 16:33:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 16:33:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2018-11-14 16:33:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:33:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:33:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:33:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:33:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:33:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:33:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:33:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:33:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:33:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:33:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:33:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:33:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:33:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:33:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:33:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:33:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:33:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:33:33,980 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:33:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:33:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:33:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:33:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:33:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:33:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:33:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:33:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:33:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:33:33,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:33:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:33:33,985 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:33:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:33:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:33:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:33:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:33:33,986 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:33:33,987 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:33:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:33:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:33:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:33:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:33:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:33:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:33:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:33:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:33:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:33:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:33:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:33:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:33:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:33:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:33:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 16:33:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 16:33:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:33:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:33:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2018-11-14 16:33:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:33:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:33:33,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:33:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:33:33,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:33:35,196 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:33:35,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:33:35 BoogieIcfgContainer [2018-11-14 16:33:35,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:33:35,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:33:35,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:33:35,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:33:35,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:33:32" (1/3) ... [2018-11-14 16:33:35,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c95236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:33:35, skipping insertion in model container [2018-11-14 16:33:35,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:33:33" (2/3) ... [2018-11-14 16:33:35,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c95236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:33:35, skipping insertion in model container [2018-11-14 16:33:35,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:33:35" (3/3) ... [2018-11-14 16:33:35,206 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:33:35,215 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:33:35,223 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:33:35,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:33:35,274 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:33:35,275 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:33:35,275 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:33:35,275 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:33:35,276 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:33:35,276 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:33:35,276 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:33:35,276 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:33:35,277 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:33:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-14 16:33:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:33:35,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:35,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:35,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:35,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1071837773, now seen corresponding path program 1 times [2018-11-14 16:33:35,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:35,321 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:35,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:35,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:36,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-14 16:33:36,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {52#true} is VALID [2018-11-14 16:33:36,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-14 16:33:36,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #107#return; {52#true} is VALID [2018-11-14 16:33:36,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret14 := main(); {52#true} is VALID [2018-11-14 16:33:36,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {52#true} is VALID [2018-11-14 16:33:36,061 INFO L256 TraceCheckUtils]: 6: Hoare triple {52#true} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {52#true} is VALID [2018-11-14 16:33:36,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {52#true} is VALID [2018-11-14 16:33:36,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-14 16:33:36,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {53#false} is VALID [2018-11-14 16:33:36,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 16:33:36,081 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {53#false} {52#true} #99#return; {53#false} is VALID [2018-11-14 16:33:36,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {53#false} is VALID [2018-11-14 16:33:36,082 INFO L256 TraceCheckUtils]: 13: Hoare triple {53#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {53#false} is VALID [2018-11-14 16:33:36,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {53#false} is VALID [2018-11-14 16:33:36,083 INFO L256 TraceCheckUtils]: 15: Hoare triple {53#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {53#false} is VALID [2018-11-14 16:33:36,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {53#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {53#false} is VALID [2018-11-14 16:33:36,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {53#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {53#false} is VALID [2018-11-14 16:33:36,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {53#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {53#false} is VALID [2018-11-14 16:33:36,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 16:33:36,085 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {53#false} {53#false} #105#return; {53#false} is VALID [2018-11-14 16:33:36,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {53#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {53#false} is VALID [2018-11-14 16:33:36,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 16:33:36,086 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {53#false} {53#false} #101#return; {53#false} is VALID [2018-11-14 16:33:36,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {53#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {53#false} is VALID [2018-11-14 16:33:36,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {53#false} assume !true; {53#false} is VALID [2018-11-14 16:33:36,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {53#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {53#false} is VALID [2018-11-14 16:33:36,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-14 16:33:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:33:36,103 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:33:36,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:33:36,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:33:36,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-14 16:33:36,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:36,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:33:36,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:36,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:33:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:33:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:33:36,367 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-14 16:33:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:36,611 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2018-11-14 16:33:36,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:33:36,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-14 16:33:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:33:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2018-11-14 16:33:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:33:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2018-11-14 16:33:36,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 99 transitions. [2018-11-14 16:33:37,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:37,023 INFO L225 Difference]: With dead ends: 85 [2018-11-14 16:33:37,023 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 16:33:37,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:33:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 16:33:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 16:33:37,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:37,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 16:33:37,071 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:33:37,072 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:33:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:37,077 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 16:33:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:33:37,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:37,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:37,080 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:33:37,080 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:33:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:37,092 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 16:33:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:33:37,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:37,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:37,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:37,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:33:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-14 16:33:37,099 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-11-14 16:33:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:37,099 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-14 16:33:37,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:33:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-14 16:33:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:33:37,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:37,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:37,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:37,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash -733954693, now seen corresponding path program 1 times [2018-11-14 16:33:37,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:37,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:37,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:37,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2018-11-14 16:33:37,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {371#true} is VALID [2018-11-14 16:33:37,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2018-11-14 16:33:37,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #107#return; {371#true} is VALID [2018-11-14 16:33:37,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret14 := main(); {371#true} is VALID [2018-11-14 16:33:37,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {371#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {391#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:33:37,414 INFO L256 TraceCheckUtils]: 6: Hoare triple {391#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {371#true} is VALID [2018-11-14 16:33:37,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {371#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {398#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:37,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(= |sll_create_#in~len| sll_create_~len)} assume true; {398#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:37,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {398#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:33:37,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:33:37,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:33:37,420 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {405#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {391#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #99#return; {372#false} is VALID [2018-11-14 16:33:37,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {372#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {372#false} is VALID [2018-11-14 16:33:37,421 INFO L256 TraceCheckUtils]: 14: Hoare triple {372#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {372#false} is VALID [2018-11-14 16:33:37,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {372#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {372#false} is VALID [2018-11-14 16:33:37,422 INFO L256 TraceCheckUtils]: 16: Hoare triple {372#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {372#false} is VALID [2018-11-14 16:33:37,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {372#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {372#false} is VALID [2018-11-14 16:33:37,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {372#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {372#false} is VALID [2018-11-14 16:33:37,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {372#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {372#false} is VALID [2018-11-14 16:33:37,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {372#false} assume true; {372#false} is VALID [2018-11-14 16:33:37,423 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {372#false} {372#false} #105#return; {372#false} is VALID [2018-11-14 16:33:37,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {372#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {372#false} is VALID [2018-11-14 16:33:37,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {372#false} assume true; {372#false} is VALID [2018-11-14 16:33:37,424 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {372#false} {372#false} #101#return; {372#false} is VALID [2018-11-14 16:33:37,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {372#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {372#false} is VALID [2018-11-14 16:33:37,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {372#false} assume true; {372#false} is VALID [2018-11-14 16:33:37,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {372#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {372#false} is VALID [2018-11-14 16:33:37,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {372#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {372#false} is VALID [2018-11-14 16:33:37,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {372#false} assume !false; {372#false} is VALID [2018-11-14 16:33:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:33:37,428 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:33:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:33:37,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:33:37,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 16:33:37,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:37,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:33:37,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:37,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:33:37,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:33:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:33:37,543 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-14 16:33:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:38,101 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 16:33:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:33:38,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 16:33:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:38,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:33:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-14 16:33:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:33:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-14 16:33:38,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2018-11-14 16:33:38,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:38,277 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:33:38,277 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:33:38,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:33:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:33:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-14 16:33:38,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:38,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2018-11-14 16:33:38,314 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2018-11-14 16:33:38,314 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2018-11-14 16:33:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:38,318 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 16:33:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 16:33:38,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:38,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:38,320 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2018-11-14 16:33:38,320 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2018-11-14 16:33:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:38,323 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 16:33:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 16:33:38,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:38,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:38,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:38,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:33:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-14 16:33:38,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 30 [2018-11-14 16:33:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:38,329 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-14 16:33:38,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:33:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 16:33:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 16:33:38,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:38,331 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:38,331 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:38,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1495371396, now seen corresponding path program 1 times [2018-11-14 16:33:38,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:38,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:38,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:38,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:38,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-14 16:33:38,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {683#true} is VALID [2018-11-14 16:33:38,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:38,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #107#return; {683#true} is VALID [2018-11-14 16:33:38,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret14 := main(); {683#true} is VALID [2018-11-14 16:33:38,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {703#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:33:38,627 INFO L256 TraceCheckUtils]: 6: Hoare triple {703#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {683#true} is VALID [2018-11-14 16:33:38,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {710#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:38,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(= |sll_create_#in~len| sll_create_~len)} assume true; {710#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:38,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {710#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:38,630 INFO L256 TraceCheckUtils]: 10: Hoare triple {710#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {683#true} is VALID [2018-11-14 16:33:38,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {683#true} is VALID [2018-11-14 16:33:38,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {683#true} is VALID [2018-11-14 16:33:38,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {683#true} is VALID [2018-11-14 16:33:38,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:38,633 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {683#true} {710#(= |sll_create_#in~len| sll_create_~len)} #95#return; {710#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:38,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {710#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:33:38,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {741#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:33:38,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {741#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {741#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:33:38,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {741#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:38,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:38,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:38,648 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {703#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #99#return; {684#false} is VALID [2018-11-14 16:33:38,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {684#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {684#false} is VALID [2018-11-14 16:33:38,649 INFO L256 TraceCheckUtils]: 24: Hoare triple {684#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {684#false} is VALID [2018-11-14 16:33:38,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {684#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {684#false} is VALID [2018-11-14 16:33:38,649 INFO L256 TraceCheckUtils]: 26: Hoare triple {684#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {684#false} is VALID [2018-11-14 16:33:38,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {684#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {684#false} is VALID [2018-11-14 16:33:38,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {684#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {684#false} is VALID [2018-11-14 16:33:38,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {684#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {684#false} is VALID [2018-11-14 16:33:38,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-14 16:33:38,652 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {684#false} {684#false} #105#return; {684#false} is VALID [2018-11-14 16:33:38,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {684#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {684#false} is VALID [2018-11-14 16:33:38,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-14 16:33:38,652 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {684#false} {684#false} #101#return; {684#false} is VALID [2018-11-14 16:33:38,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {684#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {684#false} is VALID [2018-11-14 16:33:38,653 INFO L273 TraceCheckUtils]: 36: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-14 16:33:38,653 INFO L273 TraceCheckUtils]: 37: Hoare triple {684#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {684#false} is VALID [2018-11-14 16:33:38,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {684#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {684#false} is VALID [2018-11-14 16:33:38,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-14 16:33:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:33:38,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:33:39,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-14 16:33:39,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {684#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {684#false} is VALID [2018-11-14 16:33:39,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {684#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {684#false} is VALID [2018-11-14 16:33:39,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-14 16:33:39,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {684#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {684#false} is VALID [2018-11-14 16:33:39,023 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {683#true} {684#false} #101#return; {684#false} is VALID [2018-11-14 16:33:39,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:39,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {683#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {683#true} is VALID [2018-11-14 16:33:39,024 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {683#true} {683#true} #105#return; {683#true} is VALID [2018-11-14 16:33:39,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:39,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {683#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {683#true} is VALID [2018-11-14 16:33:39,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {683#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {683#true} is VALID [2018-11-14 16:33:39,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {683#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {683#true} is VALID [2018-11-14 16:33:39,025 INFO L256 TraceCheckUtils]: 26: Hoare triple {683#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {683#true} is VALID [2018-11-14 16:33:39,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {683#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {683#true} is VALID [2018-11-14 16:33:39,026 INFO L256 TraceCheckUtils]: 24: Hoare triple {684#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {683#true} is VALID [2018-11-14 16:33:39,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {684#false} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {684#false} is VALID [2018-11-14 16:33:39,031 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {860#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #99#return; {684#false} is VALID [2018-11-14 16:33:39,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {748#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {873#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {873#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:33:39,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {873#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:33:39,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,060 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {683#true} {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #95#return; {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:39,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {683#true} is VALID [2018-11-14 16:33:39,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {683#true} is VALID [2018-11-14 16:33:39,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {683#true} is VALID [2018-11-14 16:33:39,062 INFO L256 TraceCheckUtils]: 10: Hoare triple {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {683#true} is VALID [2018-11-14 16:33:39,067 INFO L273 TraceCheckUtils]: 9: Hoare triple {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {880#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:39,071 INFO L256 TraceCheckUtils]: 6: Hoare triple {860#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {683#true} is VALID [2018-11-14 16:33:39,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {860#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:33:39,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret14 := main(); {683#true} is VALID [2018-11-14 16:33:39,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #107#return; {683#true} is VALID [2018-11-14 16:33:39,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-14 16:33:39,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {683#true} is VALID [2018-11-14 16:33:39,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-14 16:33:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:33:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:33:39,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:33:39,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-14 16:33:39,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:39,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:33:39,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:39,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:33:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:33:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:33:39,252 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-14 16:33:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:40,305 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-14 16:33:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:33:40,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-14 16:33:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:33:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-14 16:33:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:33:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-14 16:33:40,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2018-11-14 16:33:40,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:40,566 INFO L225 Difference]: With dead ends: 67 [2018-11-14 16:33:40,566 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 16:33:40,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:33:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 16:33:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-14 16:33:40,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:40,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-14 16:33:40,598 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-14 16:33:40,598 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-14 16:33:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:40,603 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-14 16:33:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-14 16:33:40,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:40,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:40,604 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-14 16:33:40,604 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-14 16:33:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:40,608 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-14 16:33:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-14 16:33:40,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:40,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:40,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:40,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:33:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 16:33:40,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 40 [2018-11-14 16:33:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:40,613 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 16:33:40,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:33:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 16:33:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 16:33:40,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:40,615 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:40,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:40,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash -70264771, now seen corresponding path program 2 times [2018-11-14 16:33:40,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:40,617 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:40,633 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:33:40,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:33:40,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:33:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:40,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:41,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 16:33:41,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 16:33:41,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:41,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 16:33:41,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:41,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 16:33:41,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-11-14 16:33:41,906 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:42,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-14 16:33:42,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:42,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 16:33:42,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:42,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:33:42,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-14 16:33:42,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 16:33:42,955 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:43,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2018-11-14 16:33:43,061 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,080 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,112 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:44, output treesize:8 [2018-11-14 16:33:43,134 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:43,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-14 16:33:43,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-11-14 16:33:43,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:43,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-14 16:33:43,414 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:43,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2018-11-14 16:33:43,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {1175#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1175#true} is VALID [2018-11-14 16:33:43,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #107#return; {1175#true} is VALID [2018-11-14 16:33:43,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret14 := main(); {1175#true} is VALID [2018-11-14 16:33:43,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {1175#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1195#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:43,434 INFO L256 TraceCheckUtils]: 6: Hoare triple {1195#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1175#true} is VALID [2018-11-14 16:33:43,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {1175#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1175#true} is VALID [2018-11-14 16:33:43,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {1175#true} assume !!~bvsgt32(~len, 0bv32); {1175#true} is VALID [2018-11-14 16:33:43,435 INFO L256 TraceCheckUtils]: 10: Hoare triple {1175#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1175#true} is VALID [2018-11-14 16:33:43,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1175#true} is VALID [2018-11-14 16:33:43,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1175#true} is VALID [2018-11-14 16:33:43,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1175#true} is VALID [2018-11-14 16:33:43,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,436 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1175#true} {1175#true} #95#return; {1175#true} is VALID [2018-11-14 16:33:43,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {1175#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1175#true} is VALID [2018-11-14 16:33:43,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {1175#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1175#true} is VALID [2018-11-14 16:33:43,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {1175#true} assume !!~bvsgt32(~len, 0bv32); {1175#true} is VALID [2018-11-14 16:33:43,437 INFO L256 TraceCheckUtils]: 20: Hoare triple {1175#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1175#true} is VALID [2018-11-14 16:33:43,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {1175#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1175#true} is VALID [2018-11-14 16:33:43,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1175#true} is VALID [2018-11-14 16:33:43,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {1175#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1175#true} is VALID [2018-11-14 16:33:43,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,438 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1175#true} {1175#true} #95#return; {1175#true} is VALID [2018-11-14 16:33:43,439 INFO L273 TraceCheckUtils]: 26: Hoare triple {1175#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1175#true} is VALID [2018-11-14 16:33:43,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {1175#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1175#true} is VALID [2018-11-14 16:33:43,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {1175#true} assume !~bvsgt32(~len, 0bv32); {1175#true} is VALID [2018-11-14 16:33:43,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {1175#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1175#true} is VALID [2018-11-14 16:33:43,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {1175#true} assume true; {1175#true} is VALID [2018-11-14 16:33:43,441 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1175#true} {1195#(= |main_~#s~0.offset| (_ bv0 32))} #99#return; {1195#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:43,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {1195#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {1195#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:33:43,441 INFO L256 TraceCheckUtils]: 34: Hoare triple {1195#(= |main_~#s~0.offset| (_ bv0 32))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1175#true} is VALID [2018-11-14 16:33:43,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {1175#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1286#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-14 16:33:43,442 INFO L256 TraceCheckUtils]: 36: Hoare triple {1286#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1175#true} is VALID [2018-11-14 16:33:43,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {1175#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1293#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:33:43,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {1293#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1293#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:33:43,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {1293#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1300#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:33:43,445 INFO L273 TraceCheckUtils]: 40: Hoare triple {1300#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1300#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:33:43,466 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1300#(not (= (_ bv0 32) |node_create_#res.base|))} {1286#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} #105#return; {1307#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (not (= (_ bv0 32) |sll_prepend_#t~ret6.base|)))} is VALID [2018-11-14 16:33:43,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {1307#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (not (= (_ bv0 32) |sll_prepend_#t~ret6.base|)))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1311#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:33:43,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {1311#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} assume true; {1311#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:33:43,500 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1311#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} {1195#(= |main_~#s~0.offset| (_ bv0 32))} #101#return; {1318#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:33:43,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {1318#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {1322#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:33:43,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {1322#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {1322#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:33:43,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {1322#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1176#false} is VALID [2018-11-14 16:33:43,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {1176#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1176#false} is VALID [2018-11-14 16:33:43,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2018-11-14 16:33:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 16:33:43,511 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:33:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:33:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 16:33:43,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-14 16:33:43,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:43,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:33:43,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:43,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:33:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:33:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:33:43,609 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 10 states. [2018-11-14 16:33:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:44,696 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 16:33:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:33:44,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-14 16:33:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:33:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-11-14 16:33:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:33:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-11-14 16:33:44,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2018-11-14 16:33:44,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:44,842 INFO L225 Difference]: With dead ends: 50 [2018-11-14 16:33:44,843 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 16:33:44,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:33:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 16:33:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-14 16:33:44,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:44,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2018-11-14 16:33:44,949 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2018-11-14 16:33:44,949 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2018-11-14 16:33:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:44,951 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 16:33:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 16:33:44,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:44,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:44,953 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2018-11-14 16:33:44,953 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2018-11-14 16:33:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:44,955 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 16:33:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 16:33:44,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:44,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:44,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:44,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:33:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-14 16:33:44,959 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 50 [2018-11-14 16:33:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:44,960 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-14 16:33:44,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:33:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 16:33:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 16:33:44,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:44,962 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:44,962 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:44,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -70263097, now seen corresponding path program 1 times [2018-11-14 16:33:44,963 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:44,963 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:44,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:33:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:45,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:45,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:33:45,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:33:45,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:45,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:45,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:45,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 16:33:45,613 INFO L303 Elim1Store]: Index analysis took 175 ms [2018-11-14 16:33:45,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-14 16:33:45,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-14 16:33:45,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:46,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-14 16:33:46,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 34 [2018-11-14 16:33:47,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-14 16:33:47,175 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:47,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-14 16:33:47,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:47,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:33:48,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-14 16:33:48,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-14 16:33:48,180 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:48,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-14 16:33:48,488 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:48,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:48,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:48,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-11-14 16:33:48,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-14 16:33:48,789 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-11-14 16:33:49,035 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-14 16:33:49,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-14 16:33:49,353 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-11-14 16:33:49,445 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:49,476 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:33:49,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 45 [2018-11-14 16:33:49,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-14 16:33:49,628 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-14 16:33:49,726 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-14 16:33:49,745 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,763 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:49,778 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:78, output treesize:19 [2018-11-14 16:33:55,735 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:55,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:33:55,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:33:55,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:33:55,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 16:33:55,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-14 16:33:55,933 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:55,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:33:55,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:33:55,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:55,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:56,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-14 16:33:56,007 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:56,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2018-11-14 16:33:56,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1566#true} is VALID [2018-11-14 16:33:56,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #107#return; {1566#true} is VALID [2018-11-14 16:33:56,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret14 := main(); {1566#true} is VALID [2018-11-14 16:33:56,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {1566#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:56,041 INFO L256 TraceCheckUtils]: 6: Hoare triple {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1566#true} is VALID [2018-11-14 16:33:56,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {1566#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1566#true} is VALID [2018-11-14 16:33:56,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {1566#true} assume !!~bvsgt32(~len, 0bv32); {1566#true} is VALID [2018-11-14 16:33:56,042 INFO L256 TraceCheckUtils]: 10: Hoare triple {1566#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1566#true} is VALID [2018-11-14 16:33:56,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {1566#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1566#true} is VALID [2018-11-14 16:33:56,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {1566#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1566#true} is VALID [2018-11-14 16:33:56,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {1566#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1566#true} is VALID [2018-11-14 16:33:56,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,043 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1566#true} {1566#true} #95#return; {1566#true} is VALID [2018-11-14 16:33:56,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {1566#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1566#true} is VALID [2018-11-14 16:33:56,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {1566#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1566#true} is VALID [2018-11-14 16:33:56,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !!~bvsgt32(~len, 0bv32); {1566#true} is VALID [2018-11-14 16:33:56,044 INFO L256 TraceCheckUtils]: 20: Hoare triple {1566#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1566#true} is VALID [2018-11-14 16:33:56,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {1566#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1566#true} is VALID [2018-11-14 16:33:56,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {1566#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1566#true} is VALID [2018-11-14 16:33:56,045 INFO L273 TraceCheckUtils]: 23: Hoare triple {1566#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1566#true} is VALID [2018-11-14 16:33:56,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,045 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1566#true} {1566#true} #95#return; {1566#true} is VALID [2018-11-14 16:33:56,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {1566#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1566#true} is VALID [2018-11-14 16:33:56,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {1566#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1566#true} is VALID [2018-11-14 16:33:56,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#true} assume !~bvsgt32(~len, 0bv32); {1566#true} is VALID [2018-11-14 16:33:56,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1566#true} is VALID [2018-11-14 16:33:56,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {1566#true} assume true; {1566#true} is VALID [2018-11-14 16:33:56,048 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1566#true} {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #99#return; {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:56,049 INFO L273 TraceCheckUtils]: 33: Hoare triple {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:56,049 INFO L256 TraceCheckUtils]: 34: Hoare triple {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1566#true} is VALID [2018-11-14 16:33:56,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {1566#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1677#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-14 16:33:56,050 INFO L256 TraceCheckUtils]: 36: Hoare triple {1677#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1566#true} is VALID [2018-11-14 16:33:56,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {1566#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1684#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:56,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {1684#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1684#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:56,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {1684#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1691#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:33:56,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {1691#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1691#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:33:56,056 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1691#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1677#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} #105#return; {1698#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-14 16:33:56,060 INFO L273 TraceCheckUtils]: 42: Hoare triple {1698#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1702#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:33:56,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {1702#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32))))} assume true; {1702#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:33:56,064 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1702#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32))))} {1586#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #101#return; {1709#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:56,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {1709#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {1713#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:56,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {1713#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {1713#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:33:56,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {1713#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1720#(and (= |main_#t~mem11| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:33:56,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {1720#(and (= |main_#t~mem11| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem11;havoc #t~mem11; {1567#false} is VALID [2018-11-14 16:33:56,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2018-11-14 16:33:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 16:33:56,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:33:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:33:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-14 16:33:56,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-14 16:33:56,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:33:56,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:33:56,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:33:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:33:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:33:56,133 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 11 states. [2018-11-14 16:33:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:57,791 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 16:33:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:33:57,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-14 16:33:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:33:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:33:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2018-11-14 16:33:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:33:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2018-11-14 16:33:57,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2018-11-14 16:33:57,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:33:57,907 INFO L225 Difference]: With dead ends: 47 [2018-11-14 16:33:57,907 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 16:33:57,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:33:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 16:33:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 16:33:57,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:33:57,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 16:33:57,948 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:33:57,949 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:33:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:57,951 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-14 16:33:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:33:57,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:57,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:57,952 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:33:57,953 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:33:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:33:57,955 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-14 16:33:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:33:57,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:33:57,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:33:57,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:33:57,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:33:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 16:33:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-14 16:33:57,958 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 50 [2018-11-14 16:33:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:33:57,959 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-14 16:33:57,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:33:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 16:33:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:33:57,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:33:57,960 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:33:57,960 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:33:57,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:33:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1557593962, now seen corresponding path program 1 times [2018-11-14 16:33:57,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:33:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:33:57,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:33:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:33:58,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:33:58,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:33:58,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-14 16:33:58,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:58,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:58,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:33:58,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-14 16:33:58,407 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:33:58,881 INFO L303 Elim1Store]: Index analysis took 192 ms [2018-11-14 16:33:58,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-14 16:33:58,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-14 16:33:58,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:33:59,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-14 16:33:59,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:00,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-14 16:34:00,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-14 16:34:00,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:00,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:01,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-14 16:34:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-14 16:34:01,064 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-14 16:34:01,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-14 16:34:01,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:01,331 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:34:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:01,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:01,504 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:87, output treesize:59 [2018-11-14 16:34:03,611 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:05,770 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-14 16:34:05,930 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2018-11-14 16:34:06,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 45 [2018-11-14 16:34:06,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 35 [2018-11-14 16:34:06,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:06,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:06,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-14 16:34:06,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:06,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 40 [2018-11-14 16:34:06,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:06,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-11-14 16:34:06,838 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:06,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:06,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-14 16:34:06,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:07,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-14 16:34:07,023 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:34:07,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-14 16:34:07,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-14 16:34:07,339 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-14 16:34:07,443 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,471 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:07,506 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:70, output treesize:23 [2018-11-14 16:34:11,750 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:11,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:34:11,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:34:11,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:11,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:11,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:11,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-11-14 16:34:11,884 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:11,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2018-11-14 16:34:11,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 11 [2018-11-14 16:34:11,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:12,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-14 16:34:12,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:12,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:12,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:12,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:4 [2018-11-14 16:34:12,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:12,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {1955#true} call ULTIMATE.init(); {1955#true} is VALID [2018-11-14 16:34:12,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {1955#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1955#true} is VALID [2018-11-14 16:34:12,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:12,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1955#true} {1955#true} #107#return; {1955#true} is VALID [2018-11-14 16:34:12,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {1955#true} call #t~ret14 := main(); {1955#true} is VALID [2018-11-14 16:34:12,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {1955#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1975#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:34:12,125 INFO L256 TraceCheckUtils]: 6: Hoare triple {1975#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1955#true} is VALID [2018-11-14 16:34:12,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {1955#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1955#true} is VALID [2018-11-14 16:34:12,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:12,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1955#true} assume !!~bvsgt32(~len, 0bv32); {1955#true} is VALID [2018-11-14 16:34:12,126 INFO L256 TraceCheckUtils]: 10: Hoare triple {1955#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1955#true} is VALID [2018-11-14 16:34:12,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1955#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1955#true} is VALID [2018-11-14 16:34:12,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {1955#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1955#true} is VALID [2018-11-14 16:34:12,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {1955#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1955#true} is VALID [2018-11-14 16:34:12,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:12,127 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1955#true} {1955#true} #95#return; {1955#true} is VALID [2018-11-14 16:34:12,127 INFO L273 TraceCheckUtils]: 16: Hoare triple {1955#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1955#true} is VALID [2018-11-14 16:34:12,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {1955#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1955#true} is VALID [2018-11-14 16:34:12,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:12,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {1955#true} assume !!~bvsgt32(~len, 0bv32); {1955#true} is VALID [2018-11-14 16:34:12,128 INFO L256 TraceCheckUtils]: 20: Hoare triple {1955#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1955#true} is VALID [2018-11-14 16:34:12,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {1955#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:34:12,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:34:12,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2031#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:34:12,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {2031#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {2031#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:34:12,132 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2031#(not (= (_ bv0 32) |node_create_#res.base|))} {1955#true} #95#return; {2038#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} is VALID [2018-11-14 16:34:12,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {2038#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:12,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:12,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:12,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:12,135 INFO L273 TraceCheckUtils]: 30: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:34:12,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:34:12,137 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} {1975#(= |main_~#s~0.offset| (_ bv0 32))} #99#return; {2062#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret8.base|)))} is VALID [2018-11-14 16:34:12,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {2062#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret8.base|)))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:34:12,140 INFO L256 TraceCheckUtils]: 34: Hoare triple {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:34:12,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:12,142 INFO L256 TraceCheckUtils]: 36: Hoare triple {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:34:12,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:12,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:12,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:12,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:12,151 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #105#return; {2095#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base| (store (select |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base|) (bvadd |sll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-14 16:34:12,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {2095#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base| (store (select |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base|) (bvadd |sll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:34:12,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} assume true; {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:34:12,172 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #101#return; {2106#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:12,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {2106#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:34:12,175 INFO L273 TraceCheckUtils]: 46: Hoare triple {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:34:12,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2117#(not (= main_~temp~2.base (_ bv0 32)))} is VALID [2018-11-14 16:34:12,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {2117#(not (= main_~temp~2.base (_ bv0 32)))} assume !(~data~0 != #t~mem11);havoc #t~mem11;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post12 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2121#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:34:12,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {2121#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {2121#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:34:12,177 INFO L273 TraceCheckUtils]: 50: Hoare triple {2121#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1956#false} is VALID [2018-11-14 16:34:12,178 INFO L273 TraceCheckUtils]: 51: Hoare triple {1956#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1956#false} is VALID [2018-11-14 16:34:12,178 INFO L273 TraceCheckUtils]: 52: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2018-11-14 16:34:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:34:12,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:34:13,573 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 16:34:13,814 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 16:34:14,204 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 16:34:14,562 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:34:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:34:15,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:34:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:15,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:15,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:34:15,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-14 16:34:15,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:15,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:15,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:15,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-14 16:34:15,386 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:15,659 INFO L303 Elim1Store]: Index analysis took 220 ms [2018-11-14 16:34:15,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-14 16:34:15,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-14 16:34:15,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:16,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-14 16:34:16,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:17,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-14 16:34:17,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-14 16:34:17,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:17,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:18,420 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-14 16:34:18,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-14 16:34:18,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-14 16:34:18,463 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:18,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-14 16:34:18,678 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-14 16:34:18,804 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:34:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:18,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:18,959 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:87, output treesize:59 [2018-11-14 16:34:21,060 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:21,246 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2018-11-14 16:34:21,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 45 [2018-11-14 16:34:21,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 35 [2018-11-14 16:34:21,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:21,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:21,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-14 16:34:21,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-14 16:34:22,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:22,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-14 16:34:22,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-14 16:34:22,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-14 16:34:22,371 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:22,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-14 16:34:22,461 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,488 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:22,556 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:70, output treesize:23 [2018-11-14 16:34:25,719 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:25,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:34:25,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:34:25,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:25,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-11-14 16:34:25,787 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:25,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2018-11-14 16:34:25,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 11 [2018-11-14 16:34:25,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-14 16:34:25,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:25,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:4 [2018-11-14 16:34:25,873 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:25,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {1955#true} call ULTIMATE.init(); {1955#true} is VALID [2018-11-14 16:34:25,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1955#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1955#true} is VALID [2018-11-14 16:34:25,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:25,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1955#true} {1955#true} #107#return; {1955#true} is VALID [2018-11-14 16:34:25,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {1955#true} call #t~ret14 := main(); {1955#true} is VALID [2018-11-14 16:34:25,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {1955#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1975#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 16:34:25,877 INFO L256 TraceCheckUtils]: 6: Hoare triple {1975#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {1955#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {1955#true} assume !!~bvsgt32(~len, 0bv32); {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L256 TraceCheckUtils]: 10: Hoare triple {1955#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {1955#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1955#true} is VALID [2018-11-14 16:34:25,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {1955#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {1955#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1955#true} {1955#true} #95#return; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {1955#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {1955#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {1955#true} assume true; {1955#true} is VALID [2018-11-14 16:34:25,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {1955#true} assume !!~bvsgt32(~len, 0bv32); {1955#true} is VALID [2018-11-14 16:34:25,879 INFO L256 TraceCheckUtils]: 20: Hoare triple {1955#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1955#true} is VALID [2018-11-14 16:34:25,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {1955#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:34:25,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 16:34:25,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {2024#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2031#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:34:25,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {2031#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {2031#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 16:34:25,882 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2031#(not (= (_ bv0 32) |node_create_#res.base|))} {1955#true} #95#return; {2038#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} is VALID [2018-11-14 16:34:25,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {2038#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:25,884 INFO L273 TraceCheckUtils]: 27: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:25,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:25,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:34:25,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {2042#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:34:25,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:34:25,898 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2055#(not (= (_ bv0 32) |sll_create_#res.base|))} {1975#(= |main_~#s~0.offset| (_ bv0 32))} #99#return; {2062#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret8.base|)))} is VALID [2018-11-14 16:34:25,899 INFO L273 TraceCheckUtils]: 33: Hoare triple {2062#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret8.base|)))} call write~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 16:34:25,900 INFO L256 TraceCheckUtils]: 34: Hoare triple {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:34:25,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:25,901 INFO L256 TraceCheckUtils]: 36: Hoare triple {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 16:34:25,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {2070#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:25,903 INFO L273 TraceCheckUtils]: 38: Hoare triple {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 16:34:25,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {2081#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:25,908 INFO L273 TraceCheckUtils]: 40: Hoare triple {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:25,910 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2088#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32)) (_ bv0 32)))) (= |node_create_#res.offset| (_ bv0 32)))} {2074#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #105#return; {2095#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base| (store (select |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base|) (bvadd |sll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-14 16:34:25,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {2095#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= (store |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base| (store (select |old(#memory_$Pointer$.base)| |sll_prepend_#t~ret6.base|) (bvadd |sll_prepend_#t~ret6.offset| (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:34:25,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} assume true; {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-14 16:34:25,932 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2099#(and (exists ((sll_prepend_~new_head~1.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select (store |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (_ bv4 32) (_ bv0 32))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))} {2066#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #101#return; {2106#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:34:25,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {2106#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:34:25,935 INFO L273 TraceCheckUtils]: 46: Hoare triple {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:34:25,937 INFO L273 TraceCheckUtils]: 47: Hoare triple {2110#(and (exists ((|main_~#s~0.base| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)) main_~ptr~0.base) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32))) (_ bv4 32)))))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2117#(not (= main_~temp~2.base (_ bv0 32)))} is VALID [2018-11-14 16:34:25,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {2117#(not (= main_~temp~2.base (_ bv0 32)))} assume !(~data~0 != #t~mem11);havoc #t~mem11;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post12 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2121#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:34:25,938 INFO L273 TraceCheckUtils]: 49: Hoare triple {2121#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {2121#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 16:34:25,939 INFO L273 TraceCheckUtils]: 50: Hoare triple {2121#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1956#false} is VALID [2018-11-14 16:34:25,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {1956#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1956#false} is VALID [2018-11-14 16:34:25,940 INFO L273 TraceCheckUtils]: 52: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2018-11-14 16:34:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:34:25,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:34:27,342 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-14 16:34:27,647 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 16:34:28,303 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 16:34:28,783 WARN L179 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:34:29,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:34:29,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-14 16:34:29,517 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-11-14 16:34:29,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:29,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:34:29,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:29,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:34:29,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:34:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:34:29,618 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 20 states. [2018-11-14 16:34:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:34,981 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-14 16:34:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:34:34,981 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-11-14 16:34:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:34:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2018-11-14 16:34:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:34:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2018-11-14 16:34:34,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 54 transitions. [2018-11-14 16:34:35,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:35,177 INFO L225 Difference]: With dead ends: 53 [2018-11-14 16:34:35,177 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:34:35,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:34:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:34:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-14 16:34:35,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:35,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-14 16:34:35,238 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-14 16:34:35,238 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-14 16:34:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:35,241 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 16:34:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 16:34:35,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:35,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:35,242 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-14 16:34:35,242 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-14 16:34:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:35,245 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-14 16:34:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 16:34:35,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:35,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:35,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:35,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:34:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 16:34:35,248 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 53 [2018-11-14 16:34:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:35,248 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 16:34:35,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:34:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 16:34:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:34:35,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:35,250 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:34:35,250 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:35,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1557592288, now seen corresponding path program 1 times [2018-11-14 16:34:35,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:35,251 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:34:35,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:35,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:35,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:34:35,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:35,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:35,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-14 16:34:35,541 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:37,603 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-14 16:34:40,633 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-14 16:34:40,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:34:40,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:34:40,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:40,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:40,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:40,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-14 16:34:41,810 WARN L179 SmtUtils]: Spent 981.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 16:34:43,877 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 16:34:46,061 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 16:34:46,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:46,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:34:46,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-14 16:34:46,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-14 16:34:46,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:46,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:46,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:46,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:38 [2018-11-14 16:34:48,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:48,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:34:48,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:34:48,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:34:48,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:34:48,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:34:48,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:34:48,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:54 [2018-11-14 16:34:48,911 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:34:51,514 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-14 16:34:53,929 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 36