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/merge_sort_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:21:28,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:21:28,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:21:28,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:21:28,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:21:28,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:21:28,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:21:28,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:21:28,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:21:28,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:21:28,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:21:28,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:21:28,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:21:28,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:21:28,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:21:28,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:21:28,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:21:28,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:21:28,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:21:28,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:21:28,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:21:28,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:21:28,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:21:28,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:21:28,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:21:28,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:21:28,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:21:28,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:21:28,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:21:28,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:21:28,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:21:28,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:21:28,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:21:28,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:21:28,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:21:28,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:21:28,540 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:28,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:21:28,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:21:28,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:21:28,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:21:28,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:21:28,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:21:28,573 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:21:28,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:21:28,573 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:21:28,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:21:28,573 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:21:28,574 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:21:28,574 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:21:28,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:21:28,574 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:21:28,574 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:21:28,575 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:21:28,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:21:28,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:21:28,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:21:28,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:21:28,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:21:28,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:21:28,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:21:28,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:21:28,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:21:28,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:21:28,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:21:28,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:21:28,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:21:28,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:21:28,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:21:28,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:21:28,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:21:28,662 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:21:28,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:28,719 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71749c0bd/1efa212ed35a406f8e5836a09fc44b1b/FLAG12a5c06a1 [2018-11-14 17:21:29,261 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:21:29,262 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:29,281 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71749c0bd/1efa212ed35a406f8e5836a09fc44b1b/FLAG12a5c06a1 [2018-11-14 17:21:29,301 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71749c0bd/1efa212ed35a406f8e5836a09fc44b1b [2018-11-14 17:21:29,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:21:29,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:21:29,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:29,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:21:29,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:21:29,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:29" (1/1) ... [2018-11-14 17:21:29,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e258413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:29, skipping insertion in model container [2018-11-14 17:21:29,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:21:29" (1/1) ... [2018-11-14 17:21:29,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:21:29,406 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:21:29,839 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:29,860 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:21:29,949 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:21:30,127 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:21:30,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:30 WrapperNode [2018-11-14 17:21:30,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:21:30,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:21:30,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:21:30,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:21:30,145 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:30" (1/1) ... [2018-11-14 17:21:30,145 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:30" (1/1) ... [2018-11-14 17:21:30,182 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:30" (1/1) ... [2018-11-14 17:21:30,182 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:30" (1/1) ... [2018-11-14 17:21:30,244 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:30" (1/1) ... [2018-11-14 17:21:30,260 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:30" (1/1) ... [2018-11-14 17:21:30,270 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:30" (1/1) ... [2018-11-14 17:21:30,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:21:30,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:21:30,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:21:30,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:21:30,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:30" (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:30,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:21:30,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:21:30,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:21:30,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-11-14 17:21:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-11-14 17:21:30,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:21:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:21:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:21:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:21:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:21:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:21:30,346 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:21:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:21:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:21:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:21:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:21:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:21:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:21:30,353 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:21:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:21:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:21:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:21:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:21:30,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:21:30,359 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:21:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:21:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:21:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:21:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:21:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:21:32,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:21:32,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:32 BoogieIcfgContainer [2018-11-14 17:21:32,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:21:32,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:21:32,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:21:32,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:21:32,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:21:29" (1/3) ... [2018-11-14 17:21:32,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7329fbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:32, skipping insertion in model container [2018-11-14 17:21:32,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:21:30" (2/3) ... [2018-11-14 17:21:32,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7329fbae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:21:32, skipping insertion in model container [2018-11-14 17:21:32,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:21:32" (3/3) ... [2018-11-14 17:21:32,361 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:21:32,371 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:21:32,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:21:32,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:21:32,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:21:32,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:21:32,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:21:32,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:21:32,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:21:32,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:21:32,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:21:32,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:21:32,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:21:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-11-14 17:21:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:21:32,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:32,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:32,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:32,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 993254836, now seen corresponding path program 1 times [2018-11-14 17:21:32,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:32,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:32,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2018-11-14 17:21:32,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {127#true} is VALID [2018-11-14 17:21:32,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2018-11-14 17:21:32,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #455#return; {127#true} is VALID [2018-11-14 17:21:32,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret44 := main(); {127#true} is VALID [2018-11-14 17:21:32,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {127#true} ~data~0.base, ~data~0.offset := 0, 0; {127#true} is VALID [2018-11-14 17:21:32,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#true} assume !true; {128#false} is VALID [2018-11-14 17:21:32,683 INFO L273 TraceCheckUtils]: 7: Hoare triple {128#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {128#false} is VALID [2018-11-14 17:21:32,684 INFO L256 TraceCheckUtils]: 8: Hoare triple {128#false} call inspect_before(~data~0.base, ~data~0.offset); {128#false} is VALID [2018-11-14 17:21:32,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {128#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {128#false} is VALID [2018-11-14 17:21:32,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {128#false} assume true; {128#false} is VALID [2018-11-14 17:21:32,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {128#false} assume ~shape.base == 0 && ~shape.offset == 0; {128#false} is VALID [2018-11-14 17:21:32,685 INFO L256 TraceCheckUtils]: 12: Hoare triple {128#false} call fail(); {128#false} is VALID [2018-11-14 17:21:32,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {128#false} assume !false; {128#false} is VALID [2018-11-14 17:21:32,692 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:32,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:32,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:21:32,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:21:32,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:32,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:21:32,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:32,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:21:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:21:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:21:32,906 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2018-11-14 17:21:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:33,447 INFO L93 Difference]: Finished difference Result 240 states and 391 transitions. [2018-11-14 17:21:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:21:33,448 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:21:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2018-11-14 17:21:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:21:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 391 transitions. [2018-11-14 17:21:33,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 391 transitions. [2018-11-14 17:21:34,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:34,295 INFO L225 Difference]: With dead ends: 240 [2018-11-14 17:21:34,296 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:21:34,303 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:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:21:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-14 17:21:34,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:34,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-14 17:21:34,389 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 17:21:34,389 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 17:21:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:34,400 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-14 17:21:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-14 17:21:34,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:34,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:34,402 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-14 17:21:34,402 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-14 17:21:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:34,412 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-14 17:21:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-14 17:21:34,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:34,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:34,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:34,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-14 17:21:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2018-11-14 17:21:34,425 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 14 [2018-11-14 17:21:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:34,426 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2018-11-14 17:21:34,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:21:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-14 17:21:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:21:34,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:34,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:34,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:34,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 213030440, now seen corresponding path program 1 times [2018-11-14 17:21:34,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:34,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {813#true} is VALID [2018-11-14 17:21:34,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {813#true} is VALID [2018-11-14 17:21:34,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {813#true} assume true; {813#true} is VALID [2018-11-14 17:21:34,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} #455#return; {813#true} is VALID [2018-11-14 17:21:34,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {813#true} call #t~ret44 := main(); {813#true} is VALID [2018-11-14 17:21:34,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {813#true} ~data~0.base, ~data~0.offset := 0, 0; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:34,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume true; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:34,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:34,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume !(#t~nondet36 != 0);havoc #t~nondet36; {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} is VALID [2018-11-14 17:21:34,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {815#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {814#false} is VALID [2018-11-14 17:21:34,578 INFO L256 TraceCheckUtils]: 10: Hoare triple {814#false} call inspect_before(~data~0.base, ~data~0.offset); {814#false} is VALID [2018-11-14 17:21:34,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {814#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {814#false} is VALID [2018-11-14 17:21:34,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {814#false} assume true; {814#false} is VALID [2018-11-14 17:21:34,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {814#false} assume ~shape.base == 0 && ~shape.offset == 0; {814#false} is VALID [2018-11-14 17:21:34,579 INFO L256 TraceCheckUtils]: 14: Hoare triple {814#false} call fail(); {814#false} is VALID [2018-11-14 17:21:34,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {814#false} assume !false; {814#false} is VALID [2018-11-14 17:21:34,581 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:34,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:34,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:21:34,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:21:34,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:34,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:21:34,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:34,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:21:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:21:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:34,622 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand 3 states. [2018-11-14 17:21:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:34,994 INFO L93 Difference]: Finished difference Result 216 states and 262 transitions. [2018-11-14 17:21:34,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:21:34,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:21:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-14 17:21:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:21:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2018-11-14 17:21:35,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 262 transitions. [2018-11-14 17:21:35,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:35,433 INFO L225 Difference]: With dead ends: 216 [2018-11-14 17:21:35,434 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:21:35,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:21:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:21:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-11-14 17:21:35,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:35,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 114 states. [2018-11-14 17:21:35,526 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 114 states. [2018-11-14 17:21:35,526 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 114 states. [2018-11-14 17:21:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:35,533 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-14 17:21:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-11-14 17:21:35,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:35,535 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 118 states. [2018-11-14 17:21:35,535 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 118 states. [2018-11-14 17:21:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:35,541 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-11-14 17:21:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2018-11-14 17:21:35,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:35,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:35,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:35,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 17:21:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2018-11-14 17:21:35,549 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 16 [2018-11-14 17:21:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:35,549 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2018-11-14 17:21:35,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:21:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2018-11-14 17:21:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:21:35,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:35,551 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:35,551 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:35,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1390052738, now seen corresponding path program 1 times [2018-11-14 17:21:35,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:35,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:35,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:35,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2018-11-14 17:21:35,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {1492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1492#true} is VALID [2018-11-14 17:21:35,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2018-11-14 17:21:35,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #455#return; {1492#true} is VALID [2018-11-14 17:21:35,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret44 := main(); {1492#true} is VALID [2018-11-14 17:21:35,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {1492#true} ~data~0.base, ~data~0.offset := 0, 0; {1492#true} is VALID [2018-11-14 17:21:35,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {1492#true} assume true; {1492#true} is VALID [2018-11-14 17:21:35,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {1492#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1492#true} is VALID [2018-11-14 17:21:35,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {1492#true} assume !!(#t~nondet36 != 0);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {1492#true} is VALID [2018-11-14 17:21:35,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {1492#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1492#true} is VALID [2018-11-14 17:21:35,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {1492#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset + 0, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, ~node~1.offset + 4, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {1494#(not (= 0 main_~item~0.base))} is VALID [2018-11-14 17:21:35,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1494#(not (= 0 main_~item~0.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {1494#(not (= 0 main_~item~0.base))} is VALID [2018-11-14 17:21:35,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {1494#(not (= 0 main_~item~0.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset + 0, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, ~item~0.offset + 4, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:35,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume true; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:35,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:35,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume !(#t~nondet36 != 0);havoc #t~nondet36; {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:35,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1495#(not (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {1495#(not (= 0 main_~data~0.base))} is VALID [2018-11-14 17:21:35,914 INFO L256 TraceCheckUtils]: 17: Hoare triple {1495#(not (= 0 main_~data~0.base))} call inspect_before(~data~0.base, ~data~0.offset); {1496#(not (= 0 |inspect_before_#in~shape.base|))} is VALID [2018-11-14 17:21:35,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {1496#(not (= 0 |inspect_before_#in~shape.base|))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {1497#(not (= 0 inspect_before_~shape.base))} is VALID [2018-11-14 17:21:35,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#(not (= 0 inspect_before_~shape.base))} assume true; {1497#(not (= 0 inspect_before_~shape.base))} is VALID [2018-11-14 17:21:35,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {1497#(not (= 0 inspect_before_~shape.base))} assume ~shape.base == 0 && ~shape.offset == 0; {1493#false} is VALID [2018-11-14 17:21:35,919 INFO L256 TraceCheckUtils]: 21: Hoare triple {1493#false} call fail(); {1493#false} is VALID [2018-11-14 17:21:35,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2018-11-14 17:21:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:35,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:21:35,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 17:21:35,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:35,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:21:35,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:35,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:21:35,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:21:35,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:21:35,985 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand 6 states. [2018-11-14 17:21:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:36,984 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-11-14 17:21:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:21:36,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-14 17:21:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:21:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-14 17:21:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:21:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2018-11-14 17:21:36,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2018-11-14 17:21:37,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:37,252 INFO L225 Difference]: With dead ends: 163 [2018-11-14 17:21:37,253 INFO L226 Difference]: Without dead ends: 158 [2018-11-14 17:21:37,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:21:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-14 17:21:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 119. [2018-11-14 17:21:37,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:37,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 119 states. [2018-11-14 17:21:37,342 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 119 states. [2018-11-14 17:21:37,343 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 119 states. [2018-11-14 17:21:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:37,351 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-11-14 17:21:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-14 17:21:37,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:37,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:37,353 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 158 states. [2018-11-14 17:21:37,353 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 158 states. [2018-11-14 17:21:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:37,360 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2018-11-14 17:21:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-14 17:21:37,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:37,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:37,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:37,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 17:21:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-11-14 17:21:37,367 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 23 [2018-11-14 17:21:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:37,367 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-11-14 17:21:37,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:21:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-11-14 17:21:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:21:37,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:37,369 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:37,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:37,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 310598650, now seen corresponding path program 1 times [2018-11-14 17:21:37,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:37,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:37,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2018-11-14 17:21:37,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {2192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2192#true} is VALID [2018-11-14 17:21:37,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-14 17:21:37,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2192#true} {2192#true} #455#return; {2192#true} is VALID [2018-11-14 17:21:37,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {2192#true} call #t~ret44 := main(); {2192#true} is VALID [2018-11-14 17:21:37,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {2192#true} ~data~0.base, ~data~0.offset := 0, 0; {2192#true} is VALID [2018-11-14 17:21:37,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-14 17:21:37,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {2192#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2192#true} is VALID [2018-11-14 17:21:37,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !!(#t~nondet36 != 0);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2192#true} is VALID [2018-11-14 17:21:37,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2192#true} is VALID [2018-11-14 17:21:37,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {2192#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset + 0, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, ~node~1.offset + 4, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2192#true} is VALID [2018-11-14 17:21:37,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {2192#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2192#true} is VALID [2018-11-14 17:21:37,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {2192#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset + 0, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, ~item~0.offset + 4, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2192#true} is VALID [2018-11-14 17:21:37,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-14 17:21:37,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {2192#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2192#true} is VALID [2018-11-14 17:21:37,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {2192#true} assume !(#t~nondet36 != 0);havoc #t~nondet36; {2192#true} is VALID [2018-11-14 17:21:37,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {2192#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2192#true} is VALID [2018-11-14 17:21:37,512 INFO L256 TraceCheckUtils]: 17: Hoare triple {2192#true} call inspect_before(~data~0.base, ~data~0.offset); {2192#true} is VALID [2018-11-14 17:21:37,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {2192#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2192#true} is VALID [2018-11-14 17:21:37,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-14 17:21:37,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {2192#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2192#true} is VALID [2018-11-14 17:21:37,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {2192#true} assume true; {2192#true} is VALID [2018-11-14 17:21:37,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {2194#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|))} is VALID [2018-11-14 17:21:37,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {2194#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.offset|))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-14 17:21:37,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-14 17:21:37,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-14 17:21:37,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true; {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-14 17:21:37,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {2195#(and (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume true;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {2196#(and (= 0 |inspect_before_#t~mem26.offset|) (= 0 |inspect_before_#t~mem26.base|))} is VALID [2018-11-14 17:21:37,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {2196#(and (= 0 |inspect_before_#t~mem26.offset|) (= 0 |inspect_before_#t~mem26.base|))} assume !(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {2193#false} is VALID [2018-11-14 17:21:37,526 INFO L256 TraceCheckUtils]: 29: Hoare triple {2193#false} call fail(); {2193#false} is VALID [2018-11-14 17:21:37,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2018-11-14 17:21:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:21:37,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:37,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:21:37,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 17:21:37,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:37,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:21:37,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:37,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:21:37,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:21:37,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:21:37,611 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 5 states. [2018-11-14 17:21:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:38,928 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2018-11-14 17:21:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:21:38,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 17:21:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 17:21:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 17:21:38,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-14 17:21:39,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:39,111 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:21:39,111 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:21:39,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:21:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:21:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-14 17:21:39,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:39,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-14 17:21:39,166 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 17:21:39,167 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 17:21:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:39,171 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2018-11-14 17:21:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-14 17:21:39,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:39,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:39,172 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-14 17:21:39,172 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-14 17:21:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:39,177 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2018-11-14 17:21:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-14 17:21:39,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:39,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:39,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:39,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-14 17:21:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2018-11-14 17:21:39,182 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 31 [2018-11-14 17:21:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:39,182 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2018-11-14 17:21:39,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:21:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2018-11-14 17:21:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:21:39,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:39,184 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:39,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:39,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:39,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1477891468, now seen corresponding path program 1 times [2018-11-14 17:21:39,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:39,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {2752#true} call ULTIMATE.init(); {2752#true} is VALID [2018-11-14 17:21:39,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {2752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2752#true} is VALID [2018-11-14 17:21:39,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-14 17:21:39,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2752#true} {2752#true} #455#return; {2752#true} is VALID [2018-11-14 17:21:39,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {2752#true} call #t~ret44 := main(); {2752#true} is VALID [2018-11-14 17:21:39,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {2752#true} ~data~0.base, ~data~0.offset := 0, 0; {2752#true} is VALID [2018-11-14 17:21:39,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-14 17:21:39,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {2752#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2752#true} is VALID [2018-11-14 17:21:39,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {2752#true} assume !!(#t~nondet36 != 0);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {2752#true} is VALID [2018-11-14 17:21:39,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {2752#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {2752#true} is VALID [2018-11-14 17:21:39,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {2752#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset + 0, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, ~node~1.offset + 4, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {2752#true} is VALID [2018-11-14 17:21:39,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {2752#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {2752#true} is VALID [2018-11-14 17:21:39,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {2752#true} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset + 0, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, ~item~0.offset + 4, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {2752#true} is VALID [2018-11-14 17:21:39,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-14 17:21:39,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {2752#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2752#true} is VALID [2018-11-14 17:21:39,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {2752#true} assume !(#t~nondet36 != 0);havoc #t~nondet36; {2752#true} is VALID [2018-11-14 17:21:39,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {2752#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2752#true} is VALID [2018-11-14 17:21:39,342 INFO L256 TraceCheckUtils]: 17: Hoare triple {2752#true} call inspect_before(~data~0.base, ~data~0.offset); {2752#true} is VALID [2018-11-14 17:21:39,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {2752#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2752#true} is VALID [2018-11-14 17:21:39,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-14 17:21:39,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#true} assume !(~shape.base == 0 && ~shape.offset == 0); {2752#true} is VALID [2018-11-14 17:21:39,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {2752#true} assume true; {2752#true} is VALID [2018-11-14 17:21:39,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {2752#true} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {2754#(and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem25.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2018-11-14 17:21:39,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {2754#(and (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= |inspect_before_#t~mem25.base| (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-14 17:21:39,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-14 17:21:39,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume !(~shape.base == 0 && ~shape.offset == 0); {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-14 17:21:39,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true; {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2018-11-14 17:21:39,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {2755#(or (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume true;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {2756#(or (not (= 0 |inspect_before_#t~mem21.offset|)) (not (= 0 |inspect_before_#t~mem21.base|)))} is VALID [2018-11-14 17:21:39,351 INFO L273 TraceCheckUtils]: 28: Hoare triple {2756#(or (not (= 0 |inspect_before_#t~mem21.offset|)) (not (= 0 |inspect_before_#t~mem21.base|)))} assume #t~mem21.base == 0 && #t~mem21.offset == 0;havoc #t~mem21.base, #t~mem21.offset; {2753#false} is VALID [2018-11-14 17:21:39,351 INFO L256 TraceCheckUtils]: 29: Hoare triple {2753#false} call fail(); {2753#false} is VALID [2018-11-14 17:21:39,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {2753#false} assume !false; {2753#false} is VALID [2018-11-14 17:21:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:21:39,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:39,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:21:39,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 17:21:39,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:39,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:21:39,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:39,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:21:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:21:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:21:39,401 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand 5 states. [2018-11-14 17:21:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:40,389 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2018-11-14 17:21:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:21:40,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 17:21:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-14 17:21:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:21:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-14 17:21:40,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-14 17:21:40,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:40,661 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:21:40,662 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 17:21:40,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:21:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 17:21:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-14 17:21:40,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:40,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2018-11-14 17:21:40,736 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-14 17:21:40,736 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-14 17:21:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:40,740 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2018-11-14 17:21:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-14 17:21:40,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:40,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:40,741 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2018-11-14 17:21:40,741 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2018-11-14 17:21:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:40,745 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2018-11-14 17:21:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-14 17:21:40,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:40,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:40,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:40,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-14 17:21:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2018-11-14 17:21:40,750 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 31 [2018-11-14 17:21:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:40,751 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2018-11-14 17:21:40,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:21:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-11-14 17:21:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:21:40,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:40,752 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:40,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1496433235, now seen corresponding path program 1 times [2018-11-14 17:21:40,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:40,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:40,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:40,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {3306#true} call ULTIMATE.init(); {3306#true} is VALID [2018-11-14 17:21:40,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {3306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3306#true} is VALID [2018-11-14 17:21:40,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {3306#true} assume true; {3306#true} is VALID [2018-11-14 17:21:40,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3306#true} {3306#true} #455#return; {3306#true} is VALID [2018-11-14 17:21:40,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {3306#true} call #t~ret44 := main(); {3306#true} is VALID [2018-11-14 17:21:40,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {3306#true} ~data~0.base, ~data~0.offset := 0, 0; {3306#true} is VALID [2018-11-14 17:21:40,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {3306#true} assume true; {3306#true} is VALID [2018-11-14 17:21:40,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {3306#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3306#true} is VALID [2018-11-14 17:21:40,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {3306#true} assume !!(#t~nondet36 != 0);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:40,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {3308#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:40,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {3308#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset + 0, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, ~node~1.offset + 4, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:40,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {3308#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3308#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:40,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {3308#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset + 0, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, ~item~0.offset + 4, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:40,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume true; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:40,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:40,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(#t~nondet36 != 0);havoc #t~nondet36; {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:40,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:40,959 INFO L256 TraceCheckUtils]: 17: Hoare triple {3309#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3310#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2018-11-14 17:21:40,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {3310#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,960 INFO L273 TraceCheckUtils]: 20: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,961 INFO L273 TraceCheckUtils]: 21: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,961 INFO L273 TraceCheckUtils]: 22: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:40,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:41,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:41,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:41,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {3311#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset + 0, 4); {3312#(not (= 0 |inspect_before_#t~mem27.base|))} is VALID [2018-11-14 17:21:41,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {3312#(not (= 0 |inspect_before_#t~mem27.base|))} assume #t~mem27.base == 0 && #t~mem27.offset == 0;havoc #t~mem27.base, #t~mem27.offset; {3307#false} is VALID [2018-11-14 17:21:41,013 INFO L256 TraceCheckUtils]: 32: Hoare triple {3307#false} call fail(); {3307#false} is VALID [2018-11-14 17:21:41,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {3307#false} assume !false; {3307#false} is VALID [2018-11-14 17:21:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:41,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:41,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:21:41,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:21:41,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:41,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:21:41,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:41,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:21:41,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:21:41,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:21:41,069 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 7 states. [2018-11-14 17:21:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:42,413 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-11-14 17:21:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:21:42,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:21:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:21:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2018-11-14 17:21:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:21:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2018-11-14 17:21:42,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 181 transitions. [2018-11-14 17:21:42,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:42,651 INFO L225 Difference]: With dead ends: 155 [2018-11-14 17:21:42,651 INFO L226 Difference]: Without dead ends: 152 [2018-11-14 17:21:42,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:21:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-14 17:21:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2018-11-14 17:21:42,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:42,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 123 states. [2018-11-14 17:21:42,863 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 123 states. [2018-11-14 17:21:42,863 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 123 states. [2018-11-14 17:21:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:42,869 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2018-11-14 17:21:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2018-11-14 17:21:42,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:42,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:42,870 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 152 states. [2018-11-14 17:21:42,870 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 152 states. [2018-11-14 17:21:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:42,874 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2018-11-14 17:21:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2018-11-14 17:21:42,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:42,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:42,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:42,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 17:21:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-11-14 17:21:42,879 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 34 [2018-11-14 17:21:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:42,880 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-11-14 17:21:42,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:21:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-11-14 17:21:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:21:42,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:42,881 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:42,881 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:42,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash -408502051, now seen corresponding path program 1 times [2018-11-14 17:21:42,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:42,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:42,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:42,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:21:43,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-14 17:21:43,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3984#true} is VALID [2018-11-14 17:21:43,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-14 17:21:43,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3984#true} {3984#true} #455#return; {3984#true} is VALID [2018-11-14 17:21:43,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {3984#true} call #t~ret44 := main(); {3984#true} is VALID [2018-11-14 17:21:43,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {3984#true} ~data~0.base, ~data~0.offset := 0, 0; {3984#true} is VALID [2018-11-14 17:21:43,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-14 17:21:43,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {3984#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3984#true} is VALID [2018-11-14 17:21:43,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {3984#true} assume !!(#t~nondet36 != 0);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:43,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {3986#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:43,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {3986#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset + 0, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, ~node~1.offset + 4, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:43,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {3986#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {3986#(not (= 0 main_~node~1.base))} is VALID [2018-11-14 17:21:43,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {3986#(not (= 0 main_~node~1.base))} call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset + 0, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, ~item~0.offset + 4, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:43,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume true; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:43,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:43,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(#t~nondet36 != 0);havoc #t~nondet36; {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:43,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2018-11-14 17:21:43,391 INFO L256 TraceCheckUtils]: 17: Hoare triple {3987#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {3988#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2018-11-14 17:21:43,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {3988#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(~shape.base == 0 && ~shape.offset == 0); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, ~shape.offset + 4, 4); {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume !(#t~mem21.base == 0 && #t~mem21.offset == 0);havoc #t~mem21.base, #t~mem21.offset; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true; {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} is VALID [2018-11-14 17:21:43,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {3989#(not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset)))} assume true;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~shape.base, ~shape.offset + 0, 4); {3990#(not (= 0 |inspect_before_#t~mem22.base|))} is VALID [2018-11-14 17:21:43,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {3990#(not (= 0 |inspect_before_#t~mem22.base|))} assume #t~mem22.base == 0 && #t~mem22.offset == 0;havoc #t~mem22.base, #t~mem22.offset; {3985#false} is VALID [2018-11-14 17:21:43,401 INFO L256 TraceCheckUtils]: 32: Hoare triple {3985#false} call fail(); {3985#false} is VALID [2018-11-14 17:21:43,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-14 17:21:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:21:43,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:21:43,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:21:43,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:21:43,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:21:43,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:21:43,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:43,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:21:43,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:21:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:21:43,437 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 7 states. [2018-11-14 17:21:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:44,636 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2018-11-14 17:21:44,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:21:44,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-14 17:21:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:21:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:21:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-14 17:21:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:21:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-14 17:21:44,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 179 transitions. [2018-11-14 17:21:44,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:21:44,933 INFO L225 Difference]: With dead ends: 154 [2018-11-14 17:21:44,934 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 17:21:44,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:21:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 17:21:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 129. [2018-11-14 17:21:45,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:21:45,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 129 states. [2018-11-14 17:21:45,058 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 129 states. [2018-11-14 17:21:45,058 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 129 states. [2018-11-14 17:21:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:45,065 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-11-14 17:21:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2018-11-14 17:21:45,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:45,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:45,066 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 151 states. [2018-11-14 17:21:45,066 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 151 states. [2018-11-14 17:21:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:21:45,072 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-11-14 17:21:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2018-11-14 17:21:45,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:21:45,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:21:45,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:21:45,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:21:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-14 17:21:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-11-14 17:21:45,079 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 34 [2018-11-14 17:21:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:21:45,079 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-11-14 17:21:45,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:21:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-11-14 17:21:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:21:45,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:21:45,081 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:21:45,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:21:45,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:21:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1691091992, now seen corresponding path program 1 times [2018-11-14 17:21:45,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:21:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:21:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:21:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:21:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:21:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:21:45,188 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:21:45,227 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2018-11-14 17:21:45,227 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2018-11-14 17:21:45,227 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: merge_pairENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: merge_single_nodeENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: seq_sort_coreENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-14 17:21:45,228 WARN L170 areAnnotationChecker]: inspect_beforeENTRY has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: inspect_afterENTRY has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: failFINAL has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: merge_single_nodeFINAL has no Hoare annotation [2018-11-14 17:21:45,229 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L604-6 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L604-6 has no Hoare annotation [2018-11-14 17:21:45,230 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: L618-6 has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: L618-6 has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,231 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,232 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: L577-6 has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2018-11-14 17:21:45,233 WARN L170 areAnnotationChecker]: L587-4 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2018-11-14 17:21:45,234 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2018-11-14 17:21:45,235 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L608-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2018-11-14 17:21:45,236 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L612-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L613-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-14 17:21:45,237 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L619-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L623-3 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L577-2 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: L577-2 has no Hoare annotation [2018-11-14 17:21:45,238 WARN L170 areAnnotationChecker]: merge_pairFINAL has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: seq_sort_coreFINAL has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L611-5 has no Hoare annotation [2018-11-14 17:21:45,239 WARN L170 areAnnotationChecker]: L611-5 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L628-2 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L628-2 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2018-11-14 17:21:45,240 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L606-6 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L606-6 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2018-11-14 17:21:45,241 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L609-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L609-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L605-2 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2018-11-14 17:21:45,242 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L614-5 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L614-6 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L620-6 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L623-6 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L577-4 has no Hoare annotation [2018-11-14 17:21:45,243 WARN L170 areAnnotationChecker]: L577-4 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: merge_pairEXIT has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: seq_sort_coreEXIT has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-14 17:21:45,244 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-14 17:21:45,245 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2018-11-14 17:21:45,246 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: inspect_beforeEXIT has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2018-11-14 17:21:45,247 WARN L170 areAnnotationChecker]: inspect_afterEXIT has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2018-11-14 17:21:45,248 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-14 17:21:45,249 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2018-11-14 17:21:45,250 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2018-11-14 17:21:45,251 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L644-1 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L644-1 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2018-11-14 17:21:45,252 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2018-11-14 17:21:45,253 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-14 17:21:45,254 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-14 17:21:45,254 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-14 17:21:45,254 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-14 17:21:45,254 WARN L170 areAnnotationChecker]: L649-4 has no Hoare annotation [2018-11-14 17:21:45,254 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:21:45,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:21:45 BoogieIcfgContainer [2018-11-14 17:21:45,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:21:45,259 INFO L168 Benchmark]: Toolchain (without parser) took 15945.85 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -193.7 MB). Peak memory consumption was 688.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:45,261 INFO L168 Benchmark]: CDTParser took 0.19 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:45,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.4 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:45,262 INFO L168 Benchmark]: Boogie Preprocessor took 150.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:45,263 INFO L168 Benchmark]: RCFGBuilder took 2073.74 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:45,264 INFO L168 Benchmark]: TraceAbstraction took 12903.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.4 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 496.1 MB). Peak memory consumption was 623.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:21:45,268 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.19 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 810.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.4 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 150.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2073.74 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12903.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.4 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 496.1 MB). Peak memory consumption was 623.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] EXPR, FCALL malloc(sizeof *node) [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L632] FCALL node->next = node [L633] FCALL node->value = __VERIFIER_nondet_int() [L634] EXPR, FCALL malloc(sizeof *item) [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L637] FCALL item->slist = node [L638] FCALL item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={11:0}, node={11:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L604] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L605] FCALL shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L611] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L612] EXPR, FCALL shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L612] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L613] EXPR, FCALL shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={11:0}] [L613] COND FALSE !(!(shape->slist)) [L613] COND FALSE !(0) VAL [shape={10:0}, shape={10:0}] [L614] EXPR, FCALL shape->slist [L614] EXPR, FCALL shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={11:0}, shape->slist->next={11:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 130 locations, 1 error locations. UNSAFE Result, 12.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 870 SDtfs, 385 SDslu, 2015 SDs, 0 SdLazy, 624 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 21242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...