/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:09:12,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:09:12,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:09:12,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:09:12,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:09:12,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:09:12,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:09:12,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:09:12,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:09:12,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:09:12,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:09:12,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:09:12,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:09:12,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:09:12,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:09:12,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:09:12,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:09:12,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:09:12,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:09:12,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:09:12,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:09:12,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:09:12,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:09:12,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:09:12,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:09:12,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:09:12,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:09:12,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:09:12,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:09:12,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:09:12,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:09:12,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:09:12,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:09:12,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:09:12,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:09:12,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:09:12,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:09:12,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:09:12,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:09:12,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:09:12,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:09:12,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:09:12,091 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:09:12,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:09:12,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:09:12,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:09:12,092 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:09:12,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:09:12,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:09:12,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:09:12,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:09:12,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:09:12,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:09:12,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:09:12,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:09:12,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:09:12,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:09:12,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:09:12,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:09:12,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:09:12,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:09:12,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:09:12,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:09:12,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:09:12,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:09:12,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:09:12,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:09:12,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:09:12,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:09:12,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:09:12,423 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:09:12,424 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:09:12,424 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2020-07-10 15:09:12,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e98d73bf/00609b084d15481b8cc84cd9d47fc7bc/FLAG623ecddff [2020-07-10 15:09:13,079 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:09:13,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-1.i [2020-07-10 15:09:13,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e98d73bf/00609b084d15481b8cc84cd9d47fc7bc/FLAG623ecddff [2020-07-10 15:09:13,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e98d73bf/00609b084d15481b8cc84cd9d47fc7bc [2020-07-10 15:09:13,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:09:13,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:09:13,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:13,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:09:13,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:09:13,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:13" (1/1) ... [2020-07-10 15:09:13,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de36573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:13, skipping insertion in model container [2020-07-10 15:09:13,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:13" (1/1) ... [2020-07-10 15:09:13,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:09:13,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:09:13,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:13,886 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:09:13,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:14,016 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:09:14,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14 WrapperNode [2020-07-10 15:09:14,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:14,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:09:14,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:09:14,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:09:14,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... [2020-07-10 15:09:14,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:09:14,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:09:14,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:09:14,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:09:14,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:09:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:09:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:09:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:09:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:09:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die [2020-07-10 15:09:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2020-07-10 15:09:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2020-07-10 15:09:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2020-07-10 15:09:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 15:09:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:09:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:09:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:09:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:09:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:09:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:09:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:09:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:09:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:09:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:09:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:09:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:09:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:09:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:09:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:09:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:09:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:09:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:09:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:09:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:09:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:09:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:09:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:09:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:09:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:09:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:09:14,211 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:09:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:09:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:09:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:09:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:09:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:09:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:09:14,214 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:09:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:09:14,215 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:09:14,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:09:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:09:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:09:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:09:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:09:14,217 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:09:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:09:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:09:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:09:14,218 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:09:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:09:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:09:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:09:14,219 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:09:14,220 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:09:14,221 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:09:14,221 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:09:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:09:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:09:14,222 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:09:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:09:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:09:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:09:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:09:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:09:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:09:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die [2020-07-10 15:09:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:09:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2020-07-10 15:09:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:09:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:09:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:09:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:09:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:09:14,569 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 15:09:15,115 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:09:15,116 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 15:09:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:15 BoogieIcfgContainer [2020-07-10 15:09:15,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:09:15,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:09:15,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:09:15,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:09:15,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:09:13" (1/3) ... [2020-07-10 15:09:15,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5038bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:15, skipping insertion in model container [2020-07-10 15:09:15,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:14" (2/3) ... [2020-07-10 15:09:15,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5038bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:15, skipping insertion in model container [2020-07-10 15:09:15,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:15" (3/3) ... [2020-07-10 15:09:15,145 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-1.i [2020-07-10 15:09:15,156 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:09:15,167 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:09:15,181 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:09:15,207 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:09:15,207 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:09:15,207 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:09:15,208 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:09:15,208 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:09:15,208 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:09:15,208 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:09:15,208 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:09:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-07-10 15:09:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:09:15,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:15,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:15,237 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash 407034730, now seen corresponding path program 1 times [2020-07-10 15:09:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:15,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975444945] [2020-07-10 15:09:15,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:15,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {57#true} is VALID [2020-07-10 15:09:15,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2020-07-10 15:09:15,446 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #165#return; {57#true} is VALID [2020-07-10 15:09:15,450 INFO L263 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:15,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {57#true} is VALID [2020-07-10 15:09:15,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2020-07-10 15:09:15,451 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #165#return; {57#true} is VALID [2020-07-10 15:09:15,452 INFO L263 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret38 := main(); {57#true} is VALID [2020-07-10 15:09:15,452 INFO L280 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {57#true} is VALID [2020-07-10 15:09:15,452 INFO L280 TraceCheckUtils]: 6: Hoare triple {57#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {57#true} is VALID [2020-07-10 15:09:15,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {57#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {57#true} is VALID [2020-07-10 15:09:15,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2020-07-10 15:09:15,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {58#false} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {58#false} is VALID [2020-07-10 15:09:15,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {58#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {58#false} is VALID [2020-07-10 15:09:15,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {58#false} assume 2 != #t~mem34;havoc #t~mem34; {58#false} is VALID [2020-07-10 15:09:15,455 INFO L280 TraceCheckUtils]: 12: Hoare triple {58#false} assume !false; {58#false} is VALID [2020-07-10 15:09:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:15,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975444945] [2020-07-10 15:09:15,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:15,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:09:15,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680520896] [2020-07-10 15:09:15,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:09:15,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:15,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:09:15,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:15,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:09:15,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:15,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:09:15,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:09:15,514 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2020-07-10 15:09:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:15,932 INFO L93 Difference]: Finished difference Result 95 states and 129 transitions. [2020-07-10 15:09:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:09:15,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:09:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:09:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-10 15:09:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:09:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-07-10 15:09:15,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2020-07-10 15:09:16,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:16,162 INFO L225 Difference]: With dead ends: 95 [2020-07-10 15:09:16,162 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:09:16,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:09:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:09:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:09:16,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:16,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:09:16,208 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:09:16,208 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:09:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:16,211 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:09:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:09:16,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:16,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:16,213 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:09:16,213 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:09:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:16,216 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:09:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:09:16,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:16,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:16,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:16,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:09:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:09:16,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-10 15:09:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:16,221 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:09:16,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:09:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:09:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:09:16,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:16,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:16,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:09:16,223 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -709462780, now seen corresponding path program 1 times [2020-07-10 15:09:16,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:16,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185826053] [2020-07-10 15:09:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:16,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {260#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {252#true} is VALID [2020-07-10 15:09:16,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {252#true} assume true; {252#true} is VALID [2020-07-10 15:09:16,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {252#true} {252#true} #165#return; {252#true} is VALID [2020-07-10 15:09:16,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {252#true} call ULTIMATE.init(); {260#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:16,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {260#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {252#true} is VALID [2020-07-10 15:09:16,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {252#true} assume true; {252#true} is VALID [2020-07-10 15:09:16,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {252#true} {252#true} #165#return; {252#true} is VALID [2020-07-10 15:09:16,419 INFO L263 TraceCheckUtils]: 4: Hoare triple {252#true} call #t~ret38 := main(); {252#true} is VALID [2020-07-10 15:09:16,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {252#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {252#true} is VALID [2020-07-10 15:09:16,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {252#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {252#true} is VALID [2020-07-10 15:09:16,425 INFO L280 TraceCheckUtils]: 7: Hoare triple {252#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:09:16,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:09:16,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet31);havoc #t~nondet31; {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:09:16,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {258#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:09:16,432 INFO L280 TraceCheckUtils]: 11: Hoare triple {258#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {259#(= |main_#t~mem34| 2)} is VALID [2020-07-10 15:09:16,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {259#(= |main_#t~mem34| 2)} assume 2 != #t~mem34;havoc #t~mem34; {253#false} is VALID [2020-07-10 15:09:16,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {253#false} assume !false; {253#false} is VALID [2020-07-10 15:09:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:16,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185826053] [2020-07-10 15:09:16,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:16,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:09:16,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553852164] [2020-07-10 15:09:16,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:09:16,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:16,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:09:16,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:16,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:09:16,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:09:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:09:16,474 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-07-10 15:09:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:16,787 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-10 15:09:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:09:16,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:09:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-10 15:09:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-10 15:09:16,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-10 15:09:16,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:16,846 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:09:16,847 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:09:16,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:09:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:09:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-07-10 15:09:16,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:16,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2020-07-10 15:09:16,862 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2020-07-10 15:09:16,862 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2020-07-10 15:09:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:16,865 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:09:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:09:16,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:16,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:16,866 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2020-07-10 15:09:16,866 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2020-07-10 15:09:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:16,869 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:09:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:09:16,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:16,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:16,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:16,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:09:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 15:09:16,872 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2020-07-10 15:09:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:16,872 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 15:09:16,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:09:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 15:09:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:09:16,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:16,873 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:16,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:09:16,874 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -66753378, now seen corresponding path program 1 times [2020-07-10 15:09:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:16,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197478617] [2020-07-10 15:09:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:17,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {402#true} is VALID [2020-07-10 15:09:17,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#true} assume true; {402#true} is VALID [2020-07-10 15:09:17,070 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {402#true} {402#true} #165#return; {402#true} is VALID [2020-07-10 15:09:17,072 INFO L263 TraceCheckUtils]: 0: Hoare triple {402#true} call ULTIMATE.init(); {411#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:17,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {411#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {402#true} is VALID [2020-07-10 15:09:17,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#true} assume true; {402#true} is VALID [2020-07-10 15:09:17,073 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {402#true} {402#true} #165#return; {402#true} is VALID [2020-07-10 15:09:17,073 INFO L263 TraceCheckUtils]: 4: Hoare triple {402#true} call #t~ret38 := main(); {402#true} is VALID [2020-07-10 15:09:17,074 INFO L280 TraceCheckUtils]: 5: Hoare triple {402#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {407#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:09:17,075 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {407#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:09:17,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,077 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet31);havoc #t~nondet31; {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,080 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,081 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,082 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem34);havoc #t~mem34; {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,083 INFO L280 TraceCheckUtils]: 13: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {410#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-10 15:09:17,084 INFO L280 TraceCheckUtils]: 14: Hoare triple {410#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {403#false} is VALID [2020-07-10 15:09:17,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {403#false} assume 2 != #t~mem34;havoc #t~mem34; {403#false} is VALID [2020-07-10 15:09:17,085 INFO L280 TraceCheckUtils]: 16: Hoare triple {403#false} assume !false; {403#false} is VALID [2020-07-10 15:09:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:17,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197478617] [2020-07-10 15:09:17,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813523861] [2020-07-10 15:09:17,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:17,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:09:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:17,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:17,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-07-10 15:09:17,360 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,370 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:17,373 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2020-07-10 15:09:17,374 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,380 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:17,380 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,380 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-10 15:09:17,442 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:09:17,444 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,451 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:17,454 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:09:17,458 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,463 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:17,464 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:17,464 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-10 15:09:17,467 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:17,468 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4))) (and (= .cse0 main_~p~0.base) (= 0 .cse1) (= .cse1 main_~p~0.offset) (= 0 .cse0))) [2020-07-10 15:09:17,468 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 0 main_~p~0.base)) [2020-07-10 15:09:17,475 INFO L263 TraceCheckUtils]: 0: Hoare triple {402#true} call ULTIMATE.init(); {402#true} is VALID [2020-07-10 15:09:17,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {402#true} is VALID [2020-07-10 15:09:17,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#true} assume true; {402#true} is VALID [2020-07-10 15:09:17,476 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {402#true} {402#true} #165#return; {402#true} is VALID [2020-07-10 15:09:17,479 INFO L263 TraceCheckUtils]: 4: Hoare triple {402#true} call #t~ret38 := main(); {402#true} is VALID [2020-07-10 15:09:17,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {402#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {407#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:09:17,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {407#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:09:17,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,486 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet31);havoc #t~nondet31; {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:09:17,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem34);havoc #t~mem34; {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:09:17,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {409#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {410#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-10 15:09:17,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {410#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {403#false} is VALID [2020-07-10 15:09:17,494 INFO L280 TraceCheckUtils]: 15: Hoare triple {403#false} assume 2 != #t~mem34;havoc #t~mem34; {403#false} is VALID [2020-07-10 15:09:17,494 INFO L280 TraceCheckUtils]: 16: Hoare triple {403#false} assume !false; {403#false} is VALID [2020-07-10 15:09:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:09:17,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:17,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2020-07-10 15:09:17,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378866149] [2020-07-10 15:09:17,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:09:17,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:17,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:09:17,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:17,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:09:17,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:09:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:09:17,530 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2020-07-10 15:09:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:17,806 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:09:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:09:17,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:09:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:09:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:09:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:09:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:09:17,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-10 15:09:17,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:17,896 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:09:17,897 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 15:09:17,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:09:17,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 15:09:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-07-10 15:09:17,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:17,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2020-07-10 15:09:17,911 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2020-07-10 15:09:17,911 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2020-07-10 15:09:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:17,913 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 15:09:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:09:17,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:17,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:17,915 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2020-07-10 15:09:17,915 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2020-07-10 15:09:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:17,917 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 15:09:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:09:17,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:17,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:17,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:17,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:09:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 15:09:17,919 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-10 15:09:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:17,920 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 15:09:17,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:09:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:09:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:09:17,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:17,921 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:18,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:09:18,128 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1381959275, now seen corresponding path program 1 times [2020-07-10 15:09:18,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:18,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818255307] [2020-07-10 15:09:18,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:18,240 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:09:18,240 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:09:18,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:09:18,270 WARN L170 areAnnotationChecker]: sl_random_insertENTRY has no Hoare annotation [2020-07-10 15:09:18,270 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailENTRY has no Hoare annotation [2020-07-10 15:09:18,270 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:09:18,270 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: destroy_slENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: alloc_or_dieENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:09:18,271 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailFINAL has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:09:18,272 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: alloc_or_dieFINAL has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailEXIT has no Hoare annotation [2020-07-10 15:09:18,273 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L570-4 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2020-07-10 15:09:18,274 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: destroy_slFINAL has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L557-6 has no Hoare annotation [2020-07-10 15:09:18,275 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: destroy_slEXIT has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L590-4 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2020-07-10 15:09:18,276 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-10 15:09:18,277 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L562-2 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:09:18,278 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: sl_random_insertEXIT has no Hoare annotation [2020-07-10 15:09:18,279 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:09:18,280 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2020-07-10 15:09:18,280 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2020-07-10 15:09:18,280 WARN L170 areAnnotationChecker]: L601-2 has no Hoare annotation [2020-07-10 15:09:18,280 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:09:18,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:09:18 BoogieIcfgContainer [2020-07-10 15:09:18,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:09:18,285 INFO L168 Benchmark]: Toolchain (without parser) took 4930.65 ms. Allocated memory was 144.7 MB in the beginning and 250.6 MB in the end (delta: 105.9 MB). Free memory was 100.1 MB in the beginning and 165.7 MB in the end (delta: -65.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,286 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.97 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 167.1 MB in the end (delta: -67.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,288 INFO L168 Benchmark]: Boogie Preprocessor took 121.06 ms. Allocated memory is still 202.9 MB. Free memory was 167.1 MB in the beginning and 163.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,289 INFO L168 Benchmark]: RCFGBuilder took 982.73 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 163.0 MB in the beginning and 205.8 MB in the end (delta: -42.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,289 INFO L168 Benchmark]: TraceAbstraction took 3157.87 ms. Allocated memory was 233.8 MB in the beginning and 250.6 MB in the end (delta: 16.8 MB). Free memory was 204.4 MB in the beginning and 165.7 MB in the end (delta: 38.8 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:18,293 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 660.97 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 167.1 MB in the end (delta: -67.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.06 ms. Allocated memory is still 202.9 MB. Free memory was 167.1 MB in the beginning and 163.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 982.73 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 163.0 MB in the beginning and 205.8 MB in the end (delta: -42.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3157.87 ms. Allocated memory was 233.8 MB in the beginning and 250.6 MB in the end (delta: 16.8 MB). Free memory was 204.4 MB in the beginning and 165.7 MB in the end (delta: 38.8 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L586] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L593] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L600] COND TRUE p!=0 [L601] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L601] COND TRUE p->h != 2 [L602] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 81 SDtfs, 56 SDslu, 76 SDs, 0 SdLazy, 141 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4732 SizeOfPredicates, 7 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...