/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/forester-heap/sll-rb-cnstr_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:08:45,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:08:45,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:08:45,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:08:45,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:08:45,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:08:45,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:08:45,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:08:45,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:08:45,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:08:45,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:08:45,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:08:45,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:08:45,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:08:45,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:08:45,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:08:45,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:08:45,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:08:45,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:08:45,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:08:45,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:08:45,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:08:45,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:08:45,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:08:45,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:08:45,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:08:45,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:08:45,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:08:45,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:08:45,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:08:45,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:08:45,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:08:45,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:08:45,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:08:45,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:08:45,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:08:45,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:08:45,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:08:45,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:08:45,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:08:45,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:08:45,973 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:08:46,002 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:08:46,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:08:46,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:08:46,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:08:46,005 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:08:46,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:08:46,006 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:08:46,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:08:46,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:08:46,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:08:46,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:08:46,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:08:46,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:08:46,007 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:08:46,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:08:46,008 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:08:46,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:08:46,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:08:46,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:08:46,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:08:46,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:08:46,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:46,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:08:46,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:08:46,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:08:46,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:08:46,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:08:46,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:08:46,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:08:46,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:08:46,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:08:46,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:08:46,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:08:46,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:08:46,353 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:08:46,354 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-2.i [2020-07-10 15:08:46,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13d14d29/4040af8bdefb45c1b2d9fb5a608a4f89/FLAG0830d6b8a [2020-07-10 15:08:46,941 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:08:46,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-2.i [2020-07-10 15:08:46,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13d14d29/4040af8bdefb45c1b2d9fb5a608a4f89/FLAG0830d6b8a [2020-07-10 15:08:47,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13d14d29/4040af8bdefb45c1b2d9fb5a608a4f89 [2020-07-10 15:08:47,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:08:47,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:08:47,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:47,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:08:47,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:08:47,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:47" (1/1) ... [2020-07-10 15:08:47,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d044b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:47, skipping insertion in model container [2020-07-10 15:08:47,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:47" (1/1) ... [2020-07-10 15:08:47,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:08:47,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:08:47,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:47,878 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:08:47,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:48,007 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:08:48,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48 WrapperNode [2020-07-10 15:08:48,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:48,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:08:48,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:08:48,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:08:48,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (1/1) ... [2020-07-10 15:08:48,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:08:48,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:08:48,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:08:48,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:08:48,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (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:08:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:08:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:08:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:08:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:08:48,157 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:08:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:08:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:08:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:08:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:08:48,158 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:08:48,159 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:08:48,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:08:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:08:48,162 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:08:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:08:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:08:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:08:48,166 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:08:48,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:08:48,168 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:08:48,169 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:08:48,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:08:48,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:08:48,839 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:08:48,839 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-10 15:08:48,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:48 BoogieIcfgContainer [2020-07-10 15:08:48,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:08:48,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:08:48,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:08:48,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:08:48,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:08:47" (1/3) ... [2020-07-10 15:08:48,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209407d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:48, skipping insertion in model container [2020-07-10 15:08:48,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:48" (2/3) ... [2020-07-10 15:08:48,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209407d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:48, skipping insertion in model container [2020-07-10 15:08:48,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:48" (3/3) ... [2020-07-10 15:08:48,853 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2020-07-10 15:08:48,865 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:08:48,874 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-10 15:08:48,889 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-10 15:08:48,916 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:08:48,916 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:08:48,916 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:08:48,916 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:08:48,917 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:08:48,917 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:08:48,917 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:08:48,917 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:08:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-10 15:08:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:08:48,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:48,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:48,946 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -810798801, now seen corresponding path program 1 times [2020-07-10 15:08:48,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:48,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066883348] [2020-07-10 15:08:48,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:49,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(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; {37#true} is VALID [2020-07-10 15:08:49,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:08:49,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #118#return; {37#true} is VALID [2020-07-10 15:08:49,202 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {42#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:49,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(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; {37#true} is VALID [2020-07-10 15:08:49,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-10 15:08:49,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #118#return; {37#true} is VALID [2020-07-10 15:08:49,204 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret17 := main(); {37#true} is VALID [2020-07-10 15:08:49,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {37#true} is VALID [2020-07-10 15:08:49,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-10 15:08:49,208 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {38#false} is VALID [2020-07-10 15:08:49,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {38#false} is VALID [2020-07-10 15:08:49,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-10 15:08:49,210 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:08:49,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066883348] [2020-07-10 15:08:49,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:49,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:08:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566105313] [2020-07-10 15:08:49,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:49,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:49,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:08:49,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:49,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:08:49,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:08:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:08:49,284 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-10 15:08:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:49,504 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2020-07-10 15:08:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:08:49,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:08:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-10 15:08:49,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-10 15:08:49,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:49,690 INFO L225 Difference]: With dead ends: 59 [2020-07-10 15:08:49,690 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 15:08:49,696 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:08:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 15:08:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 15:08:49,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:49,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 15:08:49,753 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:08:49,753 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:08:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:49,757 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 15:08:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 15:08:49,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:49,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:49,758 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 15:08:49,758 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 15:08:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:49,762 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 15:08:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 15:08:49,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:49,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:49,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:49,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:08:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-10 15:08:49,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2020-07-10 15:08:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:49,769 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-10 15:08:49,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:08:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 15:08:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:08:49,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:49,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:49,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:08:49,770 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash 622671912, now seen corresponding path program 1 times [2020-07-10 15:08:49,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:49,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261665147] [2020-07-10 15:08:49,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:49,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {205#(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; {198#true} is VALID [2020-07-10 15:08:49,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-10 15:08:49,901 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #118#return; {198#true} is VALID [2020-07-10 15:08:49,903 INFO L263 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {205#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:49,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {205#(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; {198#true} is VALID [2020-07-10 15:08:49,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-10 15:08:49,904 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #118#return; {198#true} is VALID [2020-07-10 15:08:49,904 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret17 := main(); {198#true} is VALID [2020-07-10 15:08:49,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:49,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {203#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:49,908 INFO L280 TraceCheckUtils]: 7: Hoare triple {203#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {203#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:49,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {203#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {204#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 15:08:49,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {204#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {199#false} is VALID [2020-07-10 15:08:49,910 INFO L280 TraceCheckUtils]: 10: Hoare triple {199#false} assume !false; {199#false} is VALID [2020-07-10 15:08:49,912 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:08:49,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261665147] [2020-07-10 15:08:49,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:49,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:49,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747994430] [2020-07-10 15:08:49,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:49,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:49,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:49,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:49,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:49,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:49,934 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2020-07-10 15:08:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:50,215 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:08:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:50,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-10 15:08:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-07-10 15:08:50,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2020-07-10 15:08:50,284 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:08:50,286 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:08:50,287 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:08:50,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:08:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2020-07-10 15:08:50,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:50,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 25 states. [2020-07-10 15:08:50,302 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 25 states. [2020-07-10 15:08:50,302 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 25 states. [2020-07-10 15:08:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:50,305 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:08:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:08:50,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:50,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:50,306 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 33 states. [2020-07-10 15:08:50,307 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 33 states. [2020-07-10 15:08:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:50,310 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:08:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:08:50,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:50,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:50,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:50,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:08:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-10 15:08:50,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2020-07-10 15:08:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:50,318 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-10 15:08:50,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:08:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:08:50,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:50,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:50,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:08:50,320 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash 59124385, now seen corresponding path program 1 times [2020-07-10 15:08:50,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:50,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718877358] [2020-07-10 15:08:50,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:50,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#(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; {348#true} is VALID [2020-07-10 15:08:50,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-10 15:08:50,562 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #118#return; {348#true} is VALID [2020-07-10 15:08:50,563 INFO L263 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {356#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:50,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#(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; {348#true} is VALID [2020-07-10 15:08:50,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2020-07-10 15:08:50,564 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #118#return; {348#true} is VALID [2020-07-10 15:08:50,565 INFO L263 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret17 := main(); {348#true} is VALID [2020-07-10 15:08:50,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {348#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:50,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:50,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:50,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:50,573 INFO L280 TraceCheckUtils]: 9: Hoare triple {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:50,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:50,575 INFO L280 TraceCheckUtils]: 11: Hoare triple {354#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {355#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-10 15:08:50,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {355#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {349#false} is VALID [2020-07-10 15:08:50,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2020-07-10 15:08:50,578 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:08:50,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718877358] [2020-07-10 15:08:50,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:50,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:50,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925308694] [2020-07-10 15:08:50,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:08:50,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:50,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:50,630 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:08:50,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:50,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:50,631 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2020-07-10 15:08:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:51,106 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-10 15:08:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:08:51,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:08:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:08:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:08:51,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-10 15:08:51,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:51,229 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:08:51,229 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:08:51,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:08:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:08:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2020-07-10 15:08:51,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:51,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 32 states. [2020-07-10 15:08:51,256 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 32 states. [2020-07-10 15:08:51,256 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 32 states. [2020-07-10 15:08:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:51,260 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:08:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:08:51,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:51,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:51,262 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 49 states. [2020-07-10 15:08:51,262 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 49 states. [2020-07-10 15:08:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:51,265 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:08:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-10 15:08:51,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:51,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:51,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:51,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:08:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:08:51,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2020-07-10 15:08:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:51,269 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:08:51,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:08:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:08:51,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:51,270 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:08:51,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:08:51,270 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:08:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1951969173, now seen corresponding path program 1 times [2020-07-10 15:08:51,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:51,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635942910] [2020-07-10 15:08:51,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:51,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {570#(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; {560#true} is VALID [2020-07-10 15:08:51,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-10 15:08:51,584 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-10 15:08:51,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {560#true} call ULTIMATE.init(); {570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:51,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {570#(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; {560#true} is VALID [2020-07-10 15:08:51,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-10 15:08:51,587 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-10 15:08:51,587 INFO L263 TraceCheckUtils]: 4: Hoare triple {560#true} call #t~ret17 := main(); {560#true} is VALID [2020-07-10 15:08:51,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {565#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 15:08:51,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {565#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {565#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} is VALID [2020-07-10 15:08:51,597 INFO L280 TraceCheckUtils]: 7: Hoare triple {565#(and (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)) (not (= (+ main_~list~0.offset 4) main_~end~0.offset)))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {566#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:51,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {566#(and (not (= main_~list~0.base main_~end~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet4);havoc #t~nondet4;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:51,600 INFO L280 TraceCheckUtils]: 9: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:51,600 INFO L280 TraceCheckUtils]: 10: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} assume !(0 != #t~nondet1);havoc #t~nondet1; {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 15:08:51,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {567#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:51,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:51,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:08:51,603 INFO L280 TraceCheckUtils]: 14: Hoare triple {568#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {569#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-10 15:08:51,605 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {561#false} is VALID [2020-07-10 15:08:51,605 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-10 15:08:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:51,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635942910] [2020-07-10 15:08:51,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056703798] [2020-07-10 15:08:51,608 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:08:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:51,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-10 15:08:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:51,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:08:51,891 INFO L384 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 [2020-07-10 15:08:51,892 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:51,911 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:51,917 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 13 treesize of output 9 [2020-07-10 15:08:51,917 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:51,933 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:51,934 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:08:51,934 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2020-07-10 15:08:51,941 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:51,942 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, |v_#valid_18|]. (and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= |#valid| (store |v_#valid_18| main_~list~0.base 1)) (= main_~list~0.base main_~end~0.base) (= |#memory_int| (store |v_#memory_int_23| main_~list~0.base (store (select |v_#memory_int_23| main_~list~0.base) (+ main_~list~0.offset 4) ~unnamed1~0~BLACK)))) [2020-07-10 15:08:51,942 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))) [2020-07-10 15:08:52,055 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,055 INFO L384 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 17 treesize of output 39 [2020-07-10 15:08:52,061 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,127 INFO L624 ElimStorePlain]: treesize reduction 14, result has 81.1 percent of original size [2020-07-10 15:08:52,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:08:52,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-10 15:08:52,146 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,159 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,167 INFO L384 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 25 treesize of output 13 [2020-07-10 15:08:52,171 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,183 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,186 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,186 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2020-07-10 15:08:52,192 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:52,192 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, v_main_~end~0.offset_22, |v_#memory_int_27|, |v_#valid_19|]. (let ((.cse0 (select |v_#memory_int_27| main_~list~0.base))) (and (= (select |v_#valid_19| main_~end~0.base) 0) (= |#valid| (store |v_#valid_19| main_~end~0.base 1)) (= (store |v_#memory_int_27| main_~list~0.base (store .cse0 v_main_~end~0.offset_22 (select (select |v_#memory_int_24| main_~list~0.base) v_main_~end~0.offset_22))) |v_#memory_int_24|) (= 0 main_~list~0.offset) (= 1 (select |v_#valid_19| main_~list~0.base)) (= (store |v_#memory_int_24| main_~end~0.base (store (select |v_#memory_int_24| main_~end~0.base) main_~end~0.offset (select (select |#memory_int| main_~end~0.base) main_~end~0.offset))) |#memory_int|) (<= v_main_~end~0.offset_22 main_~list~0.offset) (= ~unnamed1~0~BLACK (select .cse0 (+ main_~list~0.offset 4))))) [2020-07-10 15:08:52,192 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base))) [2020-07-10 15:08:52,327 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-10 15:08:52,331 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,366 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,369 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_26|, |v_#memory_int_25|], 4=[|v_#memory_int_28|]} [2020-07-10 15:08:52,378 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:52,411 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,419 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:52,440 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:08:52,486 INFO L350 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2020-07-10 15:08:52,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2020-07-10 15:08:52,489 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:52,509 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:52,545 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-10 15:08:52,546 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:80, output treesize:43 [2020-07-10 15:08:52,556 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:52,557 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, v_main_~end~0.base_23, v_main_~end~0.offset_23, |v_#memory_int_26|, |v_#memory_int_25|, |main_#t~malloc5.base|, main_~end~0.offset, |v_#valid_20|]. (let ((.cse0 (select |v_#memory_int_25| |main_#t~malloc5.base|))) (and (= (store |v_#memory_int_28| v_main_~end~0.base_23 (store (store (select |v_#memory_int_28| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4) ~unnamed1~0~RED) v_main_~end~0.offset_23 (select (select |v_#memory_int_26| v_main_~end~0.base_23) v_main_~end~0.offset_23))) |v_#memory_int_26|) (= 0 main_~list~0.offset) (not (= v_main_~end~0.base_23 main_~list~0.base)) (= |#memory_int| (store |v_#memory_int_25| |main_#t~malloc5.base| (store .cse0 (+ main_~end~0.offset 4) ~unnamed1~0~BLACK))) (= ~unnamed1~0~BLACK (select (select |v_#memory_int_28| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |v_#valid_20| v_main_~end~0.base_23)) (= (select |v_#valid_20| |main_#t~malloc5.base|) 0) (= 1 (select |v_#valid_20| main_~list~0.base)) (= (store |v_#memory_int_26| |main_#t~malloc5.base| (store (select |v_#memory_int_26| |main_#t~malloc5.base|) main_~end~0.offset (select .cse0 main_~end~0.offset))) |v_#memory_int_25|))) [2020-07-10 15:08:52,557 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~end~0.base_23, v_main_~end~0.offset_23, |main_#t~malloc5.base|, main_~end~0.offset]. (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (= 0 main_~list~0.offset) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base))) [2020-07-10 15:08:53,103 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-07-10 15:08:53,106 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:08:53,115 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:08:53,118 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:08:53,119 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2020-07-10 15:08:53,121 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:08:53,122 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~end~0.base_23, v_main_~end~0.offset_23, main_~end~0.base, |main_#t~malloc5.base|, v_prenex_1]. (let ((.cse0 (select (select |#memory_int| main_~end~0.base) 4))) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (= ~unnamed1~0~BLACK .cse0) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= |main_#t~mem7| .cse0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))) [2020-07-10 15:08:53,122 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= ~unnamed1~0~BLACK |main_#t~mem7|) [2020-07-10 15:08:53,124 INFO L263 TraceCheckUtils]: 0: Hoare triple {560#true} call ULTIMATE.init(); {560#true} is VALID [2020-07-10 15:08:53,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {560#true} is VALID [2020-07-10 15:08:53,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume true; {560#true} is VALID [2020-07-10 15:08:53,125 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {560#true} {560#true} #118#return; {560#true} is VALID [2020-07-10 15:08:53,125 INFO L263 TraceCheckUtils]: 4: Hoare triple {560#true} call #t~ret17 := main(); {560#true} is VALID [2020-07-10 15:08:53,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:53,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 15:08:53,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#(and (<= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {596#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} is VALID [2020-07-10 15:08:55,148 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(and (not (= main_~list~0.base main_~end~0.base)) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| main_~end~0.base)))} assume !(0 != #t~nondet4);havoc #t~nondet4;call write~int(~unnamed1~0~RED, ~end~0.base, 4 + ~end~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 4 + ~end~0.offset, 4); {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} is UNKNOWN [2020-07-10 15:08:55,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} is VALID [2020-07-10 15:08:55,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} assume !(0 != #t~nondet1);havoc #t~nondet1; {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} is VALID [2020-07-10 15:08:55,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {600#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_main_~end~0.base_23 Int) (main_~end~0.offset Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~list~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ main_~end~0.offset 4))) (not (= |main_#t~malloc5.base| main_~list~0.base)))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} is VALID [2020-07-10 15:08:55,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} is VALID [2020-07-10 15:08:55,155 INFO L280 TraceCheckUtils]: 13: Hoare triple {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} goto; {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} is VALID [2020-07-10 15:08:55,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {610#(and (= 0 main_~end~0.offset) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK) (exists ((v_main_~end~0.offset_23 Int) (|main_#t~malloc5.base| Int) (v_prenex_1 Int) (v_main_~end~0.base_23 Int)) (and (= ~unnamed1~0~RED (select (select |#memory_int| v_main_~end~0.base_23) (+ v_main_~end~0.offset_23 4))) (not (= v_main_~end~0.base_23 main_~end~0.base)) (not (= |main_#t~malloc5.base| main_~end~0.base)) (not (= v_main_~end~0.base_23 |main_#t~malloc5.base|)) (= ~unnamed1~0~BLACK (select (select |#memory_int| |main_#t~malloc5.base|) (+ v_prenex_1 4))))))} call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {569#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-10 15:08:55,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {569#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {561#false} is VALID [2020-07-10 15:08:55,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-10 15:08:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:55,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:08:55,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-10 15:08:55,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799636552] [2020-07-10 15:08:55,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-10 15:08:55,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:55,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:08:55,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:55,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:08:55,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:08:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:08:55,234 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2020-07-10 15:09:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:06,929 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2020-07-10 15:09:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:09:06,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-10 15:09:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:09:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-10 15:09:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:09:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-10 15:09:06,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2020-07-10 15:09:07,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:07,081 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:09:07,081 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 15:09:07,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:09:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 15:09:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 23. [2020-07-10 15:09:07,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:07,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 23 states. [2020-07-10 15:09:07,114 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 23 states. [2020-07-10 15:09:07,114 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 23 states. [2020-07-10 15:09:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,118 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:09:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-10 15:09:07,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:07,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:07,120 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 62 states. [2020-07-10 15:09:07,120 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 62 states. [2020-07-10 15:09:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,123 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 15:09:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2020-07-10 15:09:07,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:07,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:07,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:07,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:09:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-10 15:09:07,126 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2020-07-10 15:09:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:07,126 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-10 15:09:07,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:09:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:09:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:09:07,127 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:07,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:07,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:07,329 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -506610811, now seen corresponding path program 1 times [2020-07-10 15:09:07,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:07,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545684394] [2020-07-10 15:09:07,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:07,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {872#(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; {864#true} is VALID [2020-07-10 15:09:07,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {864#true} assume true; {864#true} is VALID [2020-07-10 15:09:07,520 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {864#true} {864#true} #118#return; {864#true} is VALID [2020-07-10 15:09:07,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {872#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:09:07,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {872#(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; {864#true} is VALID [2020-07-10 15:09:07,521 INFO L280 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2020-07-10 15:09:07,522 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #118#return; {864#true} is VALID [2020-07-10 15:09:07,522 INFO L263 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret17 := main(); {864#true} is VALID [2020-07-10 15:09:07,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {864#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {864#true} is VALID [2020-07-10 15:09:07,522 INFO L280 TraceCheckUtils]: 6: Hoare triple {864#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {864#true} is VALID [2020-07-10 15:09:07,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {864#true} is VALID [2020-07-10 15:09:07,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {864#true} is VALID [2020-07-10 15:09:07,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {864#true} is VALID [2020-07-10 15:09:07,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#true} goto; {864#true} is VALID [2020-07-10 15:09:07,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#true} call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {869#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|)} is VALID [2020-07-10 15:09:07,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {869#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem7|)} assume !!(~unnamed1~0~BLACK == #t~mem7);havoc #t~mem7; {870#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:09:07,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {870#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-10 15:09:07,528 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);call #t~mem8 := read~int(~end~0.base, 4 + ~end~0.offset, 4); {871#(= ~unnamed1~0~BLACK |main_#t~mem8|)} is VALID [2020-07-10 15:09:07,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {871#(= ~unnamed1~0~BLACK |main_#t~mem8|)} assume ~unnamed1~0~RED == #t~mem8;havoc #t~mem8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {865#false} is VALID [2020-07-10 15:09:07,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {865#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); {865#false} is VALID [2020-07-10 15:09:07,529 INFO L280 TraceCheckUtils]: 17: Hoare triple {865#false} assume #t~mem11.base == 0 && #t~mem11.offset == 0;havoc #t~mem11.base, #t~mem11.offset; {865#false} is VALID [2020-07-10 15:09:07,529 INFO L280 TraceCheckUtils]: 18: Hoare triple {865#false} assume !false; {865#false} is VALID [2020-07-10 15:09:07,530 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:07,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545684394] [2020-07-10 15:09:07,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:07,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:09:07,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693984559] [2020-07-10 15:09:07,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:09:07,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:07,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:09:07,554 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:07,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:09:07,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:09:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:09:07,556 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2020-07-10 15:09:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,836 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:09:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:09:07,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:09:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-10 15:09:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-10 15:09:07,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-10 15:09:07,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:09:07,905 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:09:07,906 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:09:07,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:09:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:09:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-07-10 15:09:07,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:07,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2020-07-10 15:09:07,929 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2020-07-10 15:09:07,929 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2020-07-10 15:09:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,931 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-10 15:09:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:09:07,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:07,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:07,932 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2020-07-10 15:09:07,932 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2020-07-10 15:09:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:07,935 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-10 15:09:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:09:07,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:07,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:07,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:07,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:09:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-10 15:09:07,938 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2020-07-10 15:09:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:07,938 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-10 15:09:07,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:09:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 15:09:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:09:07,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:07,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:07,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:09:07,940 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -506551229, now seen corresponding path program 1 times [2020-07-10 15:09:07,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:07,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484152458] [2020-07-10 15:09:07,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:09:07,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:09:07,982 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:09:07,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:09:08,031 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:09:08,031 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:08,031 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:09:08,031 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:09:08,032 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:09:08,032 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:08,032 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:09:08,032 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2020-07-10 15:09:08,033 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2020-07-10 15:09:08,033 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:09:08,033 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:09:08,033 WARN L170 areAnnotationChecker]: L1002-3 has no Hoare annotation [2020-07-10 15:09:08,033 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-10 15:09:08,034 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:09:08,035 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 15:09:08,036 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2020-07-10 15:09:08,037 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:09:08,038 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:09:08,038 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:09:08,038 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-10 15:09:08,038 WARN L170 areAnnotationChecker]: L1038-3 has no Hoare annotation [2020-07-10 15:09:08,038 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:08,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:09:08 BoogieIcfgContainer [2020-07-10 15:09:08,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:09:08,052 INFO L168 Benchmark]: Toolchain (without parser) took 20776.67 ms. Allocated memory was 136.8 MB in the beginning and 297.3 MB in the end (delta: 160.4 MB). Free memory was 100.5 MB in the beginning and 87.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 173.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,053 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.73 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 167.8 MB in the end (delta: -67.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,057 INFO L168 Benchmark]: Boogie Preprocessor took 80.79 ms. Allocated memory is still 201.3 MB. Free memory was 167.8 MB in the beginning and 164.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,062 INFO L168 Benchmark]: RCFGBuilder took 754.49 ms. Allocated memory is still 201.3 MB. Free memory was 164.2 MB in the beginning and 106.4 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,063 INFO L168 Benchmark]: TraceAbstraction took 19197.50 ms. Allocated memory was 201.3 MB in the beginning and 297.3 MB in the end (delta: 95.9 MB). Free memory was 105.7 MB in the beginning and 91.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:09:08,068 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.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.73 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 167.8 MB in the end (delta: -67.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.79 ms. Allocated memory is still 201.3 MB. Free memory was 167.8 MB in the beginning and 164.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.49 ms. Allocated memory is still 201.3 MB. Free memory was 164.2 MB in the beginning and 106.4 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19197.50 ms. Allocated memory was 201.3 MB in the beginning and 297.3 MB in the end (delta: 95.9 MB). Free memory was 105.7 MB in the beginning and 91.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.0s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 134 SDtfs, 148 SDslu, 286 SDs, 0 SdLazy, 416 SolverSat, 46 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 10406 SizeOfPredicates, 13 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/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...