/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:26:22,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:26:22,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:26:22,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:26:22,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:26:22,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:26:22,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:26:22,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:26:22,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:26:22,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:26:22,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:26:22,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:26:22,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:26:22,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:26:22,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:26:22,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:26:22,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:26:22,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:26:22,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:26:22,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:26:22,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:26:22,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:26:22,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:26:22,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:26:22,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:26:22,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:26:22,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:26:22,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:26:22,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:26:22,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:26:22,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:26:22,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:26:22,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:26:22,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:26:22,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:26:22,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:26:22,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:26:22,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:26:22,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:26:22,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:26:22,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:26:22,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:26:22,168 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:26:22,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:26:22,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:26:22,169 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:26:22,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:26:22,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:26:22,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:26:22,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:26:22,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:26:22,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:26:22,171 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:26:22,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:26:22,171 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:26:22,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:26:22,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:26:22,172 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:26:22,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:26:22,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:26:22,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:26:22,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:26:22,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:26:22,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:26:22,173 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:26:22,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:26:22,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:26:22,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:26:22,518 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:26:22,518 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:26:22,519 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2020-07-08 16:26:22,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d386d45f/6cc1c22344764ab3af56bace111b2aa1/FLAGb4fe66a73 [2020-07-08 16:26:23,183 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:26:23,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2020-07-08 16:26:23,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d386d45f/6cc1c22344764ab3af56bace111b2aa1/FLAGb4fe66a73 [2020-07-08 16:26:23,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d386d45f/6cc1c22344764ab3af56bace111b2aa1 [2020-07-08 16:26:23,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:26:23,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:26:23,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:26:23,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:26:23,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:26:23,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:26:23" (1/1) ... [2020-07-08 16:26:23,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354d87e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:23, skipping insertion in model container [2020-07-08 16:26:23,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:26:23" (1/1) ... [2020-07-08 16:26:23,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:26:23,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:26:23,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:26:23,999 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:26:24,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:26:24,123 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:26:24,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24 WrapperNode [2020-07-08 16:26:24,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:26:24,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:26:24,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:26:24,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:26:24,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (1/1) ... [2020-07-08 16:26:24,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:26:24,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:26:24,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:26:24,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:26:24,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (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-08 16:26:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2020-07-08 16:26:24,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2020-07-08 16:26:24,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:26:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:26:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-08 16:26:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-08 16:26:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 16:26:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 16:26:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 16:26:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 16:26:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 16:26:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 16:26:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 16:26:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 16:26:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 16:26:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 16:26:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 16:26:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 16:26:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 16:26:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 16:26:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 16:26:24,272 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 16:26:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 16:26:24,274 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 16:26:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 16:26:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 16:26:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 16:26:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-08 16:26:24,279 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 16:26:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:26:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:26:24,682 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-08 16:26:25,012 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:26:25,012 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 16:26:25,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:26:25 BoogieIcfgContainer [2020-07-08 16:26:25,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:26:25,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:26:25,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:26:25,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:26:25,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:26:23" (1/3) ... [2020-07-08 16:26:25,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362c2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:26:25, skipping insertion in model container [2020-07-08 16:26:25,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:26:24" (2/3) ... [2020-07-08 16:26:25,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362c2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:26:25, skipping insertion in model container [2020-07-08 16:26:25,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:26:25" (3/3) ... [2020-07-08 16:26:25,026 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2020-07-08 16:26:25,038 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:26:25,047 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:26:25,063 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:26:25,088 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:26:25,088 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:26:25,088 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:26:25,091 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:26:25,091 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:26:25,091 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:26:25,091 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:26:25,091 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:26:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2020-07-08 16:26:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 16:26:25,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:25,126 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:25,126 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 482514570, now seen corresponding path program 1 times [2020-07-08 16:26:25,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:25,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1451652109] [2020-07-08 16:26:25,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {106#true} is VALID [2020-07-08 16:26:25,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} #valid := #valid[0 := 0]; {106#true} is VALID [2020-07-08 16:26:25,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} assume 0 < #StackHeapBarrier; {106#true} is VALID [2020-07-08 16:26:25,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-08 16:26:25,375 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {106#true} {106#true} #194#return; {106#true} is VALID [2020-07-08 16:26:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {106#true} is VALID [2020-07-08 16:26:25,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} ~data := #in~data; {106#true} is VALID [2020-07-08 16:26:25,413 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} ~head~0.base, ~head~0.offset := 0, 0; {106#true} is VALID [2020-07-08 16:26:25,414 INFO L280 TraceCheckUtils]: 3: Hoare triple {106#true} assume !true; {107#false} is VALID [2020-07-08 16:26:25,415 INFO L280 TraceCheckUtils]: 4: Hoare triple {107#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {107#false} is VALID [2020-07-08 16:26:25,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#false} assume true; {107#false} is VALID [2020-07-08 16:26:25,415 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {107#false} {106#true} #186#return; {107#false} is VALID [2020-07-08 16:26:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:25,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {106#true} is VALID [2020-07-08 16:26:25,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} ~index := #in~index; {106#true} is VALID [2020-07-08 16:26:25,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} assume !true; {107#false} is VALID [2020-07-08 16:26:25,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {107#false} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {107#false} is VALID [2020-07-08 16:26:25,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {107#false} #res := #t~mem8; {107#false} is VALID [2020-07-08 16:26:25,429 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#false} havoc #t~mem8; {107#false} is VALID [2020-07-08 16:26:25,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {107#false} assume true; {107#false} is VALID [2020-07-08 16:26:25,430 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {107#false} {107#false} #190#return; {107#false} is VALID [2020-07-08 16:26:25,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:25,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {106#true} is VALID [2020-07-08 16:26:25,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} #valid := #valid[0 := 0]; {106#true} is VALID [2020-07-08 16:26:25,434 INFO L280 TraceCheckUtils]: 3: Hoare triple {106#true} assume 0 < #StackHeapBarrier; {106#true} is VALID [2020-07-08 16:26:25,434 INFO L280 TraceCheckUtils]: 4: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-08 16:26:25,434 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {106#true} {106#true} #194#return; {106#true} is VALID [2020-07-08 16:26:25,435 INFO L263 TraceCheckUtils]: 6: Hoare triple {106#true} call #t~ret15 := main(); {106#true} is VALID [2020-07-08 16:26:25,435 INFO L280 TraceCheckUtils]: 7: Hoare triple {106#true} ~len~0 := 2; {106#true} is VALID [2020-07-08 16:26:25,435 INFO L280 TraceCheckUtils]: 8: Hoare triple {106#true} ~data~0 := 1; {106#true} is VALID [2020-07-08 16:26:25,437 INFO L263 TraceCheckUtils]: 9: Hoare triple {106#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {129#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:26:25,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {129#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {106#true} is VALID [2020-07-08 16:26:25,438 INFO L280 TraceCheckUtils]: 11: Hoare triple {106#true} ~data := #in~data; {106#true} is VALID [2020-07-08 16:26:25,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {106#true} ~head~0.base, ~head~0.offset := 0, 0; {106#true} is VALID [2020-07-08 16:26:25,440 INFO L280 TraceCheckUtils]: 13: Hoare triple {106#true} assume !true; {107#false} is VALID [2020-07-08 16:26:25,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {107#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {107#false} is VALID [2020-07-08 16:26:25,440 INFO L280 TraceCheckUtils]: 15: Hoare triple {107#false} assume true; {107#false} is VALID [2020-07-08 16:26:25,441 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {107#false} {106#true} #186#return; {107#false} is VALID [2020-07-08 16:26:25,441 INFO L280 TraceCheckUtils]: 17: Hoare triple {107#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset; {107#false} is VALID [2020-07-08 16:26:25,441 INFO L280 TraceCheckUtils]: 18: Hoare triple {107#false} havoc #t~ret11.base, #t~ret11.offset; {107#false} is VALID [2020-07-08 16:26:25,442 INFO L280 TraceCheckUtils]: 19: Hoare triple {107#false} havoc ~i~0; {107#false} is VALID [2020-07-08 16:26:25,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {107#false} ~i~0 := ~len~0 - 1; {107#false} is VALID [2020-07-08 16:26:25,442 INFO L280 TraceCheckUtils]: 21: Hoare triple {107#false} assume !(~i~0 >= 0); {107#false} is VALID [2020-07-08 16:26:25,443 INFO L280 TraceCheckUtils]: 22: Hoare triple {107#false} ~i~0 := ~len~0 - 1; {107#false} is VALID [2020-07-08 16:26:25,443 INFO L280 TraceCheckUtils]: 23: Hoare triple {107#false} assume !!(~i~0 >= 0); {107#false} is VALID [2020-07-08 16:26:25,443 INFO L280 TraceCheckUtils]: 24: Hoare triple {107#false} ~expected~0 := ~i~0 + ~len~0; {107#false} is VALID [2020-07-08 16:26:25,444 INFO L263 TraceCheckUtils]: 25: Hoare triple {107#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {106#true} is VALID [2020-07-08 16:26:25,444 INFO L280 TraceCheckUtils]: 26: Hoare triple {106#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {106#true} is VALID [2020-07-08 16:26:25,444 INFO L280 TraceCheckUtils]: 27: Hoare triple {106#true} ~index := #in~index; {106#true} is VALID [2020-07-08 16:26:25,445 INFO L280 TraceCheckUtils]: 28: Hoare triple {106#true} assume !true; {107#false} is VALID [2020-07-08 16:26:25,446 INFO L280 TraceCheckUtils]: 29: Hoare triple {107#false} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {107#false} is VALID [2020-07-08 16:26:25,446 INFO L280 TraceCheckUtils]: 30: Hoare triple {107#false} #res := #t~mem8; {107#false} is VALID [2020-07-08 16:26:25,447 INFO L280 TraceCheckUtils]: 31: Hoare triple {107#false} havoc #t~mem8; {107#false} is VALID [2020-07-08 16:26:25,447 INFO L280 TraceCheckUtils]: 32: Hoare triple {107#false} assume true; {107#false} is VALID [2020-07-08 16:26:25,447 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {107#false} {107#false} #190#return; {107#false} is VALID [2020-07-08 16:26:25,448 INFO L280 TraceCheckUtils]: 34: Hoare triple {107#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {107#false} is VALID [2020-07-08 16:26:25,448 INFO L280 TraceCheckUtils]: 35: Hoare triple {107#false} assume ~expected~0 != #t~ret14; {107#false} is VALID [2020-07-08 16:26:25,448 INFO L280 TraceCheckUtils]: 36: Hoare triple {107#false} havoc #t~ret14; {107#false} is VALID [2020-07-08 16:26:25,449 INFO L280 TraceCheckUtils]: 37: Hoare triple {107#false} assume !false; {107#false} is VALID [2020-07-08 16:26:25,454 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-08 16:26:25,455 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:25,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1451652109] [2020-07-08 16:26:25,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:25,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:26:25,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913174155] [2020-07-08 16:26:25,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-08 16:26:25,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:25,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:26:25,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:26:25,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:26:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:26:25,549 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2020-07-08 16:26:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:26,901 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2020-07-08 16:26:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 16:26:26,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-07-08 16:26:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2020-07-08 16:26:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:26:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2020-07-08 16:26:26,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 285 transitions. [2020-07-08 16:26:27,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:27,390 INFO L225 Difference]: With dead ends: 230 [2020-07-08 16:26:27,390 INFO L226 Difference]: Without dead ends: 128 [2020-07-08 16:26:27,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 16:26:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-08 16:26:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2020-07-08 16:26:27,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:27,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 84 states. [2020-07-08 16:26:27,577 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 84 states. [2020-07-08 16:26:27,577 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 84 states. [2020-07-08 16:26:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:27,594 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2020-07-08 16:26:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2020-07-08 16:26:27,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:27,598 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 128 states. [2020-07-08 16:26:27,598 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 128 states. [2020-07-08 16:26:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:27,610 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2020-07-08 16:26:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2020-07-08 16:26:27,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:27,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:27,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:27,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-08 16:26:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2020-07-08 16:26:27,621 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2020-07-08 16:26:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:27,622 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2020-07-08 16:26:27,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:26:27,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2020-07-08 16:26:27,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-08 16:26:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 16:26:27,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:27,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:27,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:26:27,745 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -613399993, now seen corresponding path program 1 times [2020-07-08 16:26:27,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:27,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766161829] [2020-07-08 16:26:27,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:27,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {1043#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1019#true} is VALID [2020-07-08 16:26:27,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {1019#true} #valid := #valid[0 := 0]; {1019#true} is VALID [2020-07-08 16:26:27,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {1019#true} assume 0 < #StackHeapBarrier; {1019#true} is VALID [2020-07-08 16:26:27,914 INFO L280 TraceCheckUtils]: 3: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,915 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1019#true} {1019#true} #194#return; {1019#true} is VALID [2020-07-08 16:26:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:27,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {1044#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1019#true} is VALID [2020-07-08 16:26:27,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1019#true} ~data := #in~data; {1019#true} is VALID [2020-07-08 16:26:27,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {1019#true} ~head~0.base, ~head~0.offset := 0, 0; {1019#true} is VALID [2020-07-08 16:26:27,947 INFO L280 TraceCheckUtils]: 3: Hoare triple {1019#true} assume !(~len > 0); {1019#true} is VALID [2020-07-08 16:26:27,948 INFO L280 TraceCheckUtils]: 4: Hoare triple {1019#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1019#true} is VALID [2020-07-08 16:26:27,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,949 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1019#true} {1026#(<= 2 main_~len~0)} #186#return; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:27,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {1019#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1019#true} is VALID [2020-07-08 16:26:27,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {1019#true} ~index := #in~index; {1019#true} is VALID [2020-07-08 16:26:27,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {1019#true} assume !(~index > 0); {1019#true} is VALID [2020-07-08 16:26:27,959 INFO L280 TraceCheckUtils]: 3: Hoare triple {1019#true} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {1019#true} is VALID [2020-07-08 16:26:27,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {1019#true} #res := #t~mem8; {1019#true} is VALID [2020-07-08 16:26:27,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {1019#true} havoc #t~mem8; {1019#true} is VALID [2020-07-08 16:26:27,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,960 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1019#true} {1020#false} #190#return; {1020#false} is VALID [2020-07-08 16:26:27,962 INFO L263 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1043#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:27,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {1043#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1019#true} is VALID [2020-07-08 16:26:27,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1019#true} #valid := #valid[0 := 0]; {1019#true} is VALID [2020-07-08 16:26:27,963 INFO L280 TraceCheckUtils]: 3: Hoare triple {1019#true} assume 0 < #StackHeapBarrier; {1019#true} is VALID [2020-07-08 16:26:27,963 INFO L280 TraceCheckUtils]: 4: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,963 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1019#true} {1019#true} #194#return; {1019#true} is VALID [2020-07-08 16:26:27,964 INFO L263 TraceCheckUtils]: 6: Hoare triple {1019#true} call #t~ret15 := main(); {1019#true} is VALID [2020-07-08 16:26:27,964 INFO L280 TraceCheckUtils]: 7: Hoare triple {1019#true} ~len~0 := 2; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {1026#(<= 2 main_~len~0)} ~data~0 := 1; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,966 INFO L263 TraceCheckUtils]: 9: Hoare triple {1026#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1044#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:26:27,967 INFO L280 TraceCheckUtils]: 10: Hoare triple {1044#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1019#true} is VALID [2020-07-08 16:26:27,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {1019#true} ~data := #in~data; {1019#true} is VALID [2020-07-08 16:26:27,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {1019#true} ~head~0.base, ~head~0.offset := 0, 0; {1019#true} is VALID [2020-07-08 16:26:27,968 INFO L280 TraceCheckUtils]: 13: Hoare triple {1019#true} assume !(~len > 0); {1019#true} is VALID [2020-07-08 16:26:27,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {1019#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1019#true} is VALID [2020-07-08 16:26:27,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,970 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1019#true} {1026#(<= 2 main_~len~0)} #186#return; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,970 INFO L280 TraceCheckUtils]: 17: Hoare triple {1026#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,971 INFO L280 TraceCheckUtils]: 18: Hoare triple {1026#(<= 2 main_~len~0)} havoc #t~ret11.base, #t~ret11.offset; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,972 INFO L280 TraceCheckUtils]: 19: Hoare triple {1026#(<= 2 main_~len~0)} havoc ~i~0; {1026#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:27,973 INFO L280 TraceCheckUtils]: 20: Hoare triple {1026#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {1034#(<= 1 main_~i~0)} is VALID [2020-07-08 16:26:27,974 INFO L280 TraceCheckUtils]: 21: Hoare triple {1034#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {1020#false} is VALID [2020-07-08 16:26:27,974 INFO L280 TraceCheckUtils]: 22: Hoare triple {1020#false} ~i~0 := ~len~0 - 1; {1020#false} is VALID [2020-07-08 16:26:27,974 INFO L280 TraceCheckUtils]: 23: Hoare triple {1020#false} assume !!(~i~0 >= 0); {1020#false} is VALID [2020-07-08 16:26:27,975 INFO L280 TraceCheckUtils]: 24: Hoare triple {1020#false} ~expected~0 := ~i~0 + ~len~0; {1020#false} is VALID [2020-07-08 16:26:27,975 INFO L263 TraceCheckUtils]: 25: Hoare triple {1020#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1019#true} is VALID [2020-07-08 16:26:27,975 INFO L280 TraceCheckUtils]: 26: Hoare triple {1019#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1019#true} is VALID [2020-07-08 16:26:27,975 INFO L280 TraceCheckUtils]: 27: Hoare triple {1019#true} ~index := #in~index; {1019#true} is VALID [2020-07-08 16:26:27,976 INFO L280 TraceCheckUtils]: 28: Hoare triple {1019#true} assume !(~index > 0); {1019#true} is VALID [2020-07-08 16:26:27,976 INFO L280 TraceCheckUtils]: 29: Hoare triple {1019#true} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {1019#true} is VALID [2020-07-08 16:26:27,976 INFO L280 TraceCheckUtils]: 30: Hoare triple {1019#true} #res := #t~mem8; {1019#true} is VALID [2020-07-08 16:26:27,977 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#true} havoc #t~mem8; {1019#true} is VALID [2020-07-08 16:26:27,977 INFO L280 TraceCheckUtils]: 32: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-08 16:26:27,977 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1019#true} {1020#false} #190#return; {1020#false} is VALID [2020-07-08 16:26:27,978 INFO L280 TraceCheckUtils]: 34: Hoare triple {1020#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1020#false} is VALID [2020-07-08 16:26:27,978 INFO L280 TraceCheckUtils]: 35: Hoare triple {1020#false} assume ~expected~0 != #t~ret14; {1020#false} is VALID [2020-07-08 16:26:27,978 INFO L280 TraceCheckUtils]: 36: Hoare triple {1020#false} havoc #t~ret14; {1020#false} is VALID [2020-07-08 16:26:27,978 INFO L280 TraceCheckUtils]: 37: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2020-07-08 16:26:27,981 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-08 16:26:27,981 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:27,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766161829] [2020-07-08 16:26:27,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:27,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 16:26:27,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657028566] [2020-07-08 16:26:27,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 16:26:27,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:27,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 16:26:28,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:28,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 16:26:28,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 16:26:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 16:26:28,021 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 6 states. [2020-07-08 16:26:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:29,427 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2020-07-08 16:26:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 16:26:29,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-08 16:26:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:26:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2020-07-08 16:26:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 16:26:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2020-07-08 16:26:29,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 187 transitions. [2020-07-08 16:26:29,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:29,726 INFO L225 Difference]: With dead ends: 171 [2020-07-08 16:26:29,727 INFO L226 Difference]: Without dead ends: 144 [2020-07-08 16:26:29,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-08 16:26:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-08 16:26:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 85. [2020-07-08 16:26:29,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:29,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 85 states. [2020-07-08 16:26:29,893 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 85 states. [2020-07-08 16:26:29,894 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 85 states. [2020-07-08 16:26:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:29,907 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2020-07-08 16:26:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2020-07-08 16:26:29,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:29,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:29,910 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 144 states. [2020-07-08 16:26:29,910 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 144 states. [2020-07-08 16:26:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:29,922 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2020-07-08 16:26:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2020-07-08 16:26:29,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:29,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:29,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:29,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 16:26:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2020-07-08 16:26:29,930 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 38 [2020-07-08 16:26:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:29,930 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2020-07-08 16:26:29,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 16:26:29,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 89 transitions. [2020-07-08 16:26:30,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2020-07-08 16:26:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 16:26:30,060 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:30,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:30,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:26:30,061 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -841200203, now seen corresponding path program 1 times [2020-07-08 16:26:30,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:30,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094311153] [2020-07-08 16:26:30,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:30,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {1890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1860#true} is VALID [2020-07-08 16:26:30,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {1860#true} #valid := #valid[0 := 0]; {1860#true} is VALID [2020-07-08 16:26:30,174 INFO L280 TraceCheckUtils]: 2: Hoare triple {1860#true} assume 0 < #StackHeapBarrier; {1860#true} is VALID [2020-07-08 16:26:30,174 INFO L280 TraceCheckUtils]: 3: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,174 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1860#true} {1860#true} #194#return; {1860#true} is VALID [2020-07-08 16:26:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:30,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {1891#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} ~data := #in~data; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,258 INFO L280 TraceCheckUtils]: 3: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,259 INFO L280 TraceCheckUtils]: 4: Hoare triple {1893#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {1893#(<= |sll_create_#in~len| 0)} assume true; {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,261 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1893#(<= |sll_create_#in~len| 0)} {1867#(<= 2 main_~len~0)} #186#return; {1861#false} is VALID [2020-07-08 16:26:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:30,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {1894#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1860#true} is VALID [2020-07-08 16:26:30,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {1860#true} ~data := #in~data; {1860#true} is VALID [2020-07-08 16:26:30,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {1860#true} ~index := #in~index; {1860#true} is VALID [2020-07-08 16:26:30,288 INFO L280 TraceCheckUtils]: 3: Hoare triple {1860#true} assume !(~index > 0); {1860#true} is VALID [2020-07-08 16:26:30,289 INFO L280 TraceCheckUtils]: 4: Hoare triple {1860#true} SUMMARY for call write~int(~data, ~head.base, ~head.offset, 4); srcloc: L596-3 {1860#true} is VALID [2020-07-08 16:26:30,289 INFO L280 TraceCheckUtils]: 5: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,289 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1860#true} {1861#false} #188#return; {1861#false} is VALID [2020-07-08 16:26:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:26:30,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {1860#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1860#true} is VALID [2020-07-08 16:26:30,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {1860#true} ~index := #in~index; {1860#true} is VALID [2020-07-08 16:26:30,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {1860#true} assume !(~index > 0); {1860#true} is VALID [2020-07-08 16:26:30,298 INFO L280 TraceCheckUtils]: 3: Hoare triple {1860#true} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {1860#true} is VALID [2020-07-08 16:26:30,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {1860#true} #res := #t~mem8; {1860#true} is VALID [2020-07-08 16:26:30,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {1860#true} havoc #t~mem8; {1860#true} is VALID [2020-07-08 16:26:30,298 INFO L280 TraceCheckUtils]: 6: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,299 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1860#true} {1861#false} #190#return; {1861#false} is VALID [2020-07-08 16:26:30,300 INFO L263 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 16:26:30,300 INFO L280 TraceCheckUtils]: 1: Hoare triple {1890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1860#true} is VALID [2020-07-08 16:26:30,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {1860#true} #valid := #valid[0 := 0]; {1860#true} is VALID [2020-07-08 16:26:30,301 INFO L280 TraceCheckUtils]: 3: Hoare triple {1860#true} assume 0 < #StackHeapBarrier; {1860#true} is VALID [2020-07-08 16:26:30,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,301 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1860#true} {1860#true} #194#return; {1860#true} is VALID [2020-07-08 16:26:30,301 INFO L263 TraceCheckUtils]: 6: Hoare triple {1860#true} call #t~ret15 := main(); {1860#true} is VALID [2020-07-08 16:26:30,302 INFO L280 TraceCheckUtils]: 7: Hoare triple {1860#true} ~len~0 := 2; {1867#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:30,303 INFO L280 TraceCheckUtils]: 8: Hoare triple {1867#(<= 2 main_~len~0)} ~data~0 := 1; {1867#(<= 2 main_~len~0)} is VALID [2020-07-08 16:26:30,304 INFO L263 TraceCheckUtils]: 9: Hoare triple {1867#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1891#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:26:30,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {1891#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} ~data := #in~data; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1892#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-08 16:26:30,307 INFO L280 TraceCheckUtils]: 13: Hoare triple {1892#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,308 INFO L280 TraceCheckUtils]: 14: Hoare triple {1893#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,308 INFO L280 TraceCheckUtils]: 15: Hoare triple {1893#(<= |sll_create_#in~len| 0)} assume true; {1893#(<= |sll_create_#in~len| 0)} is VALID [2020-07-08 16:26:30,309 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1893#(<= |sll_create_#in~len| 0)} {1867#(<= 2 main_~len~0)} #186#return; {1861#false} is VALID [2020-07-08 16:26:30,310 INFO L280 TraceCheckUtils]: 17: Hoare triple {1861#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset; {1861#false} is VALID [2020-07-08 16:26:30,310 INFO L280 TraceCheckUtils]: 18: Hoare triple {1861#false} havoc #t~ret11.base, #t~ret11.offset; {1861#false} is VALID [2020-07-08 16:26:30,310 INFO L280 TraceCheckUtils]: 19: Hoare triple {1861#false} havoc ~i~0; {1861#false} is VALID [2020-07-08 16:26:30,311 INFO L280 TraceCheckUtils]: 20: Hoare triple {1861#false} ~i~0 := ~len~0 - 1; {1861#false} is VALID [2020-07-08 16:26:30,311 INFO L280 TraceCheckUtils]: 21: Hoare triple {1861#false} assume !!(~i~0 >= 0); {1861#false} is VALID [2020-07-08 16:26:30,311 INFO L280 TraceCheckUtils]: 22: Hoare triple {1861#false} ~new_data~0 := ~i~0 + ~len~0; {1861#false} is VALID [2020-07-08 16:26:30,311 INFO L263 TraceCheckUtils]: 23: Hoare triple {1861#false} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1894#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-08 16:26:30,312 INFO L280 TraceCheckUtils]: 24: Hoare triple {1894#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1860#true} is VALID [2020-07-08 16:26:30,312 INFO L280 TraceCheckUtils]: 25: Hoare triple {1860#true} ~data := #in~data; {1860#true} is VALID [2020-07-08 16:26:30,312 INFO L280 TraceCheckUtils]: 26: Hoare triple {1860#true} ~index := #in~index; {1860#true} is VALID [2020-07-08 16:26:30,313 INFO L280 TraceCheckUtils]: 27: Hoare triple {1860#true} assume !(~index > 0); {1860#true} is VALID [2020-07-08 16:26:30,313 INFO L280 TraceCheckUtils]: 28: Hoare triple {1860#true} SUMMARY for call write~int(~data, ~head.base, ~head.offset, 4); srcloc: L596-3 {1860#true} is VALID [2020-07-08 16:26:30,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,313 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1860#true} {1861#false} #188#return; {1861#false} is VALID [2020-07-08 16:26:30,314 INFO L280 TraceCheckUtils]: 31: Hoare triple {1861#false} #t~post12 := ~i~0; {1861#false} is VALID [2020-07-08 16:26:30,314 INFO L280 TraceCheckUtils]: 32: Hoare triple {1861#false} ~i~0 := #t~post12 - 1; {1861#false} is VALID [2020-07-08 16:26:30,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {1861#false} havoc #t~post12; {1861#false} is VALID [2020-07-08 16:26:30,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {1861#false} assume !(~i~0 >= 0); {1861#false} is VALID [2020-07-08 16:26:30,315 INFO L280 TraceCheckUtils]: 35: Hoare triple {1861#false} ~i~0 := ~len~0 - 1; {1861#false} is VALID [2020-07-08 16:26:30,315 INFO L280 TraceCheckUtils]: 36: Hoare triple {1861#false} assume !!(~i~0 >= 0); {1861#false} is VALID [2020-07-08 16:26:30,315 INFO L280 TraceCheckUtils]: 37: Hoare triple {1861#false} ~expected~0 := ~i~0 + ~len~0; {1861#false} is VALID [2020-07-08 16:26:30,315 INFO L263 TraceCheckUtils]: 38: Hoare triple {1861#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1860#true} is VALID [2020-07-08 16:26:30,316 INFO L280 TraceCheckUtils]: 39: Hoare triple {1860#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1860#true} is VALID [2020-07-08 16:26:30,316 INFO L280 TraceCheckUtils]: 40: Hoare triple {1860#true} ~index := #in~index; {1860#true} is VALID [2020-07-08 16:26:30,316 INFO L280 TraceCheckUtils]: 41: Hoare triple {1860#true} assume !(~index > 0); {1860#true} is VALID [2020-07-08 16:26:30,317 INFO L280 TraceCheckUtils]: 42: Hoare triple {1860#true} SUMMARY for call #t~mem8 := read~int(~head.base, ~head.offset, 4); srcloc: L589-3 {1860#true} is VALID [2020-07-08 16:26:30,317 INFO L280 TraceCheckUtils]: 43: Hoare triple {1860#true} #res := #t~mem8; {1860#true} is VALID [2020-07-08 16:26:30,317 INFO L280 TraceCheckUtils]: 44: Hoare triple {1860#true} havoc #t~mem8; {1860#true} is VALID [2020-07-08 16:26:30,317 INFO L280 TraceCheckUtils]: 45: Hoare triple {1860#true} assume true; {1860#true} is VALID [2020-07-08 16:26:30,318 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1860#true} {1861#false} #190#return; {1861#false} is VALID [2020-07-08 16:26:30,318 INFO L280 TraceCheckUtils]: 47: Hoare triple {1861#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1861#false} is VALID [2020-07-08 16:26:30,318 INFO L280 TraceCheckUtils]: 48: Hoare triple {1861#false} assume ~expected~0 != #t~ret14; {1861#false} is VALID [2020-07-08 16:26:30,318 INFO L280 TraceCheckUtils]: 49: Hoare triple {1861#false} havoc #t~ret14; {1861#false} is VALID [2020-07-08 16:26:30,319 INFO L280 TraceCheckUtils]: 50: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2020-07-08 16:26:30,322 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-08 16:26:30,323 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:26:30,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094311153] [2020-07-08 16:26:30,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:26:30,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 16:26:30,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761545628] [2020-07-08 16:26:30,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-08 16:26:30,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:26:30,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 16:26:30,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 16:26:30,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:26:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 16:26:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 16:26:30,374 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 8 states. [2020-07-08 16:26:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:31,515 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2020-07-08 16:26:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 16:26:31,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-08 16:26:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:26:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2020-07-08 16:26:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 16:26:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2020-07-08 16:26:31,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 154 transitions. [2020-07-08 16:26:31,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 16:26:31,697 INFO L225 Difference]: With dead ends: 147 [2020-07-08 16:26:31,698 INFO L226 Difference]: Without dead ends: 93 [2020-07-08 16:26:31,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-08 16:26:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-08 16:26:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2020-07-08 16:26:31,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:26:31,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 86 states. [2020-07-08 16:26:31,888 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 86 states. [2020-07-08 16:26:31,888 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 86 states. [2020-07-08 16:26:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:31,893 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-07-08 16:26:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2020-07-08 16:26:31,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:31,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:31,895 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 93 states. [2020-07-08 16:26:31,895 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 93 states. [2020-07-08 16:26:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:26:31,899 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-07-08 16:26:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2020-07-08 16:26:31,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:26:31,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:26:31,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:26:31,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:26:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-08 16:26:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2020-07-08 16:26:31,904 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 51 [2020-07-08 16:26:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:26:31,905 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2020-07-08 16:26:31,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 16:26:31,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2020-07-08 16:26:32,049 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-08 16:26:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2020-07-08 16:26:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-08 16:26:32,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:26:32,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 16:26:32,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:26:32,053 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:26:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:26:32,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1957255427, now seen corresponding path program 1 times [2020-07-08 16:26:32,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:26:32,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511664212] [2020-07-08 16:26:32,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:26:32,068 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 16:26:32,069 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 16:26:32,075 INFO L168 Benchmark]: Toolchain (without parser) took 8651.24 ms. Allocated memory was 142.1 MB in the beginning and 345.5 MB in the end (delta: 203.4 MB). Free memory was 99.4 MB in the beginning and 289.3 MB in the end (delta: -189.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-08 16:26:32,076 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 16:26:32,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.61 ms. Allocated memory was 142.1 MB in the beginning and 198.2 MB in the end (delta: 56.1 MB). Free memory was 99.2 MB in the beginning and 162.5 MB in the end (delta: -63.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-07-08 16:26:32,077 INFO L168 Benchmark]: Boogie Preprocessor took 79.77 ms. Allocated memory is still 198.2 MB. Free memory was 162.5 MB in the beginning and 159.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-07-08 16:26:32,078 INFO L168 Benchmark]: RCFGBuilder took 813.05 ms. Allocated memory is still 198.2 MB. Free memory was 159.0 MB in the beginning and 90.9 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2020-07-08 16:26:32,079 INFO L168 Benchmark]: TraceAbstraction took 7053.52 ms. Allocated memory was 198.2 MB in the beginning and 345.5 MB in the end (delta: 147.3 MB). Free memory was 90.2 MB in the beginning and 289.3 MB in the end (delta: -199.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 16:26:32,083 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.24 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 699.61 ms. Allocated memory was 142.1 MB in the beginning and 198.2 MB in the end (delta: 56.1 MB). Free memory was 99.2 MB in the beginning and 162.5 MB in the end (delta: -63.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.77 ms. Allocated memory is still 198.2 MB. Free memory was 162.5 MB in the beginning and 159.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.05 ms. Allocated memory is still 198.2 MB. Free memory was 159.0 MB in the beginning and 90.9 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7053.52 ms. Allocated memory was 198.2 MB in the beginning and 345.5 MB in the end (delta: 147.3 MB). Free memory was 90.2 MB in the beginning and 289.3 MB in the end (delta: -199.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...