java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:21:24,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:21:24,129 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:21:24,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:21:24,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:21:24,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:21:24,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:21:24,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:21:24,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:21:24,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:21:24,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:21:24,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:21:24,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:21:24,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:21:24,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:21:24,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:21:24,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:21:24,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:21:24,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:21:24,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:21:24,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:21:24,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:21:24,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:21:24,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:21:24,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:21:24,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:21:24,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:21:24,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:21:24,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:21:24,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:21:24,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:21:24,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:21:24,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:21:24,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:21:24,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:21:24,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:21:24,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:21:24,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:21:24,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:21:24,236 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:21:24,236 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:21:24,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:21:24,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:21:24,237 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:21:24,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:21:24,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:21:24,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:21:24,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:21:24,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:21:24,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:21:24,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:21:24,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:21:24,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:21:24,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:21:24,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:21:24,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:21:24,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:21:24,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:21:24,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:21:24,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:21:24,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:21:24,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:21:24,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:21:24,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:21:24,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:21:24,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:21:24,243 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:21:24,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:21:24,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:21:24,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:21:24,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:21:24,328 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:21:24,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:24,388 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01852a35/3cf003b0a66b45f8b1864e7afcacc368/FLAGeb5fdf03e [2018-11-14 17:21:25,032 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:21:25,033 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:25,051 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01852a35/3cf003b0a66b45f8b1864e7afcacc368/FLAGeb5fdf03e [2018-11-14 17:21:25,066 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01852a35/3cf003b0a66b45f8b1864e7afcacc368 [2018-11-14 17:21:25,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:21:25,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:21:25,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:25,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:21:25,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:21:25,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:25" (1/1) ... [2018-11-14 17:21:25,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781c61f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:25, skipping insertion in model container [2018-11-14 17:21:25,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:25" (1/1) ... [2018-11-14 17:21:25,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:21:25,156 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:21:25,705 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:25,718 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:21:25,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:26,050 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:21:26,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26 WrapperNode [2018-11-14 17:21:26,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:26,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:21:26,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:21:26,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:21:26,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... [2018-11-14 17:21:26,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:21:26,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:21:26,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:21:26,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:21:26,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:21:26,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:21:26,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:21:26,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:21:26,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-14 17:21:26,270 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-11-14 17:21:26,271 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-11-14 17:21:26,271 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-11-14 17:21:26,271 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-11-14 17:21:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-11-14 17:21:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-11-14 17:21:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-11-14 17:21:26,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:21:26,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:21:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:21:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:21:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:21:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:21:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:21:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:21:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:21:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:21:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:21:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:21:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:21:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:21:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:21:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:21:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:21:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:21:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:21:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:21:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:21:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:21:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2018-11-14 17:21:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2018-11-14 17:21:26,290 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2018-11-14 17:21:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2018-11-14 17:21:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2018-11-14 17:21:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2018-11-14 17:21:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2018-11-14 17:21:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2018-11-14 17:21:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2018-11-14 17:21:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2018-11-14 17:21:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2018-11-14 17:21:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2018-11-14 17:21:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2018-11-14 17:21:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2018-11-14 17:21:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:21:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-14 17:21:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:21:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:21:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:21:28,397 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:21:28,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:28 BoogieIcfgContainer [2018-11-14 17:21:28,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:21:28,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:21:28,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:21:28,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:21:28,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:21:25" (1/3) ... [2018-11-14 17:21:28,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd270b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:28, skipping insertion in model container [2018-11-14 17:21:28,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:26" (2/3) ... [2018-11-14 17:21:28,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd270b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:28, skipping insertion in model container [2018-11-14 17:21:28,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:28" (3/3) ... [2018-11-14 17:21:28,410 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:28,421 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:21:28,432 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:21:28,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:21:28,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:21:28,492 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:21:28,492 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:21:28,492 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:21:28,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:21:28,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:21:28,493 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:21:28,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:21:28,493 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:21:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-11-14 17:21:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:21:28,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:28,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:28,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:28,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash 839258423, now seen corresponding path program 1 times [2018-11-14 17:21:28,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:28,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:28,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:28,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:28,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {158#true} call ULTIMATE.init(); {158#true} is VALID [2018-11-14 17:21:28,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {158#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 0, 4);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 4, 4); {158#true} is VALID [2018-11-14 17:21:28,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {158#true} assume true; {158#true} is VALID [2018-11-14 17:21:28,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {158#true} {158#true} #521#return; {158#true} is VALID [2018-11-14 17:21:28,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {158#true} call #t~ret59 := main(); {158#true} is VALID [2018-11-14 17:21:28,787 INFO L256 TraceCheckUtils]: 5: Hoare triple {158#true} call gl_read(); {158#true} is VALID [2018-11-14 17:21:28,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#true} assume !true; {159#false} is VALID [2018-11-14 17:21:28,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {159#false} assume true; {159#false} is VALID [2018-11-14 17:21:28,804 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {159#false} {158#true} #505#return; {159#false} is VALID [2018-11-14 17:21:28,804 INFO L256 TraceCheckUtils]: 9: Hoare triple {159#false} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {159#false} is VALID [2018-11-14 17:21:28,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {159#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {159#false} is VALID [2018-11-14 17:21:28,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {159#false} assume true; {159#false} is VALID [2018-11-14 17:21:28,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {159#false} assume ~head.base == 0 && ~head.offset == 0; {159#false} is VALID [2018-11-14 17:21:28,806 INFO L256 TraceCheckUtils]: 13: Hoare triple {159#false} call fail(); {159#false} is VALID [2018-11-14 17:21:28,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {159#false} assume !false; {159#false} is VALID [2018-11-14 17:21:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:28,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:28,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:21:28,822 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:21:28,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:28,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:21:29,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:29,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:21:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:21:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:21:29,022 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-11-14 17:21:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:29,919 INFO L93 Difference]: Finished difference Result 300 states and 471 transitions. [2018-11-14 17:21:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:21:29,920 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:21:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 471 transitions. [2018-11-14 17:21:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 471 transitions. [2018-11-14 17:21:29,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 471 transitions. [2018-11-14 17:21:30,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:30,723 INFO L225 Difference]: With dead ends: 300 [2018-11-14 17:21:30,723 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 17:21:30,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:21:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 17:21:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-14 17:21:30,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:30,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 139 states. [2018-11-14 17:21:30,862 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states. [2018-11-14 17:21:30,862 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states. [2018-11-14 17:21:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:30,875 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2018-11-14 17:21:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-11-14 17:21:30,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:30,879 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states. [2018-11-14 17:21:30,879 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states. [2018-11-14 17:21:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:30,889 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2018-11-14 17:21:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-11-14 17:21:30,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:30,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:30,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:30,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 17:21:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2018-11-14 17:21:30,904 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 15 [2018-11-14 17:21:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:30,905 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2018-11-14 17:21:30,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:21:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-11-14 17:21:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:21:30,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:30,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:30,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:30,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1868078728, now seen corresponding path program 1 times [2018-11-14 17:21:30,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:30,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:30,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:31,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1030#true} is VALID [2018-11-14 17:21:31,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {1030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 0, 4);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 4, 4); {1032#(not (= 0 |~#gl_list~0.base|))} is VALID [2018-11-14 17:21:31,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {1032#(not (= 0 |~#gl_list~0.base|))} assume true; {1032#(not (= 0 |~#gl_list~0.base|))} is VALID [2018-11-14 17:21:31,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1032#(not (= 0 |~#gl_list~0.base|))} {1030#true} #521#return; {1032#(not (= 0 |~#gl_list~0.base|))} is VALID [2018-11-14 17:21:31,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {1032#(not (= 0 |~#gl_list~0.base|))} call #t~ret59 := main(); {1032#(not (= 0 |~#gl_list~0.base|))} is VALID [2018-11-14 17:21:31,159 INFO L256 TraceCheckUtils]: 5: Hoare triple {1032#(not (= 0 |~#gl_list~0.base|))} call gl_read(); {1030#true} is VALID [2018-11-14 17:21:31,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {1030#true} assume true;assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647; {1030#true} is VALID [2018-11-14 17:21:31,160 INFO L256 TraceCheckUtils]: 7: Hoare triple {1030#true} call gl_insert(#t~nondet50); {1030#true} is VALID [2018-11-14 17:21:31,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {1030#true} ~value := #in~value;call #t~malloc48.base, #t~malloc48.offset := #Ultimate.alloc(20);~node~1.base, ~node~1.offset := #t~malloc48.base, #t~malloc48.offset; {1030#true} is VALID [2018-11-14 17:21:31,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {1030#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1030#true} is VALID [2018-11-14 17:21:31,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#true} call write~int(~value, ~node~1.base, ~node~1.offset + 0, 4); {1030#true} is VALID [2018-11-14 17:21:31,161 INFO L256 TraceCheckUtils]: 11: Hoare triple {1030#true} call list_add(~node~1.base, ~node~1.offset + 4, ~#gl_list~0.base, ~#gl_list~0.offset); {1030#true} is VALID [2018-11-14 17:21:31,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4); {1030#true} is VALID [2018-11-14 17:21:31,161 INFO L256 TraceCheckUtils]: 13: Hoare triple {1030#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem45.base, #t~mem45.offset); {1030#true} is VALID [2018-11-14 17:21:31,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~next.offset + 4, 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset + 0, 4);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~new.offset + 4, 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset + 0, 4); {1030#true} is VALID [2018-11-14 17:21:31,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:21:31,162 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1030#true} {1030#true} #515#return; {1030#true} is VALID [2018-11-14 17:21:31,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {1030#true} havoc #t~mem45.base, #t~mem45.offset; {1030#true} is VALID [2018-11-14 17:21:31,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:21:31,163 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1030#true} {1030#true} #459#return; {1030#true} is VALID [2018-11-14 17:21:31,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {1030#true} assume true;call write~$Pointer$(~node~1.base, ~node~1.offset + 12, ~node~1.base, ~node~1.offset + 12 + 0, 4);call write~$Pointer$(~node~1.base, ~node~1.offset + 12, ~node~1.base, ~node~1.offset + 12 + 0, 4); {1030#true} is VALID [2018-11-14 17:21:31,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:21:31,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:21:31,164 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1030#true} {1030#true} #503#return; {1030#true} is VALID [2018-11-14 17:21:31,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {1030#true} havoc #t~nondet50; {1030#true} is VALID [2018-11-14 17:21:31,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {1030#true} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647; {1030#true} is VALID [2018-11-14 17:21:31,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {1030#true} assume !(#t~nondet49 != 0);havoc #t~nondet49; {1030#true} is VALID [2018-11-14 17:21:31,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:21:31,165 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1030#true} {1032#(not (= 0 |~#gl_list~0.base|))} #505#return; {1032#(not (= 0 |~#gl_list~0.base|))} is VALID [2018-11-14 17:21:31,166 INFO L256 TraceCheckUtils]: 29: Hoare triple {1032#(not (= 0 |~#gl_list~0.base|))} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {1033#(not (= 0 |inspect_#in~head.base|))} is VALID [2018-11-14 17:21:31,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {1033#(not (= 0 |inspect_#in~head.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1034#(not (= 0 inspect_~head.base))} is VALID [2018-11-14 17:21:31,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {1034#(not (= 0 inspect_~head.base))} assume true; {1034#(not (= 0 inspect_~head.base))} is VALID [2018-11-14 17:21:31,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {1034#(not (= 0 inspect_~head.base))} assume ~head.base == 0 && ~head.offset == 0; {1031#false} is VALID [2018-11-14 17:21:31,170 INFO L256 TraceCheckUtils]: 33: Hoare triple {1031#false} call fail(); {1031#false} is VALID [2018-11-14 17:21:31,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2018-11-14 17:21:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:31,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:31,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:21:31,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 17:21:31,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:31,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:21:31,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:31,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:21:31,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:21:31,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:21:31,301 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 5 states. [2018-11-14 17:21:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:32,204 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-11-14 17:21:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:21:32,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 17:21:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2018-11-14 17:21:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2018-11-14 17:21:32,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 161 transitions. [2018-11-14 17:21:32,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:32,461 INFO L225 Difference]: With dead ends: 141 [2018-11-14 17:21:32,461 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 17:21:32,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:21:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 17:21:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-14 17:21:32,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:32,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 138 states. [2018-11-14 17:21:32,570 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 138 states. [2018-11-14 17:21:32,570 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 138 states. [2018-11-14 17:21:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:32,579 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-14 17:21:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-11-14 17:21:32,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:32,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:32,581 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 138 states. [2018-11-14 17:21:32,582 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 138 states. [2018-11-14 17:21:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:32,589 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-14 17:21:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-11-14 17:21:32,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:32,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:32,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:32,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-14 17:21:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-11-14 17:21:32,598 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 35 [2018-11-14 17:21:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:32,598 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-11-14 17:21:32,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:21:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-11-14 17:21:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 17:21:32,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:32,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:32,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:32,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1961064138, now seen corresponding path program 1 times [2018-11-14 17:21:32,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:32,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:32,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:32,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:33,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {1694#true} call ULTIMATE.init(); {1694#true} is VALID [2018-11-14 17:21:33,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {1694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#gl_list~0.base, ~#gl_list~0.offset := #Ultimate.alloc(8);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 0, 4);call write~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset + 4, 4); {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} is VALID [2018-11-14 17:21:33,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} assume true; {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} is VALID [2018-11-14 17:21:33,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} {1694#true} #521#return; {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} is VALID [2018-11-14 17:21:33,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} call #t~ret59 := main(); {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} is VALID [2018-11-14 17:21:33,239 INFO L256 TraceCheckUtils]: 5: Hoare triple {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} call gl_read(); {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume true;assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647; {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,241 INFO L256 TraceCheckUtils]: 7: Hoare triple {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call gl_insert(#t~nondet50); {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~value := #in~value;call #t~malloc48.base, #t~malloc48.offset := #Ultimate.alloc(20);~node~1.base, ~node~1.offset := #t~malloc48.base, #t~malloc48.offset; {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~int(~value, ~node~1.base, ~node~1.offset + 0, 4); {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 17:21:33,246 INFO L256 TraceCheckUtils]: 11: Hoare triple {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call list_add(~node~1.base, ~node~1.offset + 4, ~#gl_list~0.base, ~#gl_list~0.offset); {1699#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2018-11-14 17:21:33,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {1699#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4); {1700#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem45.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-14 17:21:33,250 INFO L256 TraceCheckUtils]: 13: Hoare triple {1700#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem45.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base))} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, #t~mem45.base, #t~mem45.offset); {1694#true} is VALID [2018-11-14 17:21:33,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {1694#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;call write~$Pointer$(~new.base, ~new.offset, ~next.base, ~next.offset + 4, 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset + 0, 4);call write~$Pointer$(~prev.base, ~prev.offset, ~new.base, ~new.offset + 4, 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset + 0, 4); {1701#(or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= |__list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))} is VALID [2018-11-14 17:21:33,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {1701#(or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= |__list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))} assume true; {1701#(or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= |__list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))} is VALID [2018-11-14 17:21:33,256 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1701#(or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= |__list_add_#in~next.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))} {1700#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem45.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base))} #515#return; {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} is VALID [2018-11-14 17:21:33,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} havoc #t~mem45.base, #t~mem45.offset; {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} is VALID [2018-11-14 17:21:33,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} assume true; {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} is VALID [2018-11-14 17:21:33,261 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1702#(or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))} {1698#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} #459#return; {1703#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {1703#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume true;call write~$Pointer$(~node~1.base, ~node~1.offset + 12, ~node~1.base, ~node~1.offset + 12 + 0, 4);call write~$Pointer$(~node~1.base, ~node~1.offset + 12, ~node~1.base, ~node~1.offset + 12 + 0, 4); {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume true; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume true; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,266 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} {1697#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} #503#return; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} havoc #t~nondet50; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume !(#t~nondet49 != 0);havoc #t~nondet49; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} assume true; {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} is VALID [2018-11-14 17:21:33,270 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1704#(or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|))) (= 0 (select |old(#valid)| |~#gl_list~0.base|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list~0.base|) |~#gl_list~0.offset|) |~#gl_list~0.base|)))} {1696#(and (= (select |#valid| |~#gl_list~0.base|) 1) (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} #505#return; {1705#(not (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} is VALID [2018-11-14 17:21:33,271 INFO L256 TraceCheckUtils]: 29: Hoare triple {1705#(not (= |~#gl_list~0.base| (select (select |#memory_$Pointer$.base| |~#gl_list~0.base|) |~#gl_list~0.offset|)))} call inspect(~#gl_list~0.base, ~#gl_list~0.offset); {1706#(not (= |inspect_#in~head.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)))} is VALID [2018-11-14 17:21:33,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {1706#(not (= |inspect_#in~head.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) |inspect_#in~head.offset|)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} is VALID [2018-11-14 17:21:33,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} assume true; {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} is VALID [2018-11-14 17:21:33,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} assume !(~head.base == 0 && ~head.offset == 0); {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} is VALID [2018-11-14 17:21:33,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} assume true; {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} is VALID [2018-11-14 17:21:33,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {1707#(not (= inspect_~head.base (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset)))} assume true;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4); {1708#(not (= inspect_~head.base |inspect_#t~mem30.base|))} is VALID [2018-11-14 17:21:33,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {1708#(not (= inspect_~head.base |inspect_#t~mem30.base|))} assume !(#t~mem30.base != ~head.base || #t~mem30.offset != ~head.offset);havoc #t~mem30.base, #t~mem30.offset; {1695#false} is VALID [2018-11-14 17:21:33,277 INFO L256 TraceCheckUtils]: 36: Hoare triple {1695#false} call fail(); {1695#false} is VALID [2018-11-14 17:21:33,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {1695#false} assume !false; {1695#false} is VALID [2018-11-14 17:21:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:33,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:33,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-14 17:21:33,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-11-14 17:21:33,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:33,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:21:33,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:33,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:21:33,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:21:33,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:21:33,385 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 15 states. [2018-11-14 17:21:34,681 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-14 17:21:35,725 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-11-14 17:21:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:43,034 INFO L93 Difference]: Finished difference Result 309 states and 371 transitions. [2018-11-14 17:21:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:21:43,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-11-14 17:21:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:21:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 371 transitions. [2018-11-14 17:21:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:21:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 371 transitions. [2018-11-14 17:21:43,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 371 transitions. [2018-11-14 17:21:43,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:43,607 INFO L225 Difference]: With dead ends: 309 [2018-11-14 17:21:43,607 INFO L226 Difference]: Without dead ends: 306 [2018-11-14 17:21:43,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:21:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-14 17:21:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 275. [2018-11-14 17:21:43,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:43,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 275 states. [2018-11-14 17:21:43,898 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 275 states. [2018-11-14 17:21:43,898 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 275 states. [2018-11-14 17:21:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:43,913 INFO L93 Difference]: Finished difference Result 306 states and 368 transitions. [2018-11-14 17:21:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2018-11-14 17:21:43,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:43,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:43,916 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 306 states. [2018-11-14 17:21:43,916 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 306 states. [2018-11-14 17:21:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:43,932 INFO L93 Difference]: Finished difference Result 306 states and 368 transitions. [2018-11-14 17:21:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2018-11-14 17:21:43,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:43,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:43,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:43,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-14 17:21:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-11-14 17:21:43,949 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 38 [2018-11-14 17:21:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:43,949 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-11-14 17:21:43,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:21:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-11-14 17:21:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:21:43,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:43,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:43,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:43,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1640133318, now seen corresponding path program 1 times [2018-11-14 17:21:43,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:44,510 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus - at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-14 17:21:44,515 INFO L168 Benchmark]: Toolchain (without parser) took 19437.20 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -527.2 MB). Peak memory consumption was 540.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:44,516 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:21:44,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 971.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.1 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:44,518 INFO L168 Benchmark]: Boogie Preprocessor took 151.86 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:21:44,519 INFO L168 Benchmark]: RCFGBuilder took 2196.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.2 MB). Peak memory consumption was 129.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:44,519 INFO L168 Benchmark]: TraceAbstraction took 16111.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 317.7 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 113.7 MB). Peak memory consumption was 431.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:44,524 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 971.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -770.1 MB). Peak memory consumption was 51.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.86 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 2196.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.2 MB). Peak memory consumption was 129.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16111.45 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 317.7 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 113.7 MB). Peak memory consumption was 431.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus - de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus -: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...